{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T04:16:54Z","timestamp":1770351414373,"version":"3.49.0"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda (CONACyT) Basic Science Project","doi-asserted-by":"publisher","award":["287479"],"award-info":[{"award-number":["287479"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004961","name":"Instituto Tecnol\u00f3gico y de Estudios Superiores de Monterrey (ITESM), Research Group with Strategic Focus in Intelligent Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004961","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3076426","type":"journal-article","created":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T19:36:40Z","timestamp":1619725000000},"page":"66891-66914","source":"Crossref","is-referenced-by-count":11,"title":["Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization"],"prefix":"10.1109","volume":"9","author":[{"given":"Alonso","family":"Vela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4494-7864","authenticated-orcid":false,"given":"Jorge M.","family":"Cruz-Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-2166","authenticated-orcid":false,"given":"Jose Carlos","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-7137","authenticated-orcid":false,"given":"Ivan","family":"Amaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8789928"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-03822-w"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref32","author":"lawrence","year":"1984","journal-title":"Resource constrained project scheduling An experimental investigation of heuristic scheduling techniques"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105196"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12486"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00019-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.10.1495"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196452"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.04.017"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/00207549308956713"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106803"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106416"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106431","article-title":"An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption","volume":"145","author":"y\u00fcksel","year":"2020","journal-title":"Comput Ind Eng"},{"key":"ref15","first-page":"1","article-title":"Exploring reward-based hyper-heuristics for the job-shop scheduling problem","author":"lara-cardenas","year":"2020","journal-title":"Proc IEEE Symp Comput Intell (SSCI)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-4756-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-005-4781-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2010.06.004"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2889122"},{"key":"ref4","first-page":"6","article-title":"A hybrid simulated annealing for job shop scheduling problem","volume":"10","author":"hern\u00e1ndez-ram\u00edrez","year":"2019","journal-title":"Int J Combinat Optim Problems Inform"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-013-0175-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.306.30"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.actaastro.2020.10.020"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7471936"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-04940-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2761994"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-017-1350-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0547-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100765"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3009318"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.12.006"},{"key":"ref45","volume":"4183","author":"klusch","year":"2006","journal-title":"Artificial Intelligence Methodology Systems and Applications"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.06.014"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.07.073"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2003.1202274"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1296-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185709"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2018.8560344"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185591"},{"key":"ref44","first-page":"868","article-title":"UPSO: A unified particle swarm optimization scheme","author":"parsopoulos","year":"2004","journal-title":"Proc Int Conf Comput Methods Sci Eng (ICCMSE)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790296"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.01.050"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106570"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09418993.pdf?arnumber=9418993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:52Z","timestamp":1639770952000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9418993\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3076426","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}