A note on the flow‐shop problem without interruptions in job processing

Wlodzimierz Szwarc

Naval Research Logistics Quarterly, 1981, vol. 28, issue 4, 665-669

Abstract: This paper deals with a flow‐shop problem where the n jobs are being processed uninterrupted by m machines. A comprehensive theory based on “an earliest starting time of a job” concept produced the most efficient solution method for a variety of optimization criteria. The paper also rectifies several known results in this area.

Date: 1981
References: Add references at CitEc
Citations:

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

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:28:y:1981:i:4:p:665-669

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 ().