A survey and evaluation of static flowshop scheduling heuristics
- 1 January 1984
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 22 (1) , 127-141
- https://doi.org/10.1080/00207548408942436
Abstract
This paper provides a survey and evaluation of static flowshop scheduling rules. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are summarized. These scheduling rules are evaluated using a discrete event simulation model. The results for the simulation model are analysed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical flowshop problems.Keywords
This publication has 7 references indexed in Scilit:
- Four simple heuristics for scheduling a flow-shopInternational Journal of Production Research, 1978
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related TasksOperations Research, 1978
- Solutions to the Constrained Flowshop Sequencing ProblemJournal of the Operational Research Society, 1976
- A New Bound for Machine SchedulingJournal of the Operational Research Society, 1976
- A new approach for the optimum solution of the M by J production scheduling problemInternational Journal of Production Research, 1976
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near OptimumJournal of the Operational Research Society, 1965