{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:39:26Z","timestamp":1775068766180,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312585\/2021-7"],"award-info":[{"award-number":["312585\/2021-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["88882.379108\/2019-01"],"award-info":[{"award-number":["88882.379108\/2019-01"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10288-023-00535-7","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T21:23:12Z","timestamp":1679865792000},"page":"31-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times"],"prefix":"10.1007","volume":"22","author":[{"given":"Fernando Siqueira","family":"de Almeida","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0239-1725","authenticated-orcid":false,"given":"Marcelo Seido","family":"Nagano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,10]]},"reference":[{"issue":"3","key":"535_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.2478\/v10209-011-0009-6","volume":"37","author":"T Aldowaisan","year":"2012","unstructured":"Aldowaisan T, Allahverdi A (2012) Minimizing total tardiness in no-wait flowshops. Found Comput Decis Sci 37(3):149\u2013162","journal-title":"Found Comput Decis Sci"},{"key":"535_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.4236\/ica.2015.61005","volume":"6","author":"T Aldowaisan","year":"2015","unstructured":"Aldowaisan T, Allahverdi A (2015) Total tardiness performance in m-machine no-wait flowshops with separate setup times. Intell Control Autom 6:38\u201344","journal-title":"Intell Control Autom"},{"issue":"2","key":"535_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0305-0548(02)00143-0","volume":"31","author":"A Allahverdi","year":"2004","unstructured":"Allahverdi A (2004) A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Comput Oper Res 31(2):157\u2013180","journal-title":"Comput Oper Res"},{"issue":"9\u201312","key":"535_CR4","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1007\/s00170-013-4836-x","volume":"68","author":"A Allahverdi","year":"2013","unstructured":"Allahverdi A, Aydilek H (2013) Algorithms for no-wait flowshops with total completion time subject to makespan. Int J Adv Manuf Technol 68(9\u201312):2237\u20132251","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"535_CR5","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.ejor.2014.04.031","volume":"238","author":"A Allahverdi","year":"2014","unstructured":"Allahverdi A, Aydilek H (2014) Total completion time with makespan constraint in no-wait flowshops with setup times. Eur J Oper Res 238(3):724\u2013734","journal-title":"Eur J Oper Res"},{"issue":"2","key":"535_CR6","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.ejor.2017.11.070","volume":"269","author":"A Allahverdi","year":"2018","unstructured":"Allahverdi A, Aydilek H, Aydilek A (2018) No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. Eur J Oper Res 269(2):590\u2013601","journal-title":"Eur J Oper Res"},{"issue":"124","key":"535_CR7","first-page":"688","volume":"365","author":"A Allahverdi","year":"2020","unstructured":"Allahverdi A, Aydilek H, Aydilek A (2020) No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Appl Math Comput 365(124):688","journal-title":"Appl Math Comput"},{"issue":"1","key":"535_CR8","first-page":"155","volume":"2","author":"DC Ara","year":"2011","unstructured":"Ara DC, Nagano MS (2011) A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem. Int J Ind Eng Comput 2(1):155\u2013166","journal-title":"Int J Ind Eng Comput"},{"issue":"1","key":"535_CR9","first-page":"351","volume":"219","author":"H Aydilek","year":"2012","unstructured":"Aydilek H, Allahverdi A (2012) Heuristics for no-wait flowshops with makespan subject to mean completion time. Appl Math Comput 219(1):351\u2013359","journal-title":"Appl Math Comput"},{"key":"535_CR10","volume-title":"Principles of sequencing and scheduling","author":"KR Baker","year":"2019","unstructured":"Baker KR, Trietsch D (2019) Principles of sequencing and scheduling. Wiley, Hoboken"},{"issue":"1","key":"535_CR11","first-page":"3","volume":"37","author":"L Bianco","year":"1999","unstructured":"Bianco L, Dell\u2019Olmo P, Giordani S (1999) Flow shop no-wait scheduling with sequence dependent setup times and release dates. INFOR Inf Syst Oper Res 37(1):3\u201319","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"2","key":"535_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ejor.2012.12.031","volume":"227","author":"M Ciavotta","year":"2013","unstructured":"Ciavotta M, Minella G, Ruiz R (2013) Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study. Eur J Oper Res 227(2):301\u2013313. https:\/\/doi.org\/10.1016\/j.ejor.2012.12.031","journal-title":"Eur J Oper Res"},{"issue":"8","key":"535_CR13","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/j.cor.2010.10.008","volume":"38","author":"J Dubois-Lacoste","year":"2011","unstructured":"Dubois-Lacoste J, Lopez-Ibanez M, Stutzle T (2011) A hybrid tp plus pls algorithm for bi-objective flow-shop scheduling problems. Comput Oper Res 38(8):1219\u20131236. https:\/\/doi.org\/10.1016\/j.cor.2010.10.008","journal-title":"Comput Oper Res"},{"key":"535_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5152-5","volume-title":"Flow shop scheduling. Theoretical results, algorithms, and applications","author":"H Emmons","year":"2013","unstructured":"Emmons H, Vairaktarakis G (2013) Flow shop scheduling. Theoretical results, algorithms, and applications. Springer, Berlin"},{"key":"535_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2015.02.002","volume":"60","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015) Neh-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput Oper Res 60:27\u201336","journal-title":"Comput Oper Res"},{"issue":"1\u20132","key":"535_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ijpe.2004.12.004","volume":"99","author":"JM Framinan","year":"2006","unstructured":"Framinan JM, Leisten R (2006) A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness. Int J Prod Econ 99(1\u20132):28\u201340","journal-title":"Int J Prod Econ"},{"issue":"3","key":"535_CR17","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2017.10.064","volume":"266","author":"JM Framinan","year":"2018","unstructured":"Framinan JM, Perez-Gonzalez P (2018) Order scheduling with tardiness objective: improved approximate solutions. Eur J Oper Res 266(3):840\u2013850","journal-title":"Eur J Oper Res"},{"issue":"5","key":"535_CR18","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1080\/00207540500282914","volume":"44","author":"PM Franca","year":"2006","unstructured":"Franca PM, Tin G Jr, Buriol L (2006) Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions. Int J Prod Res 44(5):939\u2013957","journal-title":"Int J Prod Res"},{"key":"535_CR19","doi-asserted-by":"crossref","unstructured":"Lee YH, Jung JW (2005) New heuristics for no-wait flowshop scheduling with precedence constraints and sequence dependent setup time. In: International conference on computational science and its applications. Springer, pp 467\u2013476","DOI":"10.1007\/11424925_50"},{"key":"535_CR20","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.ins.2018.04.038","volume":"453","author":"X Li","year":"2018","unstructured":"Li X, Yang Z, Ruiz R et al (2018) An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Inf Sci 453:408\u2013425","journal-title":"Inf Sci"},{"key":"535_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M Lopez-Ibanez","year":"2016","unstructured":"Lopez-Ibanez M, Dubois-Lacoste J, Caceres LP et al (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358. https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper Res Perspect"},{"issue":"3","key":"535_CR22","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1287\/ijoc.1070.0258","volume":"20","author":"G Minella","year":"2008","unstructured":"Minella G, Ruiz R, Ciavotta M (2008) A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS J Comput 20(3):451\u2013471","journal-title":"INFORMS J Comput"},{"issue":"11","key":"535_CR23","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.cor.2011.01.010","volume":"38","author":"G Minella","year":"2011","unstructured":"Minella G, Ruiz R, Ciavotta M (2011) Restarted iterated Pareto greedy algorithm for multi-objective flowshop scheduling problems. Comput Oper Res 38(11):1521\u20131533. https:\/\/doi.org\/10.1016\/j.cor.2011.01.010","journal-title":"Comput Oper Res"},{"key":"535_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2019.05.034","volume":"135","author":"HH Miyata","year":"2019","unstructured":"Miyata HH, Nagano MS, Gupta JN (2019) Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput Ind Eng 135:79\u2013104","journal-title":"Comput Ind Eng"},{"issue":"1","key":"535_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s40430-013-0064-4","volume":"36","author":"MS Nagano","year":"2014","unstructured":"Nagano MS, Ara\u00fajo DC (2014) New heuristics for the no-wait flowshop with sequence-dependent setup times problem. J Braz Soc Mech Sci Eng 36(1):139\u2013151","journal-title":"J Braz Soc Mech Sci Eng"},{"key":"535_CR26","first-page":"1","volume":"53","author":"MS Nagano","year":"2020","unstructured":"Nagano MS, Almeida FS, Miyata HH (2020) An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Eng Optim 53:1\u201319","journal-title":"Eng Optim"},{"issue":"1","key":"535_CR27","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega Int J Manag Sci 11(1):91\u201395. https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega Int J Manag Sci"},{"key":"535_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2013.10.002","volume":"44","author":"QK Pan","year":"2014","unstructured":"Pan QK, Ruiz R (2014) An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega Int J Manag Sci 44:41\u201350. https:\/\/doi.org\/10.1016\/j.omega.2013.10.002","journal-title":"Omega Int J Manag Sci"},{"key":"535_CR29","volume-title":"Scheduling. Theory, algorithms, and systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo M (2016) Scheduling. Theory, algorithms, and systems, 5th edn. Springer, Berlin","edition":"5"},{"issue":"3","key":"535_CR30","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033\u20132049","journal-title":"Eur J Oper Res"},{"issue":"3","key":"535_CR31","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz R, St\u00fctzle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187(3):1143\u20131159","journal-title":"Eur J Oper Res"},{"key":"535_CR32","doi-asserted-by":"crossref","unstructured":"Samarghandi H (2015a) A no-wait flow shop system with sequence dependent setup times and server constraints. IFAC PapersOnLine 48(3):1604\u20131609","DOI":"10.1016\/j.ifacol.2015.06.315"},{"key":"535_CR33","doi-asserted-by":"crossref","unstructured":"Samarghandi H (2015b) Studying the effect of server side-constraints on the makespan of the no-wait flow-shop problem with sequence-dependent set-up times. Int J Prod Res 53(9):2652\u20132673","DOI":"10.1080\/00207543.2014.974846"},{"issue":"3","key":"535_CR34","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1080\/0951192X.2013.812802","volume":"27","author":"H Samarghandi","year":"2014","unstructured":"Samarghandi H, ElMekkawy TY (2014) Solving the no-wait flow-shop problem with sequence-dependent set-up times. Int J Comput Integr Manuf 27(3):213\u2013228","journal-title":"Int J Comput Integr Manuf"},{"issue":"2","key":"535_CR35","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285. https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur J Oper Res"},{"key":"535_CR36","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"MF Tasgetiren","year":"2017","unstructured":"Tasgetiren MF, Kizilay D, Pan QK et al (2017) Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res 77:111\u2013126. https:\/\/doi.org\/10.1016\/j.cor.2016.07.002","journal-title":"Comput Oper Res"},{"key":"535_CR37","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V Tkindt","year":"2006","unstructured":"Tkindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms. Springer, Berlin"},{"key":"535_CR38","doi-asserted-by":"crossref","unstructured":"Xu T, Zhu X, Li X (2012) Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with sequence dependent setup times. In: Proceedings of the 2012 IEEE 16th international conference on computer supported cooperative work in design (CSCWD). IEEE, pp 780\u2013785","DOI":"10.1109\/CSCWD.2012.6221909"},{"issue":"4","key":"535_CR39","first-page":"415","volume":"12","author":"T Yamada","year":"2021","unstructured":"Yamada T, Nagano M, Miyata H (2021) Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance. Int J Ind Eng Comput 12(4):415\u2013426","journal-title":"Int J Ind Eng Comput"},{"key":"535_CR40","doi-asserted-by":"crossref","unstructured":"Zhu X, Li X, Gupta JN (2013a) Iterative algorithms for no-wait flowshop problems with sequence-dependent setup times. In: 2013 25th Chinese control and decision conference (CCDC). IEEE, pp 1252\u20131257","DOI":"10.1109\/CCDC.2013.6561117"},{"key":"535_CR41","doi-asserted-by":"crossref","unstructured":"Zhu X, Li X, Wang Q (2013b) An adaptive intelligent method for manufacturing process optimization in steelworks. In: Proceedings of the 2013 IEEE 17th international conference on computer supported cooperative work in design (CSCWD). IEEE, pp 363\u2013368","DOI":"10.1109\/CSCWD.2013.6580989"},{"key":"535_CR42","doi-asserted-by":"crossref","unstructured":"Zhuang WJ, Xu T, Sun MY (2014) A hybrid iterated greedy algorithm for no-wait flowshop with sequence dependent setup times to minimize makespan. In: Advanced materials research. Trans Tech Publ, pp 459\u2013466","DOI":"10.4028\/www.scientific.net\/AMR.933.459"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00535-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00535-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00535-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T12:06:02Z","timestamp":1712059562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00535-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,10]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["535"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00535-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,10]]},"assertion":[{"value":"13 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2023","order":4,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}