IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v89y2024i2d10.1007_s10898-023-01354-0.html
   My bibliography  Save this article

Single-lot, lot-streaming problem for a 1 + m hybrid flow shop

Author

Listed:
  • Sanchit Singh

    (Virginia Tech)

  • Subhash C. Sarin

    (Virginia Tech)

  • Ming Cheng

    (Soochow University)

Abstract

In this paper, we consider an application of lot-streaming for processing a lot of multiple items in a hybrid flow shop (HFS) for the objective of minimizing makespan. The HFS that we consider consists of two stages with a single machine available for processing in Stage 1 and m identical parallel machines in Stage 2. We call this problem a 1 + m TSHFS-LSP (two-stage hybrid flow shop, lot streaming problem), and show it to be NP-hard in general, except for the case when the sublot sizes are treated to be continuous. The novelty of our work is in obtaining closed-form expressions for optimal continuous sublot sizes that can be solved in polynomial time, for a given number of sublots. A fast linear search algorithm is also developed for determining the optimal number of sublots for the case of continuous sublot sizes. For the case when the sublot sizes are discrete, we propose a branch-and-bound-based heuristic to determine both the number of sublots and sublot sizes and demonstrate its efficacy by comparing its performance against that of a direct solution of a mixed-integer formulation of the problem by CPLEX®.

Suggested Citation

  • Sanchit Singh & Subhash C. Sarin & Ming Cheng, 2024. "Single-lot, lot-streaming problem for a 1 + m hybrid flow shop," Journal of Global Optimization, Springer, vol. 89(2), pages 435-455, June.
    • Handle: RePEc:spr:jglopt:v:89:y:2024:i:2:d:10.1007_s10898-023-01354-0
    DOI: 10.1007/s10898-023-01354-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01354-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-023-01354-0?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.

    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:jglopt:v:89:y:2024:i:2:d:10.1007_s10898-023-01354-0. 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.