{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:03:39Z","timestamp":1773327819241,"version":"3.50.1"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Beijing Key Laboratory of Digital Design and Manufacturing"},{"name":"National High Technology Research and Development Programme (863) of China","award":["2012AA040907"],"award-info":[{"award-number":["2012AA040907"]}]},{"DOI":"10.13039\/501100002358","name":"Beihang University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002358","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2018.2883802","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T20:03:02Z","timestamp":1543435382000},"page":"68-88","source":"Crossref","is-referenced-by-count":57,"title":["Hyper-Heuristic Coevolution of Machine Assignment and Job Sequencing Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5129-9159","authenticated-orcid":false,"given":"Yong","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Mechanical Engineering and Automation, Beihang University, Beijing, China"}]},{"given":"Jian-Jun","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering and Automation, Beihang University, Beijing, China"}]},{"given":"Lian-Yu","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering and Automation, Beihang University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.34.1.67.12283"},{"key":"ref70","first-page":"1235","article-title":"An empirical analysis of collaboration methods in cooperative coevolutionary algorithms","author":"wiegand","year":"2001","journal-title":"Proc GECCO"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.asoc.2016.07.025","article-title":"Adaptive scheduling on unrelated machines with genetic programming","volume":"48","author":"?urasevi?","year":"2016","journal-title":"Appl Soft Comput"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.03.065"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2429314"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2319051"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.71"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1137-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2518-5"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/00207540600993360"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-017-0036-x"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.asoc.2014.01.037","article-title":"A hyper-heuristic based framework for dynamic optimization problems","volume":"19","author":"topcuoglu","year":"2014","journal-title":"Appl Soft Comput"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2006.14.3.309"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/298151.298382"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830530"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-005-6164-x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.060"},{"key":"ref64","article-title":"Fault tolerant design using single and multicriteria genetic algorithm optimization","author":"schott","year":"1995"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.793476"},{"key":"ref65","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref66","article-title":"Automatic design of dispatching rules for job shop scheduling with genetic programming","author":"nguyen","year":"2013"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10710-017-9302-3","article-title":"Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment","volume":"19","author":"?urasevi?","year":"2018","journal-title":"Genetic Program Evolvable Mach"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2274517"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2017.2743758"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2562674"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2018.01.006"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2017.06.009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-013-0804-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2013.03.006"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","article-title":"A research survey: Review of AI solution strategies of job shop scheduling problem","volume":"26","author":"\u00e7alis","year":"2015","journal-title":"J Intell Manuf"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0534-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1178406"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.05.052"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2012.04.001"},{"key":"ref50","article-title":"Genetic programming with multi-tree representation for dynamic flexible job shop scheduling","author":"zhang","year":"0"},{"key":"ref51","article-title":"Surrogate-assisted genetic programming for dynamic flexible job shop scheduling","author":"zhang","year":"0"},{"key":"ref59","article-title":"SPEA2: Improving the strength Pareto evolutionary algorithm for multi-objective optimization","author":"zitzler","year":"2001"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref57","first-page":"87","article-title":"Gene expression programming: A new adaptive algorithm for solving problems","volume":"13","author":"ferreira","year":"2001","journal-title":"Complex Syst"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/BF00175355"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2002.1009117"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00675-6"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2011.611539"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2010.08.017"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10710-017-9302-3","article-title":"Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment","volume":"19","author":"?urasevi?","year":"2018","journal-title":"Genetic Program Evolvable Mach"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2012.08.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/9016303"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.09.005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1137-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.04.002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1039-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2016.01.016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.03.059"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2017.12.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2018.05.008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2761994"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2016.1145216"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00131"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0090-8"},{"key":"ref49","first-page":"149","article-title":"Feature construction in genetic programming hyper-heuristic for dynamic flexible job shop scheduling","author":"yska","year":"2018","journal-title":"Proc GECCO"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12199"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-012-0626-9"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.08.008"},{"key":"ref48","first-page":"306","article-title":"Genetic programming hyper-heuristic with cooperative coevolution for dynamic flexible job shop scheduling","author":"yska","year":"2018","journal-title":"Proc EuroGP"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2017.07.005"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2248159"},{"key":"ref41","article-title":"A hybrid genetic programming algorithm for automated design of dispatching rules","author":"nguyen","year":"0","journal-title":"Evol Comput"},{"key":"ref44","article-title":"A semantics-based dispatching rule selection approach for job shop scheduling","author":"zhang","year":"0","journal-title":"J Intell Manuf"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2012.10.016"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08550675.pdf?arnumber=8550675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T21:24:36Z","timestamp":1705353876000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8550675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":71,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2883802","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}