An extension of Palmer's heuristic for the flow shop scheduling problem
- 1 June 1988
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 26 (6) , 1119-1124
- https://doi.org/10.1080/00207548808947922
Abstract
We describe a simple modification of Palmer's heuristic for scheduling jobs in a flow shop. While the additional computation required is relatively small, the performance of the algorithm compares very well with that of the more sophisticated and better algorithm of Campbell, et al. (1970) at a fraction of the effort required by the latter.Keywords
This publication has 8 references indexed in Scilit:
- Heuristics for flow-shop schedulingInternational Journal of Production Research, 1980
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Solutions to the Constrained Flowshop Sequencing ProblemJournal of the Operational Research Society, 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
- An Approach to the Scheduling of Jobs on MachinesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1961
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954