IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i1d10.1007_s43069-024-00304-0.html
   My bibliography  Save this article

A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem

Author

Listed:
  • Dana Marsetiya Utama

    (University of Muhammadiyah Malang)

  • Cynthia Novel Imron

    (University of Muhammadiyah Malang)

Abstract

Scheduling issues have become a critical problem in the company because they affect manufacturing performance and production continuity. One of the production scheduling issues is the no-idle flow shop scheduling problem (NIFSP), which does not allow machines to be idle. This article attempts to present an analysis of published articles on NIFSP. This study employs a systematic review to examine 63 articles. The articles studied were published between 1981 and 2023. Article reviews are classified by country, year, publisher, journal/conference, objective function, classification of methods used, and NIFS variants. This article presents the review analysis results, research gaps, and future research directions.

Suggested Citation

  • Dana Marsetiya Utama & Cynthia Novel Imron, 2024. "A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem," SN Operations Research Forum, Springer, vol. 5(1), pages 1-32, March.
    • Handle: RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-024-00304-0
    DOI: 10.1007/s43069-024-00304-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00304-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/s43069-024-00304-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.

    References listed on IDEAS

    as
    1. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    2. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2021. "Minimizing total completion time in the two-machine no-idle no-wait flow shop problem," Journal of Heuristics, Springer, vol. 27(1), pages 159-173, April.
    3. Wang, Ji-Bo & Xia, Zun-Quan, 2006. "Flow shop scheduling with deteriorating jobs under dominating machines," Omega, Elsevier, vol. 34(4), pages 327-336, August.
    4. Zewen Sun & Xingsheng Gu, 2017. "Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization," Sustainability, MDPI, vol. 9(6), pages 1-16, June.
    5. Saadani, Nour El Houda & Guinet, Alain & Moalla, Mohamed, 2005. "A travelling salesman approach to solve the F/no-idle/Cmax problem," European Journal of Operational Research, Elsevier, vol. 161(1), pages 11-20, February.
    6. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    7. Bailin Wang & Kai Huang & Tieke Li, 2018. "Two-stage hybrid flowshop scheduling with simultaneous processing machines," Journal of Scheduling, Springer, vol. 21(4), pages 387-411, August.
    8. Fernando Luis Rossi & Marcelo Seido Nagano, 2022. "Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1311-1346, December.
    9. G. M. Komaki & Shaya Sheikh & Behnam Malakooti, 2019. "Flow shop scheduling problems with assembly operations: a review and new trends," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 2926-2955, May.
    10. Chen-Yang Cheng & Kuo-Ching Ying & Hsia-Hsiang Chen & Hsiao-Shan Lu, 2019. "Minimising makespan in distributed mixed no-idle flowshops," International Journal of Production Research, Taylor & Francis Journals, vol. 57(1), pages 48-60, January.
    11. Baraz, Daniel & Mosheiov, Gur, 2008. "A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time," European Journal of Operational Research, Elsevier, vol. 184(2), pages 810-813, January.
    Full references (including those not matched with items on IDEAS)

    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. Fernando Luis Rossi & Marcelo Seido Nagano, 2022. "Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1311-1346, December.
    2. Weiwei Cui & Biao Lu, 2020. "A Bi-Objective Approach to Minimize Makespan and Energy Consumption in Flow Shops with Peak Demand Constraint," Sustainability, MDPI, vol. 12(10), pages 1-22, May.
    3. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    4. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
    5. Xiaojuan Jiang & Kangbok Lee & Michael L. Pinedo, 2024. "Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits," Journal of Scheduling, Springer, vol. 27(1), pages 61-86, February.
    6. Victor Fernandez-Viagas & Luis Sanchez-Mediano & Alvaro Angulo-Cortes & David Gomez-Medina & Jose Manuel Molina-Pariente, 2022. "The Permutation Flow Shop Scheduling Problem with Human Resources: MILP Models, Decoding Procedures, NEH-Based Heuristics, and an Iterated Greedy Algorithm," Mathematics, MDPI, vol. 10(19), pages 1-32, September.
    7. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    8. S. S. Panwalkar & Christos Koulamas, 2019. "The evolution of schematic representations of flow shop scheduling problems," Journal of Scheduling, Springer, vol. 22(4), pages 379-391, August.
    9. Chen, Wenchong & Gong, Xuejian & Rahman, Humyun Fuad & Liu, Hongwei & Qi, Ershi, 2021. "Real-time order acceptance and scheduling for data-enabled permutation flow shops: Bilevel interactive optimization with nonlinear integer programming," Omega, Elsevier, vol. 105(C).
    10. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    11. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    12. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    13. Jiang, Junwei & An, Youjun & Dong, Yuanfa & Hu, Jiawen & Li, Yinghe & Zhao, Ziye, 2023. "Integrated optimization of non-permutation flow shop scheduling and maintenance planning with variable processing speed," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    14. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    15. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    16. Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
    17. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    18. J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
    19. Joaquín Bautista-Valhondo & Rocío Alfaro-Pozo, 2020. "Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 5-23, March.
    20. Matthias Bultmann & Sigrid Knust & Stefan Waldherr, 2018. "Flow shop scheduling with flexible processing times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 809-829, July.

    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:snopef:v:5:y:2024:i:1:d:10.1007_s43069-024-00304-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.

    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.