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.
引用
收藏
相关论文
共 86 条
[61]  
Ling-Fang C., Ling W., Jing-Jing W., A two-stage memetic algorithm for distributed no-idle permutation flow shop scheduling problem, 2018 37Th Chinese Control Conference (CCC), Wuhan, China, pp. 2278-2283, (2018)
[62]  
Wang B., Huang K., Li T., Two-stage hybrid flowshop scheduling with simultaneous processing machines, J Sched, 21, 4, pp. 387-411, (2018)
[63]  
Nagano M.S., Rossi F.L., Tomazella C.P., A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop, Prod Eng Res Devel, 11, 4, pp. 523-529, (2017)
[64]  
Nagano M.S., Rossi F.L., Martarelli N.J., High-performing heuristics to minimize flowtime in no-idle permutation flowshop, Eng Optim, 51, 2, pp. 185-198, (2019)
[65]  
Shen L., Tasgetiren M.F., Oztop H., Kandiller L., Gao L., A general variable neighborhood search for the no-idle flow shop scheduling problem with makespan criterion, In: 2019 IEEE Symposium Series on Computational Intelligence (SSCI, pp. 1684-1691, (2019)
[66]  
Oztop H., Tasgetiren M.F., Kandiller L., Pan Q.K., A novel general variable neighborhood search through q-learning for no-idle flow shop scheduling, In: 2020 IEEE Congress on Evolutionary Computation (CEC, pp. 1-8, (2020)
[67]  
Rossi F.L., Nagano M.S., Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation, Swarm Evol Comput, 55, (2020)
[68]  
Riahi V., Chiong R., Zhang Y., A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion, Comput Oper Res, 117, (2020)
[69]  
Gupta D., Goel R., No idle scheduling with fuzzy approach, Adv Math Sci J, 9, 3, pp. 1111-1118, (2020)
[70]  
Oztop H., Tasgetiren M.F., Kandiller L., Pan Q.K., Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, Comput Oper Res, 138, (2021)
123456789