Technical Note—Three-Stage Flow-Shops with Recessive Second Stage

Fennell Burns and John Rooker
Additional contact information
Fennell Burns: TRW Systems Group, Huntsville, Alabama
John Rooker: System Development Corporation, Huntsville, Alabama

Operations Research, 1978, vol. 26, issue 1, 207-208

Abstract: Several papers have described special structural properties for which the minimum makespan flow-shop problem can be efficiently solved. We describe a new special case of the 3 × n problem with small second-stage processing times relative to the first and third stages for which Johnson's algorithm gives an optimal schedule.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.207 (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:oropre:v:26:y:1978:i:1:p:207-208

Access Statistics for this article

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