Dutta, Sujit K.; Cunningham, Andrew A. - In: Management Science 21 (1975) 9, pp. 989-996
The deterministic N-job two-machine flow-shop sequencing problem with finite intermediate storage is considered with the objective of minimizing the total processing time. A dynamic programming procedure is presented whereby an optimal solution to the problem may be obtained. Since the storage...