Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach
- 1 September 1977
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 9 (3) , 306-311
- https://doi.org/10.1080/05695557708975160
Abstract
The present paper attempts to generalize the scheduling of n Jobs over m Machines when the objective is to minimize the sum of completion times of all jobs on the last machine. A modified Branch and Bound Technique has been used to solve a numerical example. Discussion and computational results of several problems are given in tabular form at the end.Keywords
This publication has 8 references indexed in Scilit:
- Mathematical aspects of the 3 × n job‐shop sequencing problemNaval Research Logistics Quarterly, 1974
- Optimal Elimination Methods in the m × n Flow-Shop Scheduling ProblemOperations Research, 1973
- A GENERAL ALGORITHM FOR THEn × MFLOWSHOP SCHEDULING PROBLEM†International Journal of Production Research, 1968
- A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow ShopOperations Research, 1967
- 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
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M MachinesOperations Research, 1964
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954