IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i4p584-595.html
   My bibliography  Save this article

Lot Streaming in Job-Shop Scheduling

Author

Listed:
  • Stéphane Dauzère-Pérès

    (Ecole des Mines de Nantes, Nantes, France)

  • Jean-Bernard Lasserre

    (LAAS-CNRS, Toulouse, France)

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.

Suggested Citation

  • Stéphane Dauzère-Pérès & Jean-Bernard Lasserre, 1997. "Lot Streaming in Job-Shop Scheduling," Operations Research, INFORMS, vol. 45(4), pages 584-595, August.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:4:p:584-595
    DOI: 10.1287/opre.45.4.584
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.4.584
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.4.584?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vickson, Raymond G. & Hassini, Elkafi, 2006. "Lot streaming for quality control in two-stage batch production," European Journal of Operational Research, Elsevier, vol. 170(3), pages 824-843, May.
    2. Zapfel, G. & Wasner, M., 2000. "A heuristic solution concept for a generalized machine sequencing problem with an application to radiator manufacturing," International Journal of Production Economics, Elsevier, vol. 68(2), pages 199-213, November.
    3. Kalir, Adar A. & Sarin, Subhash C., 2001. "A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots," Omega, Elsevier, vol. 29(6), pages 577-584, December.
    4. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
    5. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    6. Adar A. Kalir & Subhash C. Sarin, 2003. "Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups," Journal of Combinatorial Optimization, Springer, vol. 7(1), pages 23-44, March.
    7. Sodhi, Manbir S. & Lamond, Bernard F. & Gautier, Antoine & Noel, Martin, 2001. "Heuristics for determining economic processing rates in a flexible manufacturing system," European Journal of Operational Research, Elsevier, vol. 129(1), pages 105-115, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:45:y:1997:i:4:p:584-595. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.