No-wait flow shop scheduling with large lot sizes

Alessandro Agnetis

Annals of Operations Research, 1997, vol. 70, issue 0, 415-438

Abstract: NO-WAIT FLOW SHOP consists of minimizing the completion time of a set of N parts that must undergo a series of m machines in the same order, with the constraint that each part, once started, cannot wait on or between the machines. The problem is known to be NP-complete for m ≥ 3, while an O(N log N) algorithm exists when m=2. In this paper, some new results are presented concerning the case in which parts are grouped into lots of identical parts. An ε-approximate algorithm is proposed, based on the solution to a trans-portation problem. The relative error of the approximation goes to zero as the size of any lot grows. Experimental results are reported comparing our approach with the only other ε-approximate algorithm known in literature. Copyright Kluwer Academic Publishers 1997

Keywords: Approximation algorithms; heuristics; no-wait scheduling (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018942709213 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:70:y:1997:i:0:p:415-438:10.1023/a:1018942709213

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018942709213

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().