{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T08:00:06Z","timestamp":1726473606056},"reference-count":44,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002924","name":"Federaci\u00f3n Espa\u00f1ola de Enfermedades Raras","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002924","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["RTI2018-094940-B-I00"],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1016\/j.ejor.2022.02.019","type":"journal-article","created":{"date-parts":[[2022,2,13]],"date-time":"2022-02-13T14:22:49Z","timestamp":1644762169000},"page":"99-113","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":39,"title":["A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows"],"prefix":"10.1016","volume":"303","author":[{"given":"Ahmed","family":"Missaoui","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3295-3888","authenticated-orcid":false,"given":"Rub\u00e9n","family":"Ruiz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5\u20136","key":"10.1016\/j.ejor.2022.02.019_bib0001","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","article-title":"Using ant colony optimization to solve hybrid flow shop scheduling problems","volume":"35","author":"Alayk\u1ef3ran","year":"2007","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.019_bib0002","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.ejor.2019.10.004","article-title":"Automatic algorithm design for hybrid flowshop scheduling problems","volume":"282","author":"Alfaro-Fern\u00e1ndez","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0003","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","article-title":"The third comprehensive survey on scheduling problems with setup times\/costs","volume":"246","author":"Allahverdi","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0004","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup considerations","volume":"27","author":"Allahverdi","year":"1999","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.019_bib0005","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","article-title":"A survey of scheduling problems with setup times or costs","volume":"187","author":"Allahverdi","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.02.019_sbref0006","article-title":"Single machine scheduling with tight windows","author":"Anger","year":"1986","journal-title":"Research Paper"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.019_bib0007","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1057\/jors.1989.9","article-title":"On the assignment of optimal due dates","volume":"40","author":"Baker","year":"1989","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"10.1016\/j.ejor.2022.02.019_bib0008","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1080\/00207540802556817","article-title":"Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times","volume":"48","author":"Behnamian","year":"2010","journal-title":"International Journal of Production Research"},{"issue":"12","key":"10.1016\/j.ejor.2022.02.019_bib0009","doi-asserted-by":"crossref","first-page":"14490","DOI":"10.1016\/j.eswa.2011.04.241","article-title":"A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties","volume":"38","author":"Behnamian","year":"2011","journal-title":"Expert Systems With Applications"},{"issue":"5","key":"10.1016\/j.ejor.2022.02.019_bib0010","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s13369-012-0347-6","article-title":"Earliness and tardiness minimizing on a realistic hybrid flowshop scheduling with learning effect by advanced metaheuristic","volume":"38","author":"Behnamian","year":"2013","journal-title":"Arabian Journal for Science and Engineering"},{"issue":"7\u20138","key":"10.1016\/j.ejor.2022.02.019_bib0011","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s00170-008-1885-7","article-title":"Due window scheduling with sequence-dependent setup on parallel machines using three hybrid metaheuristic algorithms","volume":"44","author":"Behnamian","year":"2009","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.019_bib0012","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/S0377-2217(01)00068-6","article-title":"Parallel machine scheduling with a common due window","volume":"136","author":"Chen","year":"2002","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.019_bib0013","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1287\/opre.40.1.7","article-title":"The lessons of flowshop scheduling research","volume":"40","author":"Dudek","year":"1992","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2022.02.019_bib0014","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1016\/j.future.2004.03.014","article-title":"A new approach to solve hybrid flow shop scheduling problems by artificial immune system","volume":"20","author":"Engin","year":"2004","journal-title":"Future Generation Computer Systems"},{"issue":"21","key":"10.1016\/j.ejor.2022.02.019_bib0015","doi-asserted-by":"crossref","first-page":"4899","DOI":"10.1080\/00207540600871228","article-title":"Multiple machine JIT scheduling: A tabu search approach","volume":"45","author":"Finke","year":"2007","journal-title":"International Journal of Production Research"},{"issue":"4","key":"10.1016\/j.ejor.2022.02.019_bib0016","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","article-title":"Two-stage, hybrid flowshop scheduling problem","volume":"39","author":"Gupta","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2022.02.019_bib0017","doi-asserted-by":"crossref","first-page":"100742","DOI":"10.1016\/j.swevo.2020.100742","article-title":"An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times","volume":"59","author":"Huang","year":"2020","journal-title":"Swarm and Evolutionary Computation"},{"issue":"15\u201316","key":"10.1016\/j.ejor.2022.02.019_bib0018","doi-asserted-by":"crossref","first-page":"6196","DOI":"10.1016\/j.eswa.2015.03.012","article-title":"A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry","volume":"42","author":"Jun","year":"2015","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0019","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1080\/18756891.2008.9727611","article-title":"An application of effective genetic algorithms for solving hybrid flow shop scheduling problems","volume":"1","author":"Kahraman","year":"2008","journal-title":"International Journal of Computational Intelligence Systems"},{"issue":"5","key":"10.1016\/j.ejor.2022.02.019_bib0020","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.engappai.2010.01.008","article-title":"A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop","volume":"23","author":"Khalouli","year":"2010","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.ejor.2022.02.019_bib0021","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.cie.2019.06.057","article-title":"Scheduling hybrid flowshop with sequence-dependent setup times and due windows to minimize total weighted earliness and tardiness","volume":"135","author":"Khare","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"10.1016\/j.ejor.2022.02.019_bib0022","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/opre.26.6.1079","article-title":"Optimal single-machine scheduling with earliness and tardiness penalties","volume":"26","author":"Lakshminarayan","year":"1978","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0023","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0925-5273(03)00011-2","article-title":"A case study in a two-stage hybrid flow shop with setup time and dedicated machines","volume":"86","author":"Lin","year":"2003","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0024","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.cor.2009.04.017","article-title":"Algorithms for a realistic variant of flowshop scheduling","volume":"37","author":"Naderi","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"11\u201312","key":"10.1016\/j.ejor.2022.02.019_bib0025","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1007\/s00170-008-1569-3","article-title":"Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness","volume":"41","author":"Naderi","year":"2009","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"10.1016\/j.ejor.2022.02.019_bib0026","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.amc.2017.01.004","article-title":"Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times","volume":"303","author":"Pan","year":"2017","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.ejor.2022.02.019_bib0027","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.cor.2016.11.022","article-title":"Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows","volume":"80","author":"Pan","year":"2017","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0028","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","article-title":"An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process","volume":"10","author":"Pan","year":"2012","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"10","key":"10.1016\/j.ejor.2022.02.019_bib0029","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1080\/00207540050028070","article-title":"Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times","volume":"38","author":"Radhakrishnan","year":"2000","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2022.02.019_bib0030","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.eswa.2018.12.039","article-title":"An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem","volume":"121","author":"Ribas","year":"2019","journal-title":"Expert Systems with Applications"},{"issue":"8","key":"10.1016\/j.ejor.2022.02.019_bib0031","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","article-title":"Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective","volume":"37","author":"Ribas","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.019_bib0032","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","article-title":"A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility","volume":"169","author":"Ruiz","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.019_bib0033","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","article-title":"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"177","author":"Ruiz","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.019_bib0034","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.02.019_bib0035","doi-asserted-by":"crossref","first-page":"105527","DOI":"10.1016\/j.knosys.2020.105527","article-title":"Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem","author":"Shao","year":"2020","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.019_bib0036","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.25.1.62","article-title":"Optimal single-machine scheduling with earliness and tardiness penalties","volume":"25","author":"Sidney","year":"1977","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.019_bib0037","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/itor.12001","article-title":"Metaheuristics-the metaphor exposed","volume":"22","author":"S\u00f6rensen","year":"2015","journal-title":"International Transactions in Operational Research"},{"issue":"7","key":"10.1016\/j.ejor.2022.02.019_bib0038","doi-asserted-by":"crossref","first-page":"1849","DOI":"10.1016\/j.cor.2003.12.002","article-title":"Earliness\u2013tardiness scheduling with setup considerations","volume":"32","author":"Sourd","year":"2005","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0039","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1504\/IJAOM.2020.108263","article-title":"A literature review on hybrid flow shop scheduling","volume":"12","author":"Tosun","year":"2020","journal-title":"International Journal of Advanced Operations Management"},{"key":"10.1016\/j.ejor.2022.02.019_bib0040","series-title":"Engineering stochastic local search algorithms. designing, implementing and analyzing effective heuristics","first-page":"202","article-title":"Local search in complex scheduling problems","volume":"vol. 4638","author":"Urlings","year":"2007"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.019_bib0041","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1504\/IJMHEUR.2010.033122","article-title":"Genetic algorithms for complex hybrid flexible flow line problems","volume":"1","author":"Urlings","year":"2010","journal-title":"International Journal of Metaheuristics"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0042","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.ijpe.2004.05.029","article-title":"Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application","volume":"105","author":"Vo\u00df","year":"2007","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.019_bib0043","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0377-2217(01)00302-2","article-title":"Tabu search for single machine scheduling with distinct due windows and weighted earliness\/tardiness penalties","volume":"142","author":"Wan","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.02.019_bib0044","series-title":"2020 chinese control and decision conference (CCDC)","first-page":"5636","article-title":"Iterated greedy algorithm for solving a hybrid flow shop scheduling problem with reentrant jobs","author":"Zhang","year":"2020"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221722001217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221722001217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T23:07:03Z","timestamp":1707779223000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221722001217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["S0377221722001217"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2022.02.019","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2022,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2022.02.019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}