{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T05:21:51Z","timestamp":1761110511931,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2018M630861"],"award-info":[{"award-number":["2018M630861"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370183"],"award-info":[{"award-number":["61370183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/tetci.2019.2935773","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T00:25:12Z","timestamp":1567470312000},"page":"385-397","source":"Crossref","is-referenced-by-count":15,"title":["A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0618-4969","authenticated-orcid":false,"given":"Junwen","family":"Ding","sequence":"first","affiliation":[]},{"given":"Liji","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Zhipeng","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Liping","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Una","family":"Benlic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"Cooperative evolutionary framework with focused search for many-objective optimization","author":"wang","year":"0","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"ref38","first-page":"2","article-title":"Uniform crossover in genetic algorithms","author":"sywerda","year":"0","journal-title":"Proc 3rd Int Conf Genetic Algorithms"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","article-title":"A memetic algorithm for graph coloring","volume":"203","author":"l\u00fc","year":"2010","journal-title":"Eur J Oper Res"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2018.2883450"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2018.2866239"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1109\/TASE.2012.2219860","article-title":"A high performing memetic algorithm for the flowshop scheduling problem with blocking","volume":"10","author":"pan","year":"2013","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2017.2743758"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.01.011"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.08.017"},{"key":"ref34","first-page":"36","article-title":"Dynamic evolutionary multiobjective optimization for raw ore allocation in mineral processing","volume":"3","author":"ding","year":"2019","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2010.01.015"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2010.171"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1998.11732359"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(96)00102-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.04.050"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.04.018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2009.08.023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.02.018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2006.11.014"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.08.053"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.44"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(88)90041-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.11.047"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/70.864235"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.6.979"},{"key":"ref29","first-page":"251","article-title":"On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms","volume":"826","author":"moscato","year":"1989"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.3.495"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00284-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90080-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.06.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.01.017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540410001699381"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1080\/0305215X.2014.982634","article-title":"Parallel machine scheduling with step-deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm","volume":"47","author":"peng","year":"2015","journal-title":"Eng Optim"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.02.018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.010"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600740"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.10.016"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.03.027"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601681"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/9099327\/08822597.pdf?arnumber=8822597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T12:49:27Z","timestamp":1651063767000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8822597\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2019.2935773","relation":{},"ISSN":["2471-285X"],"issn-type":[{"type":"electronic","value":"2471-285X"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}