{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T17:06:55Z","timestamp":1724432815370},"reference-count":50,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0","2016\/01860-1","2018\/24293-0"],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008665","name":"Universit\u00e9 du Luxembourg","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008665","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":[[2021,9]]},"DOI":"10.1016\/j.ejor.2020.12.021","type":"journal-article","created":{"date-parts":[[2020,12,25]],"date-time":"2020-12-25T08:35:29Z","timestamp":1608885329000},"page":"419-441","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["Metaheuristics for the online printing shop scheduling problem"],"prefix":"10.1016","volume":"293","author":[{"given":"Willian T.","family":"Lunardi","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7466-7663","authenticated-orcid":false,"given":"Ernesto G.","family":"Birgin","sequence":"additional","affiliation":[]},{"given":"D\u00e9bora P.","family":"Ronconi","sequence":"additional","affiliation":[]},{"given":"Holger","family":"Voos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0001","first-page":"404","article-title":"An efficient differential evolution based algorithm for solving multi-objective optimization problems","volume":"217","author":"Ali","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0002","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.ejor.2004.04.020","article-title":"A heuristic to schedule flexible job-shop in a glass factory","volume":"165","author":"Alvarez-Vald\u00e9s","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0003","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-019-03196-0","article-title":"Scheduling a dual-resource flexible job shop with makespan and due date-related criteria","volume":"291","author":"Andrade-Pineda","year":"2020","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0004","series-title":"Technical Report ORP96-09","article-title":"Flexible job shop scheduling by tabu search","author":"Barnes","year":"1996"},{"issue":"4","key":"10.1016\/j.ejor.2020.12.021_bib0005","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1007\/s11590-013-0669-7","article-title":"A milp model for an extended version of the flexible job shop problem","volume":"8","author":"Birgin","year":"2014","journal-title":"Optimization Letters"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0006","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.ejor.2015.06.023","article-title":"List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility","volume":"247","author":"Birgin","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2020.12.021_bib0007","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0008","first-page":"1","article-title":"A knowledge-based cuckoo search algorithm to schedule a flexible job shop with sequencing flexibility","author":"Cao","year":"2019","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2020.12.021_bib0009","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1111\/itor.12199","article-title":"A research survey: Review of flexible job shop scheduling techniques","volume":"23","author":"Chaudhry","year":"2016","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0010","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.3934\/jimo.2016.12.1391","article-title":"A priority-based genetic algorithm for a flexible job shop scheduling problem","volume":"12","author":"Cinar","year":"2016","journal-title":"Journal of Industrial and Management Optimization"},{"key":"10.1016\/j.ejor.2020.12.021_bib0011","series-title":"Optimization, control, and applications in the information age","first-page":"17","article-title":"A taxonomy for the flexible job shop scheduling problem","author":"Cinar","year":"2015"},{"issue":"9","key":"10.1016\/j.ejor.2020.12.021_bib0012","doi-asserted-by":"crossref","first-page":"2653","DOI":"10.1016\/j.cor.2008.11.010","article-title":"Differential evolution for solving multi-mode resource-constrained project scheduling problems","volume":"36","author":"Damak","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0013","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","article-title":"An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search","volume":"70","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0014","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"Deb","year":"1995","journal-title":"Complex Systems"},{"key":"10.1016\/j.ejor.2020.12.021_bib0015","series-title":"Artificial neural nets and genetic algorithms","first-page":"235","article-title":"A niched-penalty approach for constraint handling in genetic algorithms","author":"Deb","year":"1999"},{"issue":"1","key":"10.1016\/j.ejor.2020.12.021_bib0016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJAISC.2014.059280","article-title":"Analysing mutation schemes for real-parameter genetic algorithms","volume":"4","author":"Deb","year":"2014","journal-title":"International Journal of Artificial Intelligence and Soft Computing"},{"key":"10.1016\/j.ejor.2020.12.021_bib0017","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/s001700200144","article-title":"Scheduling of flexible-sequenced process plans in a mould manufacturing shop","volume":"20","author":"Gan","year":"2002","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"9","key":"10.1016\/j.ejor.2020.12.021_bib0018","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","article-title":"A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems","volume":"35","author":"Gao","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0019","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2020.12.021_bib0020","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0021","series-title":"Interfaces in computer science and operations research: Advances in metaheuristics, optimization, and stochastic modeling technologies (pp. 1\u201375)","article-title":"Tabu search and adaptive memory programming \u2014 Advances, applications and challenges","author":"Glover","year":"1997"},{"key":"10.1016\/j.ejor.2020.12.021_bib0022","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1022602019183","article-title":"Genetic algorithms and machine learning","volume":"3","author":"Goldberg","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/j.ejor.2020.12.021_bib0023","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2015.02.052","article-title":"Scatter search with path relinking for the flexible job shop scheduling problem","volume":"245","author":"Gonz\u00e1lez","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0024","series-title":"Adaptation in natural and artificial systems \u2014 An introductory analysis with applications to biology, control, and artificial intelligence","author":"Holland","year":"1992"},{"issue":"4","key":"10.1016\/j.ejor.2020.12.021_bib0025","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"15","author":"Hurink","year":"1994","journal-title":"Operations-Research-Spektrum"},{"key":"10.1016\/j.ejor.2020.12.021_bib0026","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.engappai.2017.04.002","article-title":"An effective multi-start multi-level evolutionary local search for the flexible job-shop problem","volume":"62","author":"Kemmo\u00e9-Tchomt\u00e9","year":"2017","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.ejor.2020.12.021_bib0027","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1016\/S0305-0548(02)00063-1","article-title":"A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling","volume":"30","author":"Kim","year":"2003","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0028","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","article-title":"IBM ILOG CP Optimizer for scheduling","volume":"23","author":"Laborie","year":"2018","journal-title":"Constraints : An International Journal"},{"issue":"7","key":"10.1016\/j.ejor.2020.12.021_bib0029","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1080\/00207543.2011.561375","article-title":"Flexible job-shop scheduling problems with and\/or precedence constraints","volume":"50","author":"Lee","year":"2012","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0030","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2020.12.021_bib0031","series-title":"Handbook of metaheuristics","first-page":"320","article-title":"Iterated local search","author":"Louren\u00e7o","year":"2003"},{"key":"10.1016\/j.ejor.2020.12.021_bib0032","series-title":"A Real-World Flexible Job Shop Scheduling Problem With Sequencing Flexibility: Mathematical Programming, Constraint Programming, and Metaheuristics","author":"Lunardi","year":"2020"},{"key":"10.1016\/j.ejor.2020.12.021_bib0033","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105020","article-title":"Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem","volume":"123","author":"Lunardi","year":"2020","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.12.021_sbref0034","series-title":"Technical Report 10993\/43275","article-title":"Metaheuristics for the Online Printing Shop Scheduling Problem \u2013 Supplementary material","author":"Lunardi","year":"2020"},{"key":"10.1016\/j.ejor.2020.12.021_bib0035","series-title":"Proceedings of the 34th ACM\/SIGAPP symposium on applied computing (sac19) (pp. 204\u2013211)","article-title":"An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem","author":"Lunardi","year":"2019"},{"key":"10.1016\/j.ejor.2020.12.021_bib0036","unstructured":"Mastrolilli, M., & Gambardella, L. M. (1999). Effective neighborhood functions for the flexible job shop problem: Appendix. http:\/\/people.idsia.ch\/~monaldo\/fjspresults\/fjsp_result.ps. Accessed on April 10, 2020."},{"issue":"1","key":"10.1016\/j.ejor.2020.12.021_bib0037","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","article-title":"Effective neighbourhood functions for the flexible job shop problem","volume":"3","author":"Mastrolilli","year":"2000","journal-title":"Journal of Scheduling"},{"issue":"6","key":"10.1016\/j.ejor.2020.12.021_bib0038","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","article-title":"Mathematical models for job-shop scheduling problems with routing and process plan flexibility","volume":"34","author":"\u00d6zg\u00fcven","year":"2010","journal-title":"Applied Mathematical Modelling"},{"key":"10.1016\/j.ejor.2020.12.021_bib0039","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2014.08.023","article-title":"Genetic tabu search for the fuzzy flexible job shop problem","volume":"54","author":"Palacios","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0040","series-title":"Differential evolution \u2013 A practical approach to global optimization","author":"Price","year":"2006"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0041","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","article-title":"Differential evolution algorithm with strategy adaptation for global numerical optimization","volume":"13","author":"Qin","year":"2008","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.ejor.2020.12.021_bib0042","series-title":"Genetic algorithms: Principles and perspectives \u2013 A guide to GA theory","author":"Reeves","year":"2002"},{"key":"10.1016\/j.ejor.2020.12.021_sbref0043","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106428","article-title":"Integration of hybrid additive\/subtractive manufacturing planning and scheduling by metaheuristics","volume":"144","author":"Rossi","year":"2020","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"10.1016\/j.ejor.2020.12.021_bib0044","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"Journal of Global Optimization"},{"issue":"12","key":"10.1016\/j.ejor.2020.12.021_bib0045","doi-asserted-by":"crossref","first-page":"3045","DOI":"10.1016\/j.cor.2013.06.012","article-title":"Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm","volume":"40","author":"Tsai","year":"2013","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0046","series-title":"Proc. of the 2014 intl. conf. on high performance computing & simulation (hpcs 2014)","first-page":"959","article-title":"Management of an academic hpc cluster: The ul experience","author":"Varrette","year":"2014"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0047","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.ejor.2007.06.039","article-title":"A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem","volume":"190","author":"Vilcot","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.12.021_bib0048","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.jmsy.2019.11.010","article-title":"Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility","volume":"54","author":"Vital-Soto","year":"2020","journal-title":"Journal of Manufacturing Systems"},{"issue":"3","key":"10.1016\/j.ejor.2020.12.021_bib0049","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","article-title":"A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems","volume":"37","author":"Wang","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.12.021_bib0050","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.cie.2013.02.022","article-title":"Flexible job shop scheduling using hybrid differential evolution algorithms","volume":"65","author":"Yuan","year":"2013","journal-title":"Computers & Industrial Engineering"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720310493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720310493?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T11:24:11Z","timestamp":1656588251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221720310493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["S0377221720310493"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2020.12.021","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Metaheuristics for the online printing shop scheduling problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2020.12.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}