{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T04:20:48Z","timestamp":1727065248469},"reference-count":65,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1016\/j.swevo.2020.100805","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T13:29:48Z","timestamp":1606397388000},"page":"100805","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"special_numbering":"C","title":["Two-objective robust job-shop scheduling with two problem-specific neighborhood structures"],"prefix":"10.1016","volume":"61","author":[{"given":"Xiaozhi","family":"Wang","sequence":"first","affiliation":[]},{"given":"Bing","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xianxia","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuedong","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Quanke","family":"Pan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.swevo.2020.100805_bib0001","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","article-title":"Robust optimization of large-scale systems","volume":"43","author":"Murvey","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/j.swevo.2020.100805_bib0002","series-title":"Robust discrete optimization and its application","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"key":"10.1016\/j.swevo.2020.100805_bib0003","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2012.01.056","article-title":"Lexicographic a-robustness: an alternative to min\u2013max criteria","volume":"220","author":"Kalai","year":"2012","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.swevo.2020.100805_bib0004","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","article-title":"Robust scheduling to hedge against processing time uncertainty in single-stage production","volume":"41","author":"Daniels","year":"1995","journal-title":"Manag. Sci."},{"key":"10.1016\/j.swevo.2020.100805_bib0005","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1013333232691","article-title":"On the robust single machine scheduling problem","volume":"6","author":"Yang","year":"2002","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.swevo.2020.100805_bib0006","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1080\/07408170008963918","article-title":"Robust scheduling of a two-machine flow shop with uncertain processing times","volume":"32","author":"Kouvelis","year":"2000","journal-title":"IIE Trans."},{"key":"10.1016\/j.swevo.2020.100805_bib0007","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","article-title":"Approximating a two-machine flow shop scheduling under discrete scenario uncertainty","volume":"217","author":"Kasperski","year":"2012","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.swevo.2020.100805_bib0008","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/JAS.2017.7510352","article-title":"Bad-scenario-set robust optimization framework with two objectives for uncertain scheduling systems","volume":"4","author":"Wang","year":"2017","journal-title":"IEEE\/CAA J. Automatica Sinica"},{"key":"10.1016\/j.swevo.2020.100805_bib0009","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.asoc.2017.10.020","article-title":"A hybrid local-search algorithm for robust job-shop scheduling under scenarios","volume":"62","author":"Wang","year":"2018","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"10.1016\/j.swevo.2020.100805_bib0010","doi-asserted-by":"crossref","first-page":"3168","DOI":"10.1080\/00207543.2018.1555650","article-title":"Bad-scenario-set robust scheduling for a job shop to hedge against processing time uncertainty","volume":"57","author":"Wang","year":"2019","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"10.1016\/j.swevo.2020.100805_bib0011","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1109\/TFUZZ.2018.2879789","article-title":"A NSGA-II algorithm hybridizing local simulated-annealing operators for a bi-criteria robust job-shop scheduling problem under scenarios","volume":"27","author":"Wang","year":"2019","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"4","key":"10.1016\/j.swevo.2020.100805_bib0012","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1016\/j.cie.2011.07.010","article-title":"Population-based neighborhood search for job shop scheduling with interval processing time","volume":"61","author":"Lei","year":"2011","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.swevo.2020.100805_bib0013","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling: past, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"Eur. J. Oper. Res."},{"year":"2009","series-title":"Robust optimization","author":"Ben-Tal","key":"10.1016\/j.swevo.2020.100805_bib0014"},{"key":"10.1016\/j.swevo.2020.100805_bib0015","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.swevo.2018.02.010","article-title":"Multi-objective evolutionary simulation based optimization mechanism for a novel stochastic reliability centered maintenance problem","volume":"40","author":"Rahmati","year":"2018","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2020.100805_bib0016","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","article-title":"Multiple and bicriteria scheduling: a literature survey","volume":"81","author":"Nagar","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2020.100805_bib0017","article-title":"A three-stage multi-objective approach based on decomposition for an energy-efficient hybrid flow-shop scheduling problem","author":"Zhang","year":"2019","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"6","key":"10.1016\/j.swevo.2020.100805_bib0018","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Manag. Sci."},{"issue":"11","key":"10.1016\/j.swevo.2020.100805_bib0019","doi-asserted-by":"crossref","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","article-title":"A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem","volume":"34","author":"Zhang","year":"2007","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.swevo.2020.100805_bib0020","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.asoc.2012.07.034","article-title":"A hybrid differential evolution-tabu search Algorithm for the Solution of Job-Shop Scheduling Problems","volume":"13","author":"Ponsich","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2020.100805_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2019.100594","article-title":"An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals","volume":"51","author":"Wang","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2020.100805_bib0022","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.cor.2013.11.019","article-title":"An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem","volume":"45","author":"Zhao","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.swevo.2020.100805_bib0023","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1007\/s00500-015-1852-9","article-title":"A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint","volume":"21","author":"Sundar","year":"2017","journal-title":"Soft Comput."},{"issue":"10","key":"10.1016\/j.swevo.2020.100805_bib0024","first-page":"49","article-title":"An improved ant colony algorithm for multi-objective-job-shop scheduling problem","volume":"18","author":"Wang","year":"2008","journal-title":"Comput. Technol. Dev."},{"issue":"15","key":"10.1016\/j.swevo.2020.100805_bib0025","doi-asserted-by":"crossref","first-page":"4155","DOI":"10.1080\/00207540600990432","article-title":"Multiple colony ant algorithm for job-shop scheduling problem","volume":"46","author":"Udomsakdigool","year":"2008","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2020.100805_bib0026","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.eswa.2016.07.046","article-title":"An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time","volume":"65","author":"Gao","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2020.100805_bib0027","doi-asserted-by":"crossref","first-page":"10812","DOI":"10.1016\/j.eswa.2011.02.050","article-title":"A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem","volume":"38","author":"Tavakkoli-Moghaddam","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2020.100805_bib0028","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.jmsy.2013.01.005","article-title":"A bio-inspired mobile agent-based integrated system for flexible autonomic job shop scheduling","volume":"32","author":"Chou","year":"2013","journal-title":"J. Manuf. Syst."},{"issue":"23","key":"10.1016\/j.swevo.2020.100805_bib0029","doi-asserted-by":"crossref","first-page":"7071","DOI":"10.1080\/00207543.2015.1005248","article-title":"Multi-objective genetic algorithm for energy-efficient job shop scheduling","volume":"53","author":"May","year":"2015","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"10.1016\/j.swevo.2020.100805_bib0030","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1080\/09537280110040424","article-title":"Multiobjective genetic algorithm for job shop scheduling","volume":"12","author":"Ponnambalam","year":"2001","journal-title":"Prod. Plan. Control"},{"key":"10.1016\/j.swevo.2020.100805_bib0031","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0950-7051(01)00117-4","article-title":"Enhanced evolutionary algorithm for single and multiobjective optimization in job shop scheduling problem","volume":"15","author":"Esquivel","year":"2002","journal-title":"Knowl. Syst."},{"key":"10.1016\/j.swevo.2020.100805_bib0032","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/s00170-005-0029-6","article-title":"Crowding-measure-based multi-objective evolutionary for job shop scheduling","volume":"30","author":"Lei","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"8","key":"10.1016\/j.swevo.2020.100805_bib0033","doi-asserted-by":"crossref","first-page":"4991","DOI":"10.1016\/j.asoc.2011.06.001","article-title":"Simplified multi-objective genetic algorithms for stochastic job shop scheduling","volume":"11","author":"Lei","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2020.100805_bib0034","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(99)00094-6","article-title":"Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithm","volume":"120","author":"Sakawa","year":"2000","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.swevo.2020.100805_bib0035","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEVC.2018.2848921","article-title":"ISDE+\u2014an indicator for multi and many-objective optimization","volume":"23","author":"Pamulapati","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10.1016\/j.swevo.2020.100805_bib0036","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A multi-objective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10.1016\/j.swevo.2020.100805_bib0037","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1080\/0951192X.2016.1187301","article-title":"An improved MOEA\/D for multi-objective job shop scheduling problem","volume":"30","author":"Zhao","year":"2017","journal-title":"Int. J. Computer Integr. Manuf."},{"key":"10.1016\/j.swevo.2020.100805_bib0038","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","article-title":"Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption","volume":"112","author":"Zhang","year":"2016","journal-title":"J. Cleaner Prod."},{"key":"10.1016\/j.swevo.2020.100805_bib0039","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1016\/j.asoc.2012.03.073","article-title":"Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm","volume":"13","author":"Ren","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2020.100805_bib0040","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1007\/s00170-006-0787-9","article-title":"Scheduling multi-objective job shops using a memetic algorithm based on differential evolution","volume":"35","author":"Qian","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.swevo.2020.100805_bib0041","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","article-title":"An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems","volume":"59","author":"Li","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2020.100805_bib0042","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.cor.2014.01.010","article-title":"Path-relinking Tabu search for the multi-objective flexible jobshop scheduling problem","volume":"47","author":"Jia","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.swevo.2020.100805_bib0043","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multi-objective genetic algorithm: NSGAII","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2020.100805_bib0044","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 bicriteria general job shop scheduling problem","volume":"190","author":"Vilcot","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2020.100805_bib0045","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.jmsy.2019.05.004","article-title":"Bi-objective optimization for a multistate job-shop production network using NSGA-II and TOPSIS","volume":"52","author":"Lin","year":"2019","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.swevo.2020.100805_bib0046","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/s10732-009-9120-8","article-title":"A new dispatching rule based genetic algorithm for the multi-objective job shop problem","volume":"16","author":"V\u00e1zquez-Rodr\u00edguez","year":"2010","journal-title":"J. Heurist."},{"key":"10.1016\/j.swevo.2020.100805_bib0047","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.ijpe.2011.04.020","article-title":"Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm","volume":"132","author":"Al-Hinai","year":"2011","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"10.1016\/j.swevo.2020.100805_bib0048","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","article-title":"Multiobjective flexible job shop scheduling using memetic algorithms","volume":"12","author":"Yuan","year":"2015","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.swevo.2020.100805_bib0049","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.07.011","article-title":"An effective memetic algorithm for multi-objective job-shop scheduling","volume":"182","author":"Gong","year":"2019","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.swevo.2020.100805_bib0050","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.cie.2017.07.021","article-title":"An improved island model memetic algorithm with a new cooperation phase for multi-objective job shop scheduling problem","volume":"111","author":"Kurdi","year":"2017","journal-title":"Comput. Ind. Eng."},{"issue":"14","key":"10.1016\/j.swevo.2020.100805_bib0051","doi-asserted-by":"crossref","first-page":"2828","DOI":"10.1080\/00949655.2017.1344846","article-title":"Multi-objective fuzzy flexible job shop scheduling using memetic algorithm","volume":"87","author":"Wang","year":"2017","journal-title":"J. Statist. Comput. Simul."},{"key":"10.1016\/j.swevo.2020.100805_bib0052","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","article-title":"A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms","volume":"73","author":"Ahmadi","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"10.1016\/j.swevo.2020.100805_bib0053","doi-asserted-by":"crossref","first-page":"2506","DOI":"10.1080\/00207543.2017.1388933","article-title":"A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility","volume":"56","author":"Gong","year":"2018","journal-title":"Int. J. Prod. Res."},{"issue":"24","key":"10.1016\/j.swevo.2020.100805_bib0054","doi-asserted-by":"crossref","first-page":"7327","DOI":"10.1080\/00207543.2011.648280","article-title":"Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches","volume":"50","author":"Rabiee","year":"2012","journal-title":"Int. J. Prod. Res."},{"issue":"11","key":"10.1016\/j.swevo.2020.100805_bib0055","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1080\/0305215X.2016.1145216","article-title":"Robust scheduling for multi-objective flexible job-shop problems with flexible workdays","volume":"48","author":"Zhang","year":"2016","journal-title":"Eng. Optim."},{"key":"10.1016\/j.swevo.2020.100805_bib0056","first-page":"21","article-title":"Multiobjective evolutionary algorithms: a survey of the state of the art","volume":"1","author":"Zhoua","year":"2011","journal-title":"Swarm Evol. Comput."},{"issue":"12","key":"10.1016\/j.swevo.2020.100805_bib0057","doi-asserted-by":"crossref","first-page":"3516","DOI":"10.1080\/00207543.2012.751509","article-title":"A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem","volume":"51","author":"Zhang","year":"2013","journal-title":"Int. J. Prod. Res."},{"issue":"22","key":"10.1016\/j.swevo.2020.100805_bib0058","doi-asserted-by":"crossref","first-page":"4793","DOI":"10.1080\/00207540600621094","article-title":"Bio-inspired scheduling for dynamic job shops with flexible routing and sequence-dependent setups","volume":"44","author":"Yu","year":"2006","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2020.100805_bib0059","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s00170-011-3646-2","article-title":"Multi-objective swarm-based neighborhood search for fuzzy flexible job shop scheduling","volume":"60","author":"Zheng","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.swevo.2020.100805_bib0060","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.asoc.2016.07.004","article-title":"Robust multiobjective optimisation for fuzzy job shop problems","volume":"56","author":"Palacios","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2020.100805_bib0061","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/978-3-642-03664-4_89","article-title":"Genetic simulated-annealing algorithm for robust job shop scheduling","volume":"62","author":"Wang","year":"2009","journal-title":"Fuzzy Inf. Eng. Vol. 2: Adv. Intell. Soft Comput."},{"year":"1963","series-title":"Industrial Scheduling","author":"Muth","key":"10.1016\/j.swevo.2020.100805_bib0065"},{"key":"10.1016\/j.swevo.2020.100805_bib0066","series-title":"Graduate School of Industrial Administration","article-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement)","author":"Lawrence","year":"1984"},{"issue":"3","key":"10.1016\/j.swevo.2020.100805_bib0067","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Manag. Sci."},{"key":"10.1016\/j.swevo.2020.100805_bib0068","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/s00170-004-2492-x","article-title":"Pareto archived simulated annealing for job shop scheduling with multiple objectives","volume":"29","author":"Suresh","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650220304582?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650220304582?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T19:58:46Z","timestamp":1612987126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650220304582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":65,"alternative-id":["S2210650220304582"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2020.100805","relation":{},"ISSN":["2210-6502"],"issn-type":[{"type":"print","value":"2210-6502"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Two-objective robust job-shop scheduling with two problem-specific neighborhood structures","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2020.100805","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"}],"article-number":"100805"}}