Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues
- 1 March 1974
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 6 (1) , 28-34
- https://doi.org/10.1080/05695557408974929
Abstract
This paper deals with the flow shop model in which no intermediate job queues are permitted. A branch and bound algorithm for minimizing mean flowtime is developed and detailed computational experience is reported. Experimental results suggest that this problem can be solved as readily as the makespan problem in the traditional flow shop model.Keywords
This publication has 3 references indexed in Scilit:
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972
- Solution of the Flowshop-Scheduling Problem with No Intermediate QueuesOperations Research, 1972
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965