Flow Shop Problems with Time Lags

Wlodzimierz Szwarc
Additional contact information
Wlodzimierz Szwarc: University of Wisconsin, Milwaukee

Management Science, 1983, vol. 29, issue 4, 477-481

Abstract: This paper defines a model that covers the multimachine extensions of all existing flow-shop problems with time lags as well as flow-shop problems where setup, processing and release times are separated. Approximate solutions and lower completion time bounds are developed for the restricted and unrestricted cases.

Keywords: production/scheduling: flow shop; queues: deterministic; mathematics: combinatorics (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.4.477 (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:29:y:1983:i:4:p:477-481

Access Statistics for this article

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