Technical Paper: Solving the No‐intermediate Storage Flowshop Scheduling Problem
International Journal of Operations & Production Management
ISSN: 0144-3577
Article publication date: 1 March 1989
Abstract
The no‐intermediate storage flowshop scheduling problem is investigated. Six algorithms for solving this problem are developed and evaluated in terms of the quality and efficiency of the solutions they produce. Comparative test results from the application of these scheduling algorithms are statistically analysed and discussed.
Keywords
Citation
Kang, B. and Markland, R.E. (1989), "Technical Paper: Solving the No‐intermediate Storage Flowshop Scheduling Problem", International Journal of Operations & Production Management, Vol. 9 No. 3, pp. 48-59. https://doi.org/10.1108/EUM0000000001231
Publisher
:MCB UP Ltd
Copyright © 1989, MCB UP Limited