An evaluation of static flowshop scheduling heuristics in dynamic flowshop models via a computer simulation

Abstract This paper provides an evaluation of static flowshop scheduling heuristics for minimizing makespan as an objective function in the dynamic flowshop model. A total of 16 scheduling heuristics including several revisions and combinations of previously reported methods are summarized. The scheduling rules are evaluated via computer using a SLAM discrete event simulation model. The results for the simulation are analyzed using statistical methods. The results from the study suggest which of the popular scheduling heuristics hold promise for application to practical dynamic flowshop problems.

[1]  N. A. J. Hastings,et al.  A New Bound for Machine Scheduling , 1976 .

[2]  Samuel Eilon.  Dilemmas in the OR world , 1983 .

[3]  B. J. Griffiths,et al.  A study of the cutting and burnishing operation during deep hole drilling and its relationship to drill wear , 1976 .

[4]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[5]  Linus Schrage,et al.  Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..

[6]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[7]  K. W. Littger,et al.  A new approach for the optimum solution of the M by J production scheduling problem , 1976 .

[8]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[9]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[10]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[11]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

[12]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[13]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[14]  Alan J. Mayne,et al.  Introduction to Simulation and SLAM , 1979 .

[15]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[16]  Nobuto Nakamura,et al.  A model for recruiting and training decisions in manpower planning , 1984 .

[17]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .