IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i4p1143-1167.html
   My bibliography  Save this article

A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling

Author

Listed:
  • Shijin Wang
  • Ming Liu
  • Chengbin Chu

Abstract

This research investigates a two-stage no-wait hybrid flow-shop scheduling problem in which the first stage contains a single machine, and the second stage contains several identical parallel machines. The objective is to minimise the makespan. For this problem, existing literature emphasises on heuristics or optimal solutions for special cases, whereas this paper proposes a branch-and-bound algorithm. Several lower bounds for optimal and partial schedules are derived. Also, three dominance rules are deduced, and seven constructive heuristics are used to obtain initial upper bounds. Extensive computational tests on randomly generated problems are conducted. The results with comparisons indicate that the proposed bounds (especially partial lower bounds), dominance rules and the branch-and-bound algorithm are efficient.

Suggested Citation

  • Shijin Wang & Ming Liu & Chengbin Chu, 2015. "A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 53(4), pages 1143-1167, February.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:4:p:1143-1167
    DOI: 10.1080/00207543.2014.949363
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.949363
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.949363?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. Lin, Yi-Kuei & Huang, Ding-Hsiang, 2020. "Reliability analysis for a hybrid flow shop with due date consideration," Reliability Engineering and System Safety, Elsevier, vol. 199(C).
    2. Fan Yang & Roel Leus, 2021. "Scheduling hybrid flow shops with time windows," Journal of Heuristics, Springer, vol. 27(1), pages 133-158, April.
    3. Maheshwari, Pratik & Kamble, Sachin & Belhadi, Amine & Venkatesh, Mani & Abedin, Mohammad Zoynul, 2023. "Digital twin-driven real-time planning, monitoring, and controlling in food supply chains," Technological Forecasting and Social Change, Elsevier, vol. 195(C).
    4. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    5. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    6. Koulamas, Christos & Kyparisis, George J., 2023. "Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection," European Journal of Operational Research, Elsevier, vol. 305(2), pages 608-616.
    7. Deepak Gupta & Sonia Goel & Neeraj Mangla, 2022. "Optimization of production scheduling in two stage Flow Shop Scheduling problem with m equipotential machines at first stage," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(3), pages 1162-1169, 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:tprsxx:v:53:y:2015:i:4:p:1143-1167. 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/TPRS20 .

    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.