Heuristics for flow-shop scheduling
- 1 May 1980
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 18 (3) , 345-357
- https://doi.org/10.1080/00207548008919673
Abstract
Existing methods are reviewed and new heuristics examined and developed for the flow-shop scheduling problem. Comparative tests are carried out using simulation methods on different sizes of problem and with different variability of processing time data. New heuristic scheduling rules are determined which give high performance for flow-shop scheduling where there is (i) no job-passing and (ii) no job-waiting.Keywords
This publication has 12 references indexed in Scilit:
- Scheduling and the problem of computational complexityOmega, 1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- 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
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Flow-Shop Scheduling with the Branch-and-Bound MethodOperations Research, 1967
- Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling ProblemJournal of the Operational Research Society, 1966
- A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling ProblemJournal of the Operational Research Society, 1965
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954