{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T21:05:43Z","timestamp":1769202343449,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:00:00Z","timestamp":1619222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:00:00Z","timestamp":1619222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["285599"],"award-info":[{"award-number":["285599"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007350","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["300832"],"award-info":[{"award-number":["300832"]}],"id":[{"id":"10.13039\/501100007350","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10489-021-02406-2","type":"journal-article","created":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T05:02:37Z","timestamp":1619326957000},"page":"141-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A parallel memetic algorithm with explicit management of diversity for the job shop scheduling problem"],"prefix":"10.1007","volume":"52","author":[{"given":"Oscar Hern\u00e1ndez","family":"Constantino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5431-5927","authenticated-orcid":false,"given":"Carlos","family":"Segura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,24]]},"reference":[{"issue":"5","key":"2406_CR1","doi-asserted-by":"publisher","first-page":"1903","DOI":"10.1007\/s10489-018-1343-7","volume":"49","author":"I Chaouch","year":"2019","unstructured":"Chaouch I, Driss OB, Ghedira K (2019) A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm. Applied Intelligence 49(5):1903\u20131924","journal-title":"Applied Intelligence"},{"issue":"2","key":"2406_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10479-013-1332-5","volume":"242","author":"TCE Cheng","year":"2016","unstructured":"Cheng TCE, Peng B, L\u00fc Z (2016) A hybrid evolutionary algorithm to solve the job shop scheduling problem. Ann Oper Res 242(2):223\u2013237. https:\/\/doi.org\/10.1007\/s10479-013-1332-5","journal-title":"Ann Oper Res"},{"key":"2406_CR3","doi-asserted-by":"crossref","unstructured":"Cicirello VA (2019) Classification of permutation distance metrics for fitness landscape analysis. In: Compagnoni A, Casey W, Cai Y, Mishra B (eds) Bio-inspired information and communication technologies. Springer International Publishing, Cham, pp 81\u201397","DOI":"10.1007\/978-3-030-24202-2_7"},{"issue":"3","key":"2406_CR4","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Computing Surveys 45(3):35:1\u201335:33","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"2406_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol E, Mehta S, Uzsoy R (1998) Benchmarks for shop scheduling problems. Eur J Oper Res 109(1):137\u2013141. https:\/\/doi.org\/10.1016\/S0377-2217(97)00019-2","journal-title":"Eur J Oper Res"},{"key":"2406_CR6","doi-asserted-by":"publisher","unstructured":"Gonzalez OM, Segura C, Pena SIV, Leon C (2017) A memetic algorithm for the capacitated vehicle routing problem with time windows. In: 2017 IEEE congress on evolutionary computation (CEC). https:\/\/doi.org\/10.1109\/CEC.2017.7969619. IEEE, pp 2582\u20132589","DOI":"10.1109\/CEC.2017.7969619"},{"issue":"10","key":"2406_CR7","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"R Qing-dao-er ji","year":"2012","unstructured":"Qing-dao-er ji R, Wang Y (2012) A new hybrid genetic algorithm for job shop scheduling problem. Computers & Operations Research 39(10):2291\u20132299. https:\/\/doi.org\/10.1016\/j.cor.2011.12.005","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2406_CR8","first-page":"88","volume":"27","author":"S Lu","year":"2011","unstructured":"Lu S, Zhi H, Huiming Z, Wenjun G (2011) Infeasibility test algorithm and fast repair algorithm of job shop scheduling problem. Journal of Southeast University (English Edition) 27(1):88\u201391","journal-title":"Journal of Southeast University (English Edition)"},{"key":"2406_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cor.2017.09.017","volume":"90","author":"Y Nagata","year":"2018","unstructured":"Nagata Y, Ono I (2018) A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem. Computers & Operations Research 90:60\u201371. https:\/\/doi.org\/10.1016\/j.cor.2017.09.017","journal-title":"Computers & Operations Research"},{"key":"2406_CR10","volume-title":"Handbook of memetic algorithms","author":"F Neri","year":"2011","unstructured":"Neri F, Cotta C, Moscato P (2011) Handbook of memetic algorithms. Springer Publishing Company, Incorporated, Berlin"},{"key":"2406_CR11","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.asoc.2014.08.025","volume":"24","author":"HM Pandey","year":"2014","unstructured":"Pandey HM, Chaudhary A, Mehrotra D (2014) A comparative review of approaches to prevent premature convergence in GA. Appl Soft Comput 24:1047\u20131077","journal-title":"Appl Soft Comput"},{"key":"2406_CR12","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, L\u00fc Z, Cheng T (2015) A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Computers &, Operations Research 53:154\u2013164. https:\/\/doi.org\/10.1016\/j.cor.2014.08.006","journal-title":"Computers &, Operations Research"},{"issue":"10","key":"2406_CR13","doi-asserted-by":"publisher","first-page":"3707","DOI":"10.1007\/s10489-018-1160-z","volume":"48","author":"R P\u00e9rez-Rodr\u00edguez","year":"2018","unstructured":"P\u00e9rez-Rodr\u00edguez R, Hern\u00e1ndez-Aguirre A (2018) A hybrid estimation of distribution algorithm for flexible job-shop scheduling problems with process plan flexibility. Appl Intell 48(10):3707\u20133734","journal-title":"Appl Intell"},{"key":"2406_CR14","doi-asserted-by":"publisher","unstructured":"Raeesi NMR, Kobti Z (2011) A machine operation lists based memetic algorithm for job shop scheduling. In: 2011 IEEE congress of evolutionary computation (CEC). https:\/\/doi.org\/10.1109\/CEC.2011.5949919, pp 2436\u20132443","DOI":"10.1109\/CEC.2011.5949919"},{"key":"2406_CR15","doi-asserted-by":"crossref","unstructured":"Romero Ruiz E, Segura C (2018) Memetic algorithm with hungarian matching based crossover and diversity preservation. Computaci\u00f3n y Sistemas 22(2)","DOI":"10.13053\/cys-22-2-2951"},{"key":"2406_CR16","doi-asserted-by":"crossref","unstructured":"Rosenthal S, Filipi\u010d B, Minisci E, Vasile M (2020) Diversity promoting strategies in a multi- and many-objective evolutionary algorithm for molecular optimization. In: Bioinspired optimization methods and their applications. Springer International Publishing, Cham, pp 294\u2013307","DOI":"10.1007\/978-3-030-63710-1_23"},{"issue":"1","key":"2406_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-015-2017-z","volume":"240","author":"C Segura","year":"2016","unstructured":"Segura C, Coello CAC, Miranda G, Le\u00f3n C (2016) Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization. Ann Oper Res 240(1):217\u2013250. https:\/\/doi.org\/10.1007\/s10479-015-2017-z","journal-title":"Ann Oper Res"},{"issue":"12","key":"2406_CR18","doi-asserted-by":"publisher","first-page":"3233","DOI":"10.1109\/TCYB.2015.2501726","volume":"46","author":"C Segura","year":"2016","unstructured":"Segura C, Coello Coello CA, Segredo E, Aguirre AH (2016) A novel diversity-based replacement strategy for evolutionary algorithms. IEEE Trans Cyb 46(12):3233\u20133246. https:\/\/doi.org\/10.1109\/TCYB.2015.2501726","journal-title":"IEEE Trans Cyb"},{"issue":"4","key":"2406_CR19","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TEVC.2016.2641477","volume":"21","author":"C Segura","year":"2017","unstructured":"Segura C, Hernandez-Aguirre A, Luna F, Alba E (2017) Improving diversity in evolutionary algorithms: new best solutions for frequency assignment. IEEE Trans Evol Comp 21(4):539\u2013553. https:\/\/doi.org\/10.1109\/TEVC.2016.2641477","journal-title":"IEEE Trans Evol Comp"},{"key":"2406_CR20","unstructured":"Shylo O (2020) http:\/\/optimizizer.com\/jobshop.php. Last visited 25\/11\/20"},{"key":"2406_CR21","unstructured":"Shylo OV, Shams H (2018) Boosting binary optimization via binary classification: a case study of job shop scheduling. arXiv:1808.10813"},{"issue":"10","key":"2406_CR22","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495\u20131509. https:\/\/doi.org\/10.1287\/mnsc.38.10.1495","journal-title":"Manag Sci"},{"issue":"2","key":"2406_CR23","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"},{"issue":"2","key":"2406_CR24","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"\u00c9D Taillard","year":"1994","unstructured":"Taillard \u00c9D (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6(2):108\u2013117. https:\/\/doi.org\/10.1287\/ijoc.6.2.108","journal-title":"ORSA J Comput"},{"key":"2406_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics","author":"EG Talbi","year":"2009","unstructured":"Talbi EG (2009) Metaheuristics. Wiley, Hoboken. https:\/\/doi.org\/10.1002\/9780470496916"},{"key":"2406_CR26","doi-asserted-by":"crossref","unstructured":"Tsai HK, Yang JM, Tsai YF, Kao CY (2004) An evolutionary algorithm for large traveling salesman problems 34(4): 1718\u20131729","DOI":"10.1109\/TSMCB.2004.828283"},{"key":"2406_CR27","doi-asserted-by":"publisher","unstructured":"Varela D, Santos J (2020) Protein structure prediction in an atomic model with differential evolution integrated with the crowding niching method. Natural Computing. https:\/\/doi.org\/10.1007\/s11047-020-09801-7","DOI":"10.1007\/s11047-020-09801-7"},{"issue":"2","key":"2406_CR28","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.asoc.2011.09.021","volume":"12","author":"X Wang","year":"2012","unstructured":"Wang X, Tang L (2012) A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl Soft Comput 12(2):652\u2013662. https:\/\/doi.org\/10.1016\/j.asoc.2011.09.021","journal-title":"Appl Soft Comput"},{"issue":"11","key":"2406_CR29","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"C Zhang","year":"2007","unstructured":"Zhang C, Li P, Guan Z, Rao Y (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research 34(11):3229\u20133242. https:\/\/doi.org\/10.1016\/j.cor.2005.12.002","journal-title":"Computers & Operations Research"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02406-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02406-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02406-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T06:29:05Z","timestamp":1642141745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02406-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,24]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["2406"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02406-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,24]]},"assertion":[{"value":"1 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}