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

被引：0
|
作者：
Utama D.M. [1 ]
Al Imron C.N. [1 ]
机构：
[1] Department of Industrial Engineering, University of Muhammadiyah Malang, Malang City
来源：
Operations Research Forum | / 5卷 / 1期
关键词：
Flow shop; No-idle flow shop; Scheduling; Systematic review;
D O I：
10.1007/s43069-024-00304-0
中图分类号：
学科分类号：
摘要：
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. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2024.
引用
收藏
相关论文
共 50 条
  • [1] The flow shop problem with no-idle constraints: A review and approximation
    Goncharov, Yaroslav
    Sevastyanov, Sergey
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (02) : 450 - 456
  • [2] Local Search Methods for a Distributed Assembly No-Idle Flow Shop Scheduling Problem
    Shao, Weishi
    Pi, Dechang
    Shao, Zhongshi
    [J]. IEEE SYSTEMS JOURNAL, 2019, 13 (02): : 1945 - 1956
  • [3] Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem
    Zhou, Yongquan
    Chen, Huan
    Zhou, Guo
    [J]. NEUROCOMPUTING, 2014, 137 : 285 - 292
  • [4] A Discrete Sine Optimization Algorithm for No-Idle Flow-Shop Scheduling Problem
    Zhao, Rui
    Gu, Xingsheng
    [J]. Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2020, 54 (12): : 1291 - 1299
  • [5] Mixed no-idle permutation flow shop scheduling problem based on gravitational search algorithm
    Zhao, Rui
    Gu, Xingsheng
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (07): : 1909 - 1917
  • [6] An algorithm based on discrete shuffled frog leaping for No-idle permutation flow shop scheduling problem
    Wang, Ya-Min
    Ji, Jun-Zhong
    Pan, Quan-Ke
    [J]. Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology, 2010, 36 (01): : 124 - 130
  • [7] Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
    Cheng, MingBao
    Sun, ShiJie
    He, LongMin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (01) : 115 - 124
  • [8] Harmony Search Algorithms for Bi-criteria No-idle permutation Flow Shop Scheduling Problem
    Ren, Wen-Juan
    Duan, Jun-Hua
    Zhang, Feng-rong
    Han, Hong-yan
    Zhang, Min
    [J]. 2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, 2011, : 2513 - +
  • [9] Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion
    Shao, Weishi
    Pi, Dechang
    Shao, Zhongshi
    [J]. APPLIED SOFT COMPUTING, 2017, 54 : 164 - 182
  • [10] A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
    Deng, Guanlong
    Gu, Xingsheng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2152 - 2160
12345