IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-9056-2_15.html
   My bibliography  Save this book chapter

Multiple-Lot Lot Streaming in a Two-stage Assembly System

In: Essays in Production, Project Planning and Scheduling

Author

Listed:
  • Liming Yao

    (Virginia Tech)

  • Subhash C. Sarin

    (Virginia Tech)

Abstract

In this chapter, we address a lot streaming problem for a two-stage assembly system involving multiple lots with the objective of minimizing the makespan. Each lot consists of items of a unique product type. We designate this problem as a multiple-lot, two-stage assembly, lot streaming problem (ML-TSALSP) which combines two key decisions: lot splitting and lot sequencing. While the problem of scheduling in such a machine environment has been addressed in the literature, our problem is different because of the presence of the streaming of a lot over the stages. We derive some structural properties for this problem, and develop a branch-and-bound-based solution procedure that relies on effective lower bounds and dominance properties. Our computational investigation reveals the efficacy of the proposed branch-and-bound-based methodology for this problem.

Suggested Citation

  • Liming Yao & Subhash C. Sarin, 2014. "Multiple-Lot Lot Streaming in a Two-stage Assembly System," International Series in Operations Research & Management Science, in: P. Simin Pulat & Subhash C. Sarin & Reha Uzsoy (ed.), Essays in Production, Project Planning and Scheduling, edition 127, chapter 15, pages 357-388, Springer.
    • Handle: RePEc:spr:isochp:978-1-4614-9056-2_15
    DOI: 10.1007/978-1-4614-9056-2_15
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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. Tülin İnkaya & Mehmet Akansel, 2017. "Coordinated scheduling of the transfer lots in an assembly-type supply chain: a genetic algorithm approach," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 1005-1015, April.

    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:spr:isochp:978-1-4614-9056-2_15. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.