An adaptive branching rule for the permutation flow-shop problem
Author:
- 31 July 1980
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 5 (1) , 19-25
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A General Bounding Scheme for the Permutation Flow-Shop ProblemOperations Research, 1978
- Job-Shop Scheduling by Implicit EnumerationManagement Science, 1977
- Complexity of Machine Scheduling Problems1977
- A New Bound for Machine SchedulingJournal of the Operational Research Society, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975
- INVESTIGATION OF VARIOUS BOUNDING PROCEDURES FOR PRODUCTION SCHEDULING PROBLEMS∗International Journal of Production Research, 1968
- Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling ProblemJournal of the Operational Research Society, 1966
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954