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 条
  • [41] No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
    Billaut, J. -C.
    Della Croce, F.
    Salassa, F.
    T'kindt, V.
    [J]. JOURNAL OF SCHEDULING, 2019, 22 (01) : 59 - 68
  • [42] A Self-Learning Discrete Jaya Algorithm for Multiobjective Energy-Efficient Distributed No-Idle Flow-Shop Scheduling Problem in Heterogeneous Factory System
    Zhao, Fuqing
    Ma, Ru
    Wang, Ling
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (12) : 12675 - 12686
  • [43] Two algorithms for no-wait flexible flowshop scheduling problem with no-idle machines
    Jin, Qingwei
    Xing, Wenxun
    [J]. Proceedings of the Sixth International Conference on Information and Management Sciences, 2007, 6 : 636 - 640
  • [44] Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
    Oztop, Hande
    Tasgetiren, M. Fatih
    Kandiller, Levent
    Pan, Quan-Ke
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 138
  • [45] A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
    Tasgetiren, M. Fatih
    Buyukdagli, Ozge
    Pan, Quan-Ke
    Suganthan, Ponnuthurai Nagaratnam
    [J]. SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, PT I (SEMCCO 2013), 2013, 8297 : 24 - +
  • [46] No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
    J.-C. Billaut
    F. Della Croce
    F. Salassa
    V. T’kindt
    [J]. Journal of Scheduling, 2019, 22 : 59 - 68
  • [47] Shuffled Frog Leaping Algorithm for a Bi-objective No-idle Permutation Flow Shop
    Wang, Yamin
    Li, Xiaoping
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, : 2808 - 2813
  • [48] Flowshop/no-idle scheduling to minimise the mean flowtime
    Narain, L
    Bagga, PC
    [J]. ANZIAM JOURNAL, 2005, 47 : 265 - 275
  • [49] A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop
    Nagano M.S.
    Rossi F.L.
    Tomazella C.P.
    [J]. Production Engineering, 2017, 11 (4-5) : 523 - 529
  • [50] Flowshop/no-idle scheduling to minimize total elapsed time
    Narain, L
    Bagga, PC
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2005, 33 (03) : 349 - 367
12345