Branch and bound algorithm for the flow shop with multiple processors
- 6 March 1991
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 51 (1), 88-99
- https://doi.org/10.1016/0377-2217(91)90148-o
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Heuristic methods for flexible flow line schedulingJournal of Manufacturing Systems, 1987
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job ShopsOperations Research, 1981
- Scheduling and the problem of computational complexityOmega, 1979
- On lower bounds in permutation flow shop problemsInternational Journal of Production Research, 1979
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound ApproachA I I E Transactions, 1977
- Scheduling with earliest start and due date constraints on multiple machinesNaval Research Logistics Quarterly, 1975
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975
- A Branch-and-Bound Algorithm for Flow Shop Scheduling ProblemsA I I E Transactions, 1970
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965