{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T09:40:11Z","timestamp":1782985211701,"version":"3.54.5"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,30]]},"DOI":"10.1109\/cec60901.2024.10611875","type":"proceedings-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T17:55:15Z","timestamp":1723139715000},"page":"1-10","source":"Crossref","is-referenced-by-count":3,"title":["Evolving Priority Rules for Online Yard Crane Scheduling with Incomplete Tasks Data"],"prefix":"10.1109","author":[{"given":"Chenwei","family":"Jin","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Nottingham,The Digital Port Technologies Lab,Ningbo,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruibin","family":"Bai","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nottingham,The Digital Port Technologies Lab,Ningbo,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huayan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nottingham,The Digital Port Technologies Lab,Ningbo,China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"2010","volume-title":"Container port annual throughput","year":"2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185659"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2004.09.009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/03052150500323849"},{"issue":"05","key":"ref5","article-title":"Optimization of yard crane scheduling using particle swarm optimization with genetic algorithm operators (psogao)","volume":"67","author":"Kumar","year":"2008","journal-title":"Journal of Scientific and Industrial Research"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2011.02.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2018.11.004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1516903"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5537114"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.03.065"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105782"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2014.7020024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-017-9299-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.33.8.1035"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.08.011"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-4774-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3209985"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.10.032"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120568"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114548"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2780256"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601322"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2018.06.003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108787"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100869"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.483"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2429314"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.4.487"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100944"},{"key":"ref30","first-page":"32","article-title":"Efficient generation of near optimal initial populations to enhance genetic algorithms for job-shop scheduling","volume":"39","author":"Kuczapski","year":"2010","journal-title":"Information technology and control"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78293-3_22"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1762-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.12.003"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2011.12.020"}],"event":{"name":"2024 IEEE Congress on Evolutionary Computation (CEC)","location":"Yokohama, Japan","start":{"date-parts":[[2024,6,30]]},"end":{"date-parts":[[2024,7,5]]}},"container-title":["2024 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10609966\/10611750\/10611875.pdf?arnumber=10611875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T04:22:11Z","timestamp":1723350131000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10611875\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,30]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/cec60901.2024.10611875","relation":{},"subject":[],"published":{"date-parts":[[2024,6,30]]}}}