{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T12:38:51Z","timestamp":1769949531593,"version":"3.49.0"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00304-0","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T12:02:54Z","timestamp":1709035374000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Dana Marsetiya","family":"Utama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia Novel","family":"Al Imron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"304_CR1","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113279","volume":"150","author":"H \u00d6ztop","year":"2020","unstructured":"\u00d6ztop H, Tasgetiren MF, Eliiyi DT, Pan Q-K, Kandiller L (2020a) An energy-efficient permutation flowshop scheduling problem. Expert Syst Appl 150:113279","journal-title":"Expert Syst Appl"},{"issue":"1","key":"304_CR2","doi-asserted-by":"publisher","DOI":"10.1063\/5.0094254","volume":"2453","author":"DM Utama","year":"2022","unstructured":"Utama DM (2022) An effective hybrid crow search algorithm for energy-efficient flow shop scheduling. AIP Conf Proc 2453(1):020040. https:\/\/doi.org\/10.1063\/5.0094254","journal-title":"AIP Conf Proc"},{"issue":"1","key":"304_CR3","doi-asserted-by":"publisher","first-page":"012006","DOI":"10.1088\/1742-6596\/2394\/1\/012006","volume":"2394","author":"DM Utama","year":"2022","unstructured":"Utama DM, Ibrahim MF, Wijaya DS, Widodo DS, Primayesti MD (2022a) A novel hybrid multi-verse optimizer algorithm for energy-efficient permutation flow shop scheduling problem. J Phys Conf Ser 2394(1):012006. https:\/\/doi.org\/10.1088\/1742-6596\/2394\/1\/012006","journal-title":"J Phys Conf Ser"},{"issue":"3","key":"304_CR4","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas V, Ruiz R, Framinan JM (2017) A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation. Eur J Oper Res 257(3):707\u2013721","journal-title":"Eur J Oper Res"},{"issue":"1","key":"304_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.22219\/JTIUMM.Vol22.No1.18-30","volume":"22","author":"ANAAK Jabari","year":"2021","unstructured":"Jabari ANAAK, Hasan A (2021) Energy-aware scheduling in hybrid flow shop using firefly algorithm. J Teknik Industri 22(1):18\u201330. https:\/\/doi.org\/10.22219\/JTIUMM.Vol22.No1.18-30","journal-title":"J Teknik Industri"},{"key":"304_CR6","doi-asserted-by":"publisher","unstructured":"Utama DM, Widodo DS, Ibrahim MF, Dewi SK (2020) An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem. Int J Adv Intell Inform 6(1):23\u201335. https:\/\/doi.org\/10.26555\/ijain.v6i1.385","DOI":"10.26555\/ijain.v6i1.385"},{"key":"304_CR7","doi-asserted-by":"crossref","unstructured":"Widodo DS, Utama DM (2020b) The hybrid ant lion optimization flow shop scheduling problem for minimizing completion time. Int Conf Sci Technol 2019 Surabaya, Indonesia 1569(2):022097","DOI":"10.1088\/1742-6596\/1569\/2\/022097"},{"key":"304_CR8","doi-asserted-by":"crossref","unstructured":"Utama DM (2021) Minimizing Number of Tardy Jobs in Flow Shop Scheduling Using A Hybrid Whale Optimization Algorithm. In: The International Conference on Industrial Automation, Smart Grid and its Application (ICIASGA) 2020, Madiun, Jawa Timur, Indonesia, vol 1845, no 1, p 012017:\u00a0IOP Publishing","DOI":"10.1088\/1742-6596\/1845\/1\/012017"},{"issue":"2","key":"304_CR9","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/JSYST.2018.2825337","volume":"13","author":"W Shao","year":"2018","unstructured":"Shao W, Pi D, Shao Z (2018) Local search methods for a distributed assembly no-idle flow shop scheduling problem. IEEE Syst J 13(2):1945\u20131956","journal-title":"IEEE Syst J"},{"issue":"2","key":"304_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.26555\/ijain.v8i2.724","volume":"8","author":"DM Utama","year":"2022","unstructured":"Utama DM, Salim AAP, Widodo DS (2022b) A novel hybrid archimedes optimization algorithm for energy-efficient hybrid flow shop scheduling. Int J Adv Intell Informatics 8(2):237\u2013250. https:\/\/doi.org\/10.26555\/ijain.v8i2.724","journal-title":"Int J Adv Intell Informatics"},{"issue":"2","key":"304_CR11","doi-asserted-by":"publisher","first-page":"224","DOI":"10.22219\/JTIUMM.Vol22.No2.224-235","volume":"22","author":"I Amallynda","year":"2021","unstructured":"Amallynda I, Hutama B (2021) The moth-flame optimization algorithm for flow shop scheduling problem with travel time. J Teknik Industri 22(2):224\u2013235. https:\/\/doi.org\/10.22219\/JTIUMM.Vol22.No2.224-235","journal-title":"J Teknik Industri"},{"issue":"6","key":"304_CR12","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TSMC.1981.4308706","volume":"11","author":"S Mitsumori","year":"1981","unstructured":"Mitsumori S (1981) Optimal scheduling for load balance of two-machine production lines. IEEE Trans Syst Man Cybern 11(6):400\u2013409","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"4","key":"304_CR13","first-page":"15","volume":"5","author":"Z-P Lin Peng","year":"2019","unstructured":"Lin Peng Z-P, Chen C, Wang J-F (2019) A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle permutation flow-shop scheduling. Optim Comput Eng 5(4):15\u201336","journal-title":"Optim Comput Eng"},{"key":"304_CR14","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.113166","volume":"146","author":"F Zhao","year":"2020","unstructured":"Zhao F, Zhang L, Zhang Y, Ma W, Zhang C, Song H (2020) A hybrid discrete water wave optimization algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. Expert Syst Appl 146:113166","journal-title":"Expert Syst Appl"},{"key":"304_CR15","doi-asserted-by":"crossref","first-page":"100874","DOI":"10.1016\/j.swevo.2021.100874","volume":"63","author":"Y-Z Li","year":"2021","unstructured":"Li Y-Z, Pan Q-K, Li J-Q, Gao L, Tasgetiren MF (2021) An adaptive iterated greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems. Swarm Evol Comput 63:100874","journal-title":"Swarm Evol Comput"},{"key":"304_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","volume":"77","author":"DA Rossit","year":"2018","unstructured":"Rossit DA, Tohm\u00e9 F, Frutos M (2018) The non-permutation flow-shop scheduling problem: A literature review. Omega 77:143\u2013153. https:\/\/doi.org\/10.1016\/j.omega.2017.05.010","journal-title":"Omega"},{"key":"304_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"MM Yenisey","year":"2014","unstructured":"Yenisey MM, Yagmahan B (2014) Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega 45:119\u2013135. https:\/\/doi.org\/10.1016\/j.omega.2013.07.004","journal-title":"Omega"},{"issue":"10","key":"304_CR18","doi-asserted-by":"publisher","first-page":"2926","DOI":"10.1080\/00207543.2018.1550269","volume":"57","author":"GM Komaki","year":"2019","unstructured":"Komaki GM, Sheikh S, Malakooti B (2019) Flow shop scheduling problems with assembly operations: a review and new trends. Int J Prod Res 57(10):2926\u20132955. https:\/\/doi.org\/10.1080\/00207543.2018.1550269","journal-title":"Int J Prod Res"},{"key":"304_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.eswa.2019.06.069","volume":"137","author":"HH Miyata","year":"2019","unstructured":"Miyata HH, Nagano MS (2019) The blocking flow shop scheduling problem: a comprehensive and conceptual review. Expert Syst Appl 137:130\u2013156. https:\/\/doi.org\/10.1016\/j.eswa.2019.06.069","journal-title":"Expert Syst Appl"},{"issue":"4","key":"304_CR20","first-page":"399","volume":"8","author":"E Gonz\u00e1lez-Neira","year":"2017","unstructured":"Gonz\u00e1lez-Neira E, Montoya-Torres J, Barrera D (2017) Flow-shop scheduling problem under uncertainties: review and trends. Int J Ind Eng Comput 8(4):399\u2013426","journal-title":"Int J Ind Eng Comput"},{"issue":"1","key":"304_CR21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1051\/ro\/2020055","volume":"55","author":"H Singh","year":"2021","unstructured":"Singh H, Oberoi JS, Singh D (2021) Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review. RAIRO Oper Res 55(1):27\u201350","journal-title":"RAIRO Oper Res"},{"issue":"2","key":"304_CR22","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1504\/IJAOM.2020.108263","volume":"12","author":"\u00d6 Tosun","year":"2020","unstructured":"Tosun \u00d6, Marichelvam MK, Tosun N (2020) A literature review on hybrid flow shop scheduling. Int J Adv Oper Manag 12(2):156\u2013194. https:\/\/doi.org\/10.1504\/IJAOM.2020.108263","journal-title":"Int J Adv Oper Manag"},{"key":"304_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.08.009","author":"JS Neufeld","year":"2022","unstructured":"Neufeld JS, Schulz S, Buscher U (2022) A systematic review of multi-objective hybrid flow shop scheduling. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2022.08.009","journal-title":"Eur J Oper Res"},{"issue":"1","key":"304_CR24","doi-asserted-by":"publisher","first-page":"2206074","DOI":"10.1080\/23311916.2023.2206074","volume":"10","author":"DM Utama","year":"2023","unstructured":"Utama DM, Primayesti MD, Umamy SZ, Kholifa BMN, Yasa AD (2023) A systematic literature review on energy-efficient hybrid flow shop scheduling. Cogent Eng 10(1):2206074. https:\/\/doi.org\/10.1080\/23311916.2023.2206074","journal-title":"Cogent Eng"},{"issue":"1","key":"304_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1186\/s13643-020-01542-z","volume":"10","author":"ML Rethlefsen","year":"2021","unstructured":"Rethlefsen ML, Kirtley S, Waffenschmidt S, Ayala AP, Moher D, Page MJ, Koffel JB, Blunt H, Brigham T, Chang S, Clark J, Conway A, Couban R, de Kock S, Farrah K, Fehrmann P, Foster M, Fowler SA, Glanville J, Harris E, Hoffecker L, Isojarvi J, Kaunelis D, Ket H, Levay P, Lyon J, McGowan J, Murad MH, 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 PS (2021) PRISMA-S: An extension to the PRISMA statement for reporting literature searches in systematic reviews. Syst Rev 10(1):39. https:\/\/doi.org\/10.1186\/s13643-020-01542-z","journal-title":"Syst Rev"},{"issue":"1","key":"304_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/EVCO_r_00180","volume":"25","author":"MR Bonyadi","year":"2017","unstructured":"Bonyadi MR, Michalewicz Z (2017) Particle swarm optimization for single objective continuous space problems: a review. Evol Comput 25(1):1\u201354. https:\/\/doi.org\/10.1162\/EVCO_r_00180","journal-title":"Evol Comput"},{"issue":"3","key":"304_CR27","first-page":"359","volume":"11","author":"R Ojstersek","year":"2020","unstructured":"Ojstersek R, Brezocnik M, Buchmeister B (2020) Multi-objective optimization of production scheduling with evolutionary computation: A review. Int J Ind Eng Comput 11(3):359\u2013376","journal-title":"Int J Ind Eng Comput"},{"key":"304_CR28","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume-title":"Annals of Discrete Mathematics","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Hammer PL, Johnson EL, Korte BH (eds) Annals of Discrete Mathematics, vol 5. Elsevier, pp 287\u2013326. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X"},{"key":"304_CR29","doi-asserted-by":"publisher","unstructured":"Saadani NEH, Guinet A, Moalla M (2002) Three stages flow-shop with job over-passing. In: IEEE International Conference on Systems, Man and Cybernetics, Yasmine Hammamet, Tunisia, vol 7, p 6. https:\/\/doi.org\/10.1109\/ICSMC.2002.1175717","DOI":"10.1109\/ICSMC.2002.1175717"},{"key":"304_CR30","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.cie.2017.06.025","volume":"110","author":"K-C Ying","year":"2017","unstructured":"Ying K-C, Lin S-W, Cheng C-Y, He C-D (2017) Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Comput Ind Eng 110:413\u2013423","journal-title":"Comput Ind Eng"},{"key":"304_CR31","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.eswa.2019.01.057","volume":"125","author":"FL Rossi","year":"2019","unstructured":"Rossi FL, Nagano MS (2019) Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion. Expert Syst Appl 125:40\u201354","journal-title":"Expert Syst Appl"},{"issue":"1","key":"304_CR32","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1080\/00207543.2018.1457812","volume":"57","author":"C-Y Cheng","year":"2019","unstructured":"Cheng C-Y, Ying K-C, Chen H-H, Lu H-S (2019) Minimising makespan in distributed mixed no-idle flowshops. Int J Prod Res 57(1):48\u201360","journal-title":"Int J Prod Res"},{"key":"304_CR33","doi-asserted-by":"crossref","first-page":"107082","DOI":"10.1016\/j.cie.2020.107082","volume":"153","author":"F Zhao","year":"2021","unstructured":"Zhao F, Zhang L, Cao J, Tang J (2021b) A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Comput Ind Eng 153:107082","journal-title":"Comput Ind Eng"},{"key":"304_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.108036","volume":"239","author":"Y-Z Li","year":"2022","unstructured":"Li Y-Z, Pan Q-K, Ruiz R, Sang H-Y (2022) A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion. Knowl-Based Syst 239:108036. https:\/\/doi.org\/10.1016\/j.knosys.2021.108036","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"304_CR35","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/S0360-8352(02)00217-6","volume":"44","author":"NEH Saadani","year":"2003","unstructured":"Saadani NEH, Guinet A, Moalla M (2003) Three stage no-idle flow-shops. Comput Ind Eng 44(3):425\u2013434","journal-title":"Comput Ind Eng"},{"issue":"3","key":"304_CR36","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.cie.2004.01.008","volume":"46","author":"J Kamburowski","year":"2004","unstructured":"Kamburowski J (2004) More on three-machine no-idle flow shops. Comput Ind Eng 46(3):461\u2013466","journal-title":"Comput Ind Eng"},{"issue":"1","key":"304_CR37","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ejor.2003.08.030","volume":"161","author":"NEH Saadani","year":"2005","unstructured":"Saadani NEH, Guinet A, Moalla M (2005) A travelling salesman approach to solve the F\/no-idle\/Cmax problem. Eur J Oper Res 161(1):11\u201320","journal-title":"Eur J Oper Res"},{"issue":"1","key":"304_CR38","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.cie.2005.05.002","volume":"49","author":"PJ Kalczynski","year":"2005","unstructured":"Kalczynski PJ, Kamburowski J (2005) A heuristic for minimizing the makespan in no-idle permutation flow shops. Comput Ind Eng 49(1):146\u2013154","journal-title":"Comput Ind Eng"},{"issue":"2","key":"304_CR39","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1057\/palgrave.jors.2601959","volume":"57","author":"J Wang","year":"2006","unstructured":"Wang J, Xia Z (2006) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 57(2):220\u2013226","journal-title":"J Oper Res Soc"},{"issue":"3","key":"304_CR40","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cie.2006.06.001","volume":"50","author":"L-H Su","year":"2006","unstructured":"Su L-H, Lin C-T (2006) Three-machine flowshop with two operations per job to minimize makespan. Comp Ind Eng 50(3):286\u2013295","journal-title":"Comp Ind Eng"},{"issue":"1","key":"304_CR41","first-page":"947","volume":"182","author":"J-B Wang","year":"2006","unstructured":"Wang J-B, Shan F, Jiang B, Wang L-Y (2006) Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time. Appl Math Comput 182(1):947\u2013954","journal-title":"Appl Math Comput"},{"issue":"1","key":"304_CR42","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.ejor.2006.10.043","volume":"183","author":"M Cheng","year":"2007","unstructured":"Cheng M, Sun S, He L (2007a) Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines. Eur J Oper Res 183(1):115\u2013124","journal-title":"Eur J Oper Res"},{"issue":"2","key":"304_CR43","first-page":"945","volume":"184","author":"M Cheng","year":"2007","unstructured":"Cheng M, Sun S, Yu Y (2007b) A note on flow shop scheduling problems with a learning effect on no-idle dominant machines. Appl Math Comput 184(2):945\u2013949","journal-title":"Appl Math Comput"},{"issue":"2","key":"304_CR44","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ejor.2006.11.025","volume":"184","author":"D Baraz","year":"2008","unstructured":"Baraz D, Mosheiov GJ (2008) A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. Eur J Oper Res 184(2):810\u2013813","journal-title":"Eur J Oper Res"},{"issue":"3","key":"304_CR45","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1504\/EJIE.2008.017687","volume":"2","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Wang L (2008b) A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. Eur J Ind Eng 2(3):279\u2013297","journal-title":"Eur J Ind Eng"},{"issue":"7","key":"304_CR46","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1007\/s00170-007-1252-0","volume":"39","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Wang L (2008a) No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. Int J Adv Manuf Technol 39(7):796\u2013807","journal-title":"Int J Adv Manuf Technol"},{"key":"304_CR47","doi-asserted-by":"publisher","unstructured":"Ren WJ, Pan QK, Li JQ, Liang JJ (2010) Tabu search algorithm for solving no-idle permutation flow shop scheduling problem. In: 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), Changsha, China, pp 449\u2013453. https:\/\/doi.org\/10.1109\/BICTA.2010.5645167","DOI":"10.1109\/BICTA.2010.5645167"},{"key":"304_CR48","doi-asserted-by":"publisher","unstructured":"Ren WJ, Duan JH, Zhang FR, Han HY, Zhang M (2011a) Harmony search algorithms for bi-criteria no-idle permutation flow shop scheduling problem. In: 2011 Chinese Control and Decision Conference (CCDC), Mianyang, China, pp 2513\u20132517. https:\/\/doi.org\/10.1109\/CCDC.2011.5968632","DOI":"10.1109\/CCDC.2011.5968632"},{"key":"304_CR49","doi-asserted-by":"publisher","unstructured":"Ren WJ, Duan JH, Zhang FR, Han HY, Zhang M (2011b) Hybrid tabu search algorithm for bi-criteria no-idle permutation flow shop scheduling problem. In: 2011 Chinese Control and Decision Conference (CCDC), Mianyang, China, pp 1699\u20131702. https:\/\/doi.org\/10.1109\/CCDC.2011.5968469","DOI":"10.1109\/CCDC.2011.5968469"},{"issue":"16","key":"304_CR50","doi-asserted-by":"crossref","first-page":"5033","DOI":"10.1080\/00207543.2010.497781","volume":"49","author":"MF Tasgetiren","year":"2011","unstructured":"Tasgetiren MF, Pan Q-KS, Jin PN, Chua T (2011) A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. Int J Prod Res 49(16):5033\u20135050","journal-title":"Int J Prod Res"},{"issue":"9","key":"304_CR51","doi-asserted-by":"crossref","first-page":"2152","DOI":"10.1016\/j.cor.2011.10.024","volume":"39","author":"G Deng","year":"2012","unstructured":"Deng G, Gu X (2012) A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion. Comput Oper Res 39(9):2152\u20132160","journal-title":"Comput Oper Res"},{"key":"304_CR52","doi-asserted-by":"publisher","unstructured":"Wang Y, Li X (2013) Shuffled frog leaping algorithm for a bi-objective no-idle permutation flow shop. In: 2013 IEEE International Conference on Systems, Man, and Cybernetics, Manchester, UK, pp 2808\u20132813. https:\/\/doi.org\/10.1109\/SMC.2013.479","DOI":"10.1109\/SMC.2013.479"},{"issue":"7","key":"304_CR53","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1016\/j.cor.2013.01.005","volume":"40","author":"MF Tasgetiren","year":"2013","unstructured":"Tasgetiren MF, Pan Q-K, Suganthan PN, Buyukdagli O (2013) A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput Oper Res 40(7):1729\u20131743","journal-title":"Comput Oper Res"},{"issue":"10\u201311","key":"304_CR54","doi-asserted-by":"crossref","first-page":"6758","DOI":"10.1016\/j.apm.2013.02.011","volume":"37","author":"MF Tasgetiren","year":"2013","unstructured":"Tasgetiren MF, Pan QK, Suganthan PN, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37(10\u201311):6758\u20136779","journal-title":"Appl Math Model"},{"issue":"2","key":"304_CR55","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4025\/actascitechnol.v35i2.12534","volume":"35","author":"MS Nagano","year":"2013","unstructured":"Nagano MS, Janu\u00e1rio JCSS (2013) Evolutionary heuristic for makespan minimization in no-idle flow shop production systems. Acta Sci Technol 35(2):271\u2013278","journal-title":"Acta Sci Technol"},{"key":"304_CR56","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.neucom.2013.05.063","volume":"137","author":"Y Zhou","year":"2014","unstructured":"Zhou Y, Chen H, Zhou G (2014) Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing 137:285\u2013292","journal-title":"Neurocomputing"},{"key":"304_CR57","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.knosys.2014.11.016","volume":"74","author":"J-N Shen","year":"2015","unstructured":"Shen J-N, Wang L, Wang S-Y (2015) A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion. Knowl-Based Syst 74:167\u2013175","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"304_CR58","doi-asserted-by":"crossref","first-page":"3447","DOI":"10.1016\/j.apm.2015.09.081","volume":"40","author":"Y-Y Lu","year":"2016","unstructured":"Lu Y-Y (2016) Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs. Appl Math Model 40(4):3447\u20133450","journal-title":"Appl Math Model"},{"key":"304_CR59","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.asoc.2017.01.017","volume":"54","author":"W Shao","year":"2017","unstructured":"Shao W, Pi D, Shao Z (2017) Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion. Appl Soft Comput 54:164\u2013182","journal-title":"Appl Soft Comput"},{"issue":"6","key":"304_CR60","doi-asserted-by":"crossref","first-page":"953","DOI":"10.3390\/su9060953","volume":"9","author":"Z Sun","year":"2017","unstructured":"Sun Z, Gu X (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 9(6):953","journal-title":"Sustainability"},{"key":"304_CR61","doi-asserted-by":"publisher","unstructured":"Ling-Fang C, Ling W, Jing-jing W (2018) A two-stage memetic algorithm for distributed no-idle permutation flow shop scheduling problem. In: 2018 37th Chinese Control Conference (CCC), Wuhan, China, pp 2278-2283. https:\/\/doi.org\/10.23919\/ChiCC.2018.8483752","DOI":"10.23919\/ChiCC.2018.8483752"},{"issue":"4","key":"304_CR62","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10951-017-0545-x","volume":"21","author":"B Wang","year":"2018","unstructured":"Wang B, Huang K, Li T (2018) Two-stage hybrid flowshop scheduling with simultaneous processing machines. J Sched 21(4):387\u2013411","journal-title":"J Sched"},{"issue":"4","key":"304_CR63","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s11740-017-0747-2","volume":"11","author":"MS Nagano","year":"2017","unstructured":"Nagano MS, Rossi FL, Tomazella CP (2017) A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop. Prod Eng Res Devel 11(4):523\u2013529","journal-title":"Prod Eng Res Devel"},{"issue":"2","key":"304_CR64","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/0305215X.2018.1444163","volume":"51","author":"MS Nagano","year":"2019","unstructured":"Nagano MS, Rossi FL, Martarelli NJ (2019) High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Eng Optim 51(2):185\u2013198","journal-title":"Eng Optim"},{"key":"304_CR65","doi-asserted-by":"publisher","unstructured":"Shen L, Tasgetiren MF, \u00d6ztop H, Kandiller L, Gao L (2019) 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), Xiamen, China, pp 1684\u20131691. https:\/\/doi.org\/10.1109\/SSCI44817.2019.9002931","DOI":"10.1109\/SSCI44817.2019.9002931"},{"key":"304_CR66","doi-asserted-by":"publisher","unstructured":"\u00d6ztop H, Tasgetiren MF, Kandiller L, Pan QK (2020b) A novel general variable neighborhood search through q-learning for no-idle flow shop scheduling. In: 2020 IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK, pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC48606.2020.9185556","DOI":"10.1109\/CEC48606.2020.9185556"},{"key":"304_CR67","doi-asserted-by":"crossref","first-page":"100689","DOI":"10.1016\/j.swevo.2020.100689","volume":"55","author":"FL Rossi","year":"2020","unstructured":"Rossi FL, Nagano MS (2020) Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation. Swarm Evol Comput 55:100689","journal-title":"Swarm Evol Comput"},{"key":"304_CR68","doi-asserted-by":"crossref","first-page":"104839","DOI":"10.1016\/j.cor.2019.104839","volume":"117","author":"V Riahi","year":"2020","unstructured":"Riahi C, Chiong R, Zhang Y (2020) A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion. Comput Oper Res 117:104839","journal-title":"Comput Oper Res"},{"key":"304_CR69","doi-asserted-by":"publisher","unstructured":"Gupta D, Goel R (2020) No idle scheduling with fuzzy approach. Adv Math Sci J 9(3):1111\u20131118. https:\/\/doi.org\/10.37418\/amsj.9.3.36","DOI":"10.37418\/amsj.9.3.36"},{"key":"304_CR70","doi-asserted-by":"publisher","unstructured":"\u00d6ztop H, Tasgetiren MF, Kandiller L, Pan QK (2021) Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. Comput Oper Res 138:105616. https:\/\/doi.org\/10.1016\/j.cor.2021.105616","DOI":"10.1016\/j.cor.2021.105616"},{"issue":"7","key":"304_CR71","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.3390\/sym13071131","volume":"13","author":"A Ag\u00e1rdi","year":"2021","unstructured":"Ag\u00e1rdi A, Neh\u00e9z K, Horny\u00e1k O, K\u00f3czy LT (2021) A hybrid discrete bacterial memetic algorithm with simulated annealing for optimization of the flow shop scheduling problem. Symmetry 13(7):1131","journal-title":"Symmetry"},{"key":"304_CR72","doi-asserted-by":"crossref","first-page":"107337","DOI":"10.1016\/j.cie.2021.107337","volume":"157","author":"FL Rossi","year":"2021","unstructured":"Rossi FL, Nagano MS (2021a) Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Comput Ind Eng 157:107337","journal-title":"Comput Ind Eng"},{"issue":"1","key":"304_CR73","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10732-019-09430-z","volume":"27","author":"FG Della Croce","year":"2021","unstructured":"Della Croce FG, Salassa A, Fabio, (2021) Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J Heuristics 27(1):159\u2013173","journal-title":"J Heuristics"},{"key":"304_CR74","doi-asserted-by":"publisher","unstructured":"Cheng L, Tang Q, Zhang L, Zhang Z (2021) Multi-objective Q-learning-based hyper-heuristic with Bi-criteria selection for energy-aware mixed shop scheduling. Swarm Evol Comput 69:100985. https:\/\/doi.org\/10.1016\/j.swevo.2021.100985","DOI":"10.1016\/j.swevo.2021.100985"},{"key":"304_CR75","doi-asserted-by":"publisher","unstructured":"Zhao F, Ma R, Wang L (2021a) A self-learning discrete Jaya algorithm for multiobjective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system. IEEE Trans Cybern 52(12):12675\u20131268. https:\/\/doi.org\/10.1109\/TCYB.2021.3086181","DOI":"10.1109\/TCYB.2021.3086181"},{"issue":"2","key":"304_CR76","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1080\/01605682.2019.1671149","volume":"72","author":"FL Rossi","year":"2021","unstructured":"Rossi FL, Nagano MS (2021b) Heuristics for the mixed no-idle flowshop with sequence-dependent setup times. J Oper Res Soc 72(2):417\u2013443","journal-title":"J Oper Res Soc"},{"key":"304_CR77","doi-asserted-by":"crossref","first-page":"105616","DOI":"10.1016\/j.cor.2021.105616","volume":"138","author":"H \u00d6ztop","year":"2022","unstructured":"\u00d6ztop H, Tasgetiren MF, Kandiller L, Pan Q-K (2022) Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. Comput Oper Res 138:105616","journal-title":"Comput Oper Res"},{"key":"304_CR78","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-022-00678-9","author":"FL Rossi","year":"2022","unstructured":"Rossi FL, Nagano MS (2022) Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion. OR Spectrum. https:\/\/doi.org\/10.1007\/s00291-022-00678-9","journal-title":"OR Spectrum"},{"key":"304_CR79","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105862","volume":"146","author":"A Balogh","year":"2022","unstructured":"Balogh A, Garraffa M, O\u2019Sullivan B, Salassa F (2022) MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem. Comput Oper Res 146:105862. https:\/\/doi.org\/10.1016\/j.cor.2022.105862","journal-title":"Comput Oper Res"},{"issue":"9","key":"304_CR80","doi-asserted-by":"publisher","first-page":"5626","DOI":"10.1109\/TSMC.2023.3272311","volume":"53","author":"F Zhao","year":"2023","unstructured":"Zhao F, Zhu B, Wang L (2023) An estimation of distribution algorithm-based hyper-heuristic for the distributed assembly mixed no-idle permutation flowshop scheduling problem. IEEE Trans Syst Man Cybern Syst 53(9):5626\u20135637. https:\/\/doi.org\/10.1109\/TSMC.2023.3272311","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"304_CR81","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez M\u00e1rquez EM, Ornelas-Rodr\u00edguez M, Puga-Soberanes HJ, P\u00e9rez R, Ricardo Carpio M (2023) Experimental proposal with mallows distribution applied to the mixed no-idle permutation flow shop scheduling problem. Neural Networks and Metaheuristics 1096:455\u2013477. https:\/\/doi.org\/10.1007\/978-3-031-28999-6_28","DOI":"10.1007\/978-3-031-28999-6_28"},{"key":"304_CR82","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.procs.2023.10.502","volume":"227","author":"DM Utama","year":"2023","unstructured":"Utama DM (2023) A modified beluga whale optimization for optimizing energy-efficient no-idle permutation flow shop scheduling problem. Procedia Comput Sci 227:55\u201363. https:\/\/doi.org\/10.1016\/j.procs.2023.10.502","journal-title":"Procedia Comput Sci"},{"key":"304_CR83","doi-asserted-by":"publisher","unstructured":"Mansour H, Abohashima H (2023) Optimization of permutation no-idle flow shop green scheduling using adequate genetic algorithm. In: 2023 5th Novel Intelligent and Leading Emerging Sciences Conference (NILES), Giza, Egypt, pp 103\u2013106. https:\/\/doi.org\/10.1109\/NILES59815.2023.10296723","DOI":"10.1109\/NILES59815.2023.10296723"},{"issue":"3","key":"304_CR84","first-page":"195","volume":"12","author":"DM Utama","year":"2023","unstructured":"Utama DM, Febrita C (2023) Low-carbon no-idle permutation flow shop schedulling problem: giant trevally optimizer vs African vultures optimization algorithm. Int J Adv Appl Sci 12(3):195\u2013204","journal-title":"Int J Adv Appl Sci"},{"key":"304_CR85","doi-asserted-by":"publisher","unstructured":"Singla S, Kaur H, Gupta D, Kaur J (2023, Sept). No idle constraint in flow shop scheduling with transportation time, weightage of jobs and job block criteria. 2023 IEEE 2nd International Conference on Industrial Electronics: Developments & Applications (ICIDeA), Imphal, India, pp. 450\u2013454. https:\/\/doi.org\/10.1109\/ICIDeA59866.2023.10295180","DOI":"10.1109\/ICIDeA59866.2023.10295180"},{"issue":"1","key":"304_CR86","doi-asserted-by":"publisher","first-page":"65","DOI":"10.22219\/JTIUMM.Vol24.No1.65-80","volume":"24","author":"DR Wati","year":"2023","unstructured":"Wati DR, Amallynda I (2023) A no-idle flow shop scheduling using fire hawk optimizer to minimize energy consumption. J Teknik Industri 24(1):65\u201380. https:\/\/doi.org\/10.22219\/JTIUMM.Vol24.No1.65-80","journal-title":"J Teknik Industri"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00304-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00304-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00304-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T06:23:38Z","timestamp":1711434218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00304-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":86,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00304-0","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"9 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"18"}}