{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T06:05:40Z","timestamp":1760853940159,"version":"3.41.0"},"reference-count":43,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/cec.2017.7969312","type":"proceedings-article","created":{"date-parts":[[2017,7,7]],"date-time":"2017-07-07T18:26:43Z","timestamp":1499452003000},"page":"185-192","source":"Crossref","is-referenced-by-count":13,"title":["An Adaptive Large Neighborhood Search with Learning Automata for the Unrelated Parallel Machine Scheduling Problem"],"prefix":"10.1109","author":[{"given":"Luciano Perdigao","family":"Cota","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederico Gadelha","family":"Guimaraes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando B.","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcone J.","family":"Freitas Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.06.028"},{"key":"ref38","first-page":"138","article-title":"A learning automata based algorithm for solving capacitated vehicle routing problem","volume":"9","author":"alipour","year":"2012","journal-title":"International Journal of Computer Science Issues"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_11"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22348-3_8"},{"key":"ref30","article-title":"A heuristic algorithm for solving the unrelated parallel machine scheduling problem with sequence dependent setup time (in portugueses)","author":"cota","year":"2014","journal-title":"Proceedings of the 35th Brazilian Congress of Applied and Computational Mathematics"},{"journal-title":"Learning Automata An Introduction","year":"2012","author":"narendra","key":"ref37"},{"journal-title":"Learning Automata An Introduction","year":"1989","author":"narendra","key":"ref36"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-72780-4","author":"jungnickel","year":"2008","journal-title":"Graph Networks and Algorithms (Algorithms and Computation in Mathematics)"},{"key":"ref34","first-page":"29","author":"kuhn","year":"2010","journal-title":"The hungarian method for the assignment problem"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"journal-title":"Introduction to Sequencing and Scheduling","year":"1974","author":"baker","key":"ref40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.05.031"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.02.002"},{"journal-title":"A Web Site that Includes Benchmark Problem Data Sets and Solutions for Scheduling Problems","article-title":"SchedulingResearch, “Scheduling research virtual center","year":"2005","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900245"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-009-0246-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-012-0672-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(94)90205-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600547"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(00)00066-9"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1609\/icaps.v23i1.13596","article-title":"A reformulation for the problem scheduling unrelated parallel machines with sequence and machine dependent setup times","author":"rosales","year":"2013","journal-title":"Twenty-Third International Conference on Automated Planning and Scheduling"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2007.014169"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.05.013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.11.001"},{"key":"ref6","volume":"174","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref29","first-page":"376","article-title":"AIV: A heuristic algorithm based on iterated local search and variable neighborhood descent for solving the unrelated parallel machine scheduling problem with setup times","author":"haddad","year":"2014","journal-title":"Proceedings of the 16th International Conference on Enterprise Information Systems (ICEIS 2014)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-014-6390-6"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-005-5514-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/07408170600559706"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0736-5845(02)00013-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.02.006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0736-5845(02)00077-7"},{"journal-title":"CPU Benchmarks","year":"0","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-010-0483-3"},{"key":"ref41","first-page":"417","author":"shaw","year":"1998","journal-title":"Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems"},{"key":"ref23","first-page":"177","article-title":"Scheduling to minimize makespan on unrelated parallel machines with sequence dependent setup times","volume":"17","author":"al-salem","year":"2004","journal-title":"Engineering Journal of the University of Qatar"},{"journal-title":"A Web Site that Includes Benchmark Problem Data Sets and Solutions for Scheduling Problems","article-title":"sistemas de Optimizacion Aplicada","year":"2011","key":"ref26"},{"journal-title":"Design and Analysis of Experiments","year":"2007","author":"montgomery","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.01.011"}],"event":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2017,6,5]]},"location":"San Sebastian","end":{"date-parts":[[2017,6,8]]}},"container-title":["2017 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7959755\/7969277\/07969312.pdf?arnumber=7969312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T15:23:40Z","timestamp":1750519420000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7969312\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/cec.2017.7969312","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}