IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i1d10.1007_s10878-019-00449-3.html
   My bibliography  Save this article

Approximation algorithms for two-stage flexible flow shop scheduling

Author

Listed:
  • Minghui Zhang

    (Dalian Neusoft University of Information
    Dalian University of Technology)

  • Yan Lan

    (Dalian Neusoft University of Information
    Dalian University of Technology)

  • Xin Han

    (Dalian University of Technology)

Abstract

This paper considers a two-stage flexible flow shop scheduling problem, where there are a single machine at the first stage and m parallel machines at the second stage. Each task can be processed by multiple parallel machines at the second stage. The objective is to minimize the makespan. Under some special conditions there is a 3-approximation algorithm for this problem. We propose a new ($$2+\epsilon $$2+ϵ)-approximation algorithm without any condition. For the case where all parallel machines assigned to a task at the second stage must have contiguous addresses, we propose two polynomial time approximation algorithms with approximate ratio less than or equal to 3 by using the existing parallel machine scheduling and strip packing results. Meanwhile two special cases are discussed when the machines number of the second stage is 2 and 3 respectively. Two approximation algorithms with approximation ratios of 2.5 and 2.67 under linear time complexity are proposed. Finally a new lower bound of the model is provided according to the classical Johnson algorithm which improves the previous result.

Suggested Citation

  • Minghui Zhang & Yan Lan & Xin Han, 2020. "Approximation algorithms for two-stage flexible flow shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 1-14, January.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00449-3
    DOI: 10.1007/s10878-019-00449-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00449-3
    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/s10878-019-00449-3?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.

    References listed on IDEAS

    as
    1. Almeder, Christian & Hartl, Richard F., 2013. "A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer," International Journal of Production Economics, Elsevier, vol. 145(1), pages 88-95.
    2. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    3. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    4. Byung-Cheon Choi & Kangbok Lee, 2013. "Two-stage proportionate flexible flow shop to minimize the makespan," Journal of Combinatorial Optimization, Springer, vol. 25(1), pages 123-134, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Heydar, Mojtaba & Mardaneh, Elham & Loxton, Ryan, 2022. "Approximate dynamic programming for an energy-efficient parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 302(1), pages 363-380.
    2. Anzhen Peng & Longcheng Liu & Weifeng Lin, 2021. "Improved approximation algorithms for two-stage flexible flow shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 28-42, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anzhen Peng & Longcheng Liu & Weifeng Lin, 2021. "Improved approximation algorithms for two-stage flexible flow shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 28-42, January.
    2. Li, Zhan-tao & Chen, Qing-xin & Mao, Ning & Wang, Xiaoming & Liu, Jianjun, 2013. "Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint," International Journal of Production Economics, Elsevier, vol. 146(2), pages 667-678.
    3. Gerstl, Enrique & Mosheiov, Gur, 2014. "A two-stage flexible flow shop problem with unit-execution-time jobs and batching," International Journal of Production Economics, Elsevier, vol. 158(C), pages 171-178.
    4. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.
    5. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    6. Lin, Hung-Tso & Lee, Hong-Tau & Pan, Wen-Jung, 2008. "Heuristics for scheduling in a no-wait open shop with movable dedicated machines," International Journal of Production Economics, Elsevier, vol. 111(2), pages 368-377, February.
    7. Golpîra, Hêriş, 2020. "Smart Energy-Aware Manufacturing Plant Scheduling under Uncertainty: A Risk-Based Multi-Objective Robust Optimization Approach," Energy, Elsevier, vol. 209(C).
    8. Alexander Grigoriev & Martijn Holthuijsen & Joris van de Klundert, 2005. "Basic scheduling problems with raw material constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 527-535, September.
    9. A. G. Leeftink & R. J. Boucherie & E. W. Hans & M. A. M. Verdaasdonk & I. M. H. Vliegen & P. J. Diest, 2018. "Batch scheduling in the histopathology laboratory," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 171-197, June.
    10. Yadong Wang & Baoqiang Fan & Jingang Zhai & Wei Xiong, 2019. "Two-machine flowshop scheduling in a physical examination center," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 363-374, January.
    11. Miri Gilenson & Dvir Shabtay & Liron Yedidsion & Rohit Malshe, 2021. "Scheduling in multi-scenario environment with an agreeable condition on job processing times," Annals of Operations Research, Springer, vol. 307(1), pages 153-173, December.
    12. Peng-Yeng Yin & Hsin-Min Chen & Yi-Lung Cheng & Ying-Chieh Wei & Ya-Lin Huang & Rong-Fuh Day, 2021. "Minimizing the Makespan in Flowshop Scheduling for Sustainable Rubber Circular Manufacturing," Sustainability, MDPI, vol. 13(5), pages 1-18, February.
    13. Asoo J. Vakharia & Yih‐Long Chang, 1990. "A simulated annealing approach to scheduling a manufacturing cell," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 559-577, August.
    14. Yu, Tae-Sun & Han, Jun-Hee, 2021. "Scheduling proportionate flow shops with preventive machine maintenance," International Journal of Production Economics, Elsevier, vol. 231(C).
    15. Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
    16. Vincent T’kindt & Karima Bouibede-Hocine & Carl Esswein, 2007. "Counting and enumeration complexity with application to multicriteria scheduling," Annals of Operations Research, Springer, vol. 153(1), pages 215-234, September.
    17. C.T. Ng & Mikhail Y. Kovalyov, 2004. "An FPTAS for scheduling a two‐machine flowshop with one unavailability interval," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 307-315, April.
    18. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    19. F. Hwang & M. Kovalyov & B. Lin, 2014. "Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence," Annals of Operations Research, Springer, vol. 217(1), pages 263-279, June.
    20. A Corominas & R Pastor, 2011. "Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1704-1710, September.

    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:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00449-3. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.