This item is available under a Creative Commons License for non-commercial use only
2. ENGINEERING AND TECHNOLOGY
A computational study has been developed to obtain optimal / near optimal solution for the flow shop scheduling problem with make-span minimization as the primary criterion and the minimization of either the mean completion time, total waiting time or total idle time as the secondary criterion. The objective is to determine a sequence of operations in which to process ‘n’ jobs on ‘m’ machines in same order (flow shop environment) where skipping is allowed. The Simulation approach for deterministic and stochastic flow shop scheduling has been developed. It reads and manipulates data for 500 jobs on 500 machines. Different factorial experiments present a comparative study on the performance of different dispatching rules, such as FCFS, SPT, LPT, SRPT and LRPT with respect to the objectives of minimizing makespan, mean flow time, waiting time of jobs, and idle time of machines.
The proposed model is evaluated and found to be relatively more effective in finding optimal/ near optimal solutions in many cases. The influence of the problem size in computational time for this model is discussed and recommendations for further research are presented.
Arish, A., Young, P., El Baradie, M.:Flow Shop Scheduling Problem: a Computational Study.Sixth International Conference on Production Engineering and Design for Development (PEDD6),Cairo, Egypt, pp 543 – 557.