Note--Sequencing with Finite Intermediate Storage

S. S. Reddi
Additional contact information
S. S. Reddi: W. W. Gaertner Research Inc., Stamford, Connecticut

Management Science, 1976, vol. 23, issue 2, 216-217

Abstract: This note presents procedures for finding optimal solutions to the deterministic N-job two machine flow-shop sequencing problem when the buffer size z is nearly the same as the number of jobs. When m = N - z - 2 is small, a simple and fast procedure that uses Johnson's algorithm on the middle N - 2m jobs is used. The procedure has a computational complexity of o(N 2m+1 ) comparisons.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.2.216 (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:23:y:1976:i:2:p:216-217

Access Statistics for this article

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