A new heuristic for the n-job, M-machine flow-shop problem
- 1 May 1991
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 52 (2) , 194-202
- https://doi.org/10.1016/0377-2217(91)90080-f
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An extension of Palmer's heuristic for the flow shop scheduling problemInternational Journal of Production Research, 1988
- Heuristics for flow-shop schedulingInternational Journal of Production Research, 1980
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- Solutions to the Constrained Flowshop Sequencing ProblemJournal of the Operational Research Society, 1976
- A Functional Heuristic Algorithm for the Flowshop Scheduling ProblemJournal of the Operational Research Society, 1971
- Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling TechniquesOperations Research, 1970
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- 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
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954