Processing Time Minimization for the Production Industry: Introduction,branch and Bound Algorithm,aldep Algorithm,dynamic Programming

This work explains various tools to minimize the processing time inthe production industry . the step by step adaptation of these various tools are useful in minimizing the processing time in the production activities which is useful for maximizing the productivity so as to enhance the productivity performance . The other major criteria in this work is the optimization of the layout design using the ALDEP algorithm ,which provides the help to the production sector to remodify their layout design,this will be analysed by comparing the scores of the present and modified layout. After the layout it comes the scheduling the processing activities this work is handled by the methedology called "branch and bound algorithm "and "hodgson algorithm" paves the way to number of tardy jobs in the schedule.