An ordered flow-shop sequencing problem with mean completion time criterion†
- 1 September 1976
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 14 (5) , 631-635
- https://doi.org/10.1080/00207547608956381
Abstract
This paper investigates a subcategory of the classical n job m machine problem in which the processing times of different jobs are ' ordered '. An extremely simple algorithm is presented which obtains a sequence minimizing the mean completion time of all jobs. The proof of optimality is presented in the Appendix. The problem illustratos that although no efficient procedure exists to solve the classical flow-shop problem with the mean completion time criterion, it is possible to develop such a procedure for a specially structured problem.Keywords
This publication has 8 references indexed in Scilit:
- Flowshop Sequencing Problem with Ordered Processing Time MatricesManagement Science, 1975
- Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling ProblemOperations Research, 1971
- Elimination methods in them ×n sequencing problemNaval Research Logistics Quarterly, 1971
- Flow-Shop Scheduling with the Branch-and-Bound MethodOperations Research, 1967
- A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow ShopOperations Research, 1967
- 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