Four simple heuristics for scheduling a flow-shop
- 1 May 1978
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 16 (3) , 221-231
- https://doi.org/10.1080/00207547808930015
Abstract
This paper concerns the minimization of a complex cost function in a flow-shop. Four heuristic methods for obtaining a good solution to the sum of weighted tardiness and weighted flow-time problem are proposed. Computational results are provided and a, recommendation is made with respect to other objective functions.Keywords
This publication has 6 references indexed in Scilit:
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975
- Heuristic-Programming Solution of a Flowshop-Scheduling ProblemOperations Research, 1974
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. TheoryOperations Research, 1974
- 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
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954