Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage

Sujit K. Dutta and Andrew A. Cunningham
Additional contact information
Sujit K. Dutta: Hindu Novitiate Monk
Andrew A. Cunningham: University of Toronto

Management Science, 1975, vol. 21, issue 9, 989-996

Abstract: 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 and computation time requirements for the solution of this model are large, it is modified so as to give a suboptimal recursive procedure which yields good solutions with much less computational effort. A further approximate method based on the technique of successive approximations is shown to provide an alternative means for tackling large problems. In addition, several new results are derived for the particular case where the buffer capacity is zero.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.9.989 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:21:y:1975:i:9:p:989-996

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().