Solvable cases of the flow‐shop problem without interruptions in job processing

Wlodzimierz Szwarc

Naval Research Logistics Quarterly, 1983, vol. 30, issue 1, 179-183

Abstract: This article examines solvable cases of the flow‐shop problem without interruptions in job processing where the completion time is being minimized. All those cases utilize Gilmore‐Gomory's algorithm. A lower completion time bound is also provided.

Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800300114

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:wly:navlog:v:30:y:1983:i:1:p:179-183

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().