IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v44y2012i8p695-710.html
   My bibliography  Save this article

Two-machine lot streaming with attached setup times

Author

Listed:
  • Arianna Alfieri
  • Celia Glass
  • Steef van de Velde

Abstract

Lot streaming is a fundamental production scheduling technique to squeeze manufacturing lead times by splitting a large lot of n identical items into sublots. This article presents a full characterization of optimal solutions for two-stage lot streaming with attached machine setup times to minimize the makespan. An O(n3) time dynamic programming algorithm is presented for the discrete variant of the problem, in which all sublot sizes need to be integral. Since this running time can be prohibitively long for larger n, the continuous variant is also analyzed and an O(n) time algorithm for its solution is presented. Also, rounding procedures for the optimal continuous solution to obtain an approximate solution for the discrete problem are designed and analyzed. It is shown that a particular class of rounding procedures, using dynamic programming, has a compelling absolute worst-case and empirical performance.

Suggested Citation

  • Arianna Alfieri & Celia Glass & Steef van de Velde, 2012. "Two-machine lot streaming with attached setup times," IISE Transactions, Taylor & Francis Journals, vol. 44(8), pages 695-710.
    • Handle: RePEc:taf:uiiexx:v:44:y:2012:i:8:p:695-710
    DOI: 10.1080/0740817X.2011.649384
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2011.649384
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2011.649384?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Niloy J. Mukherjee & Subhash C. Sarin & Daniel A. Neira, 2023. "Lot streaming for a two-stage assembly system in the presence of handling costs," Journal of Scheduling, Springer, vol. 26(4), pages 335-351, August.
    2. Arianna Alfieri & Shuyu Zhou & Rosario Scatamacchia & Steef L. van de Velde, 2021. "Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop," 4OR, Springer, vol. 19(2), pages 265-288, June.

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:44:y:2012:i:8:p:695-710. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.