A new constructive heuristic for the flowshop scheduling problem
- 16 February 1998
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 105 (1), 66-71
- https://doi.org/10.1016/s0377-2217(97)00027-1
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- A new heuristic for the n-job, M-machine flow-shop problemEuropean Journal of Operational Research, 1991
- 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
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- Technical Note—Johnson's Three-Machine Flow-Shop ConjectureOperations Research, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- A Functional Heuristic Algorithm for the Flowshop Scheduling ProblemJournal of the Operational Research Society, 1971
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954