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 条
[21]  
Singh H., Oberoi J.S., Singh D., Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review, RAIRO Oper Res, 55, 1, pp. 27-50, (2021)
[22]  
Tosun O., Marichelvam M.K., Tosun N., A literature review on hybrid flow shop scheduling, Int J Adv Oper Manag, 12, 2, pp. 156-194, (2020)
[23]  
Neufeld J.S., Schulz S., Buscher U., A systematic review of multi-objective hybrid flow shop scheduling, Eur J Oper Res, (2022)
[24]  
Utama D.M., Primayesti M.D., Umamy S.Z., Kholifa B.M.N., Yasa A.D., A systematic literature review on energy-efficient hybrid flow shop scheduling, Cogent Eng, 10, 1, (2023)
[25]  
Rethlefsen M.L., Kirtley S., Waffenschmidt S., Ayala A.P., Moher D., Page M.J., Koffel J.B., Blunt H., Brigham T., Chang S., Clark J., Conway A., Couban R., de Kock S., Farrah K., Fehrmann P., Foster M., Fowler S.A., Glanville J., Harris E., Hoffecker L., Isojarvi J., Kaunelis D., Ket H., Levay P., Lyon J., McGowan J., Murad M.H., Nicholson J., Pannabecker V., Paynter R., Pinotti R., Ross-White A., Sampson M., Shields T., Stevens A., Sutton A., Weinfurter E., Wright K., Young S., Group P.S., PR
[26]  
Bonyadi M.R., Michalewicz Z., Particle swarm optimization for single objective continuous space problems: a review, Evol Comput, 25, 1, pp. 1-54, (2017)
[27]  
Ojstersek R., Brezocnik M., Buchmeister B., Multi-objective optimization of production scheduling with evolutionary computation: a review, Int J Ind Eng Comput, 11, 3, pp. 359-376, (2020)
[28]  
Graham R.L., Lawler E.L., Lenstra J.K., Kan A.R., Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, pp. 287-326, (1979)
[29]  
Saadani N.E.H., Guinet A., Moalla M., Three stages flow-shop with job over-passing, IEEE International Conference on Systems, Man and Cybernetics, Yasmine Hammamet, Tunisia, 7, (2002)
[30]  
Ying K.-C., Lin S.-W., Cheng C.-Y., He C.-D., Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems, Comput Ind Eng, 110, pp. 413-423, (2017)
123456789