Lot Streaming in Job-Shop Scheduling

Stéphane Dauzère-Pérès and Jean-Bernard Lasserre
Additional contact information
Stéphane Dauzère-Pérès: Ecole des Mines de Nantes, Nantes, France
Jean-Bernard Lasserre: LAAS-CNRS, Toulouse, France

Operations Research, 1997, vol. 45, issue 4, 584-595

Abstract: The issue in Lot Streaming is how to split lots into sublots in order to improve the makespan (or some other criterion). We present a model and an iterative procedure for a general job-shop environment. The procedure alternates between solving a lot-sizing problem with a given sequence of sublots on the machines, and a standard job-shop scheduling problem with fixed sublot sizes. We report the computational results on a significant sample of 120 job-shop and flow-shop scheduling problems (including the famous 10–10). In case of no setup, in a few iterations, the makespan approaches a lower bound using very few sublots, suggesting that the procedure yields a global optimum. As a by-product, this result somehow validates the capacitated lot-sizing models in which the detailed capacity constraints, induced by the sequencing of operations, are ignored.

Keywords: production/scheduling; sequencing; lot streaming (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.4.584 (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:45:y:1997:i:4:p:584-595

Access Statistics for this article

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