{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:32Z","timestamp":1740169172887,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872126"],"award-info":[{"award-number":["61872126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3013375","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T20:23:49Z","timestamp":1596227029000},"page":"142269-142281","source":"Crossref","is-referenced-by-count":4,"title":["Heuristic Optimization for Robust Resource-Constrained Flexible Project Scheduling Problem"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0540-865X","authenticated-orcid":false,"given":"Yongli","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiran","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015009818589"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2010.07.049"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.01.063"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.5267\/j.jpm.2018.1.005"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.09.052"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2012.01.013"},{"key":"ref36","first-page":"1470","article-title":"Ant colony optimization: A new meta-heuristic","author":"dorigo","year":"2002","journal-title":"Proc Congr Evol Comput (CEC)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.09.005"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICICTA.2008.416"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/07408170008963915"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010954031930"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601563"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00761-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8667.2005.00420.x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.065"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4114\/ia.v10i30.947"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01009-5_8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.03.034"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2014.09.056"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.04.096"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2011.5949965"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010902015091"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1455-x"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2283916"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.5267\/j.msl.2011.10.010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.04.056"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.07.059"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62893-6_5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.10.027"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00348-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.03.019"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2014.06.025","article-title":"Multi-mode resource constrained multi-project scheduling and resource portfolio problem","volume":"240","author":"be?ikci","year":"2015","journal-title":"Eur J Oper Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2014025"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12644"},{"key":"ref23","article-title":"On constraint programming for a new flexible project scheduling problem with resource constraints","author":"hauder","year":"2019","journal-title":"arXiv 1902 09244"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.04.019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.002"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09153561.pdf?arnumber=9153561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:49Z","timestamp":1642003009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9153561\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3013375","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}