{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T12:52:10Z","timestamp":1730292730421,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"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":[[2020,10]]},"DOI":"10.1109\/rivf48685.2020.9140728","type":"proceedings-article","created":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T21:32:06Z","timestamp":1594848726000},"page":"1-3","source":"Crossref","is-referenced-by-count":2,"title":["New Cuckoo Search Algorithm for the Resource Constrained Project Scheduling Problem"],"prefix":"10.1109","author":[{"given":"Huu","family":"Dang Quoc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loc","family":"Nguyen The","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuong","family":"Nguyen Doan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toan","family":"Phan Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90012-4"},{"key":"ref10","first-page":"2305","article-title":"Improved Cuckoo Search and Chaotic Flower Pollination Algorithms for Maximizing Area Coverage in Wireless Sensor Networks","volume":"30","author":"thi thanh binh","year":"2018","journal-title":"Conference Name ACM Woodstock conference"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1455-x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2997-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.10.014"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/160\/1\/012108"},{"article-title":"Nature-Inspired Optimization Algorithms","year":"2014","author":"yang","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.15439\/2015F273"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICoICT.2013.6574619"},{"article-title":"Constrained project, Springer Science Business Media NewYork","year":"2000","author":"klein","key":"ref1"}],"event":{"name":"2020 RIVF International Conference on Computing and Communication Technologies (RIVF)","start":{"date-parts":[[2020,10,14]]},"location":"Ho Chi Minh, Vietnam","end":{"date-parts":[[2020,10,15]]}},"container-title":["2020 RIVF International Conference on Computing and Communication Technologies (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9138608\/9140725\/09140728.pdf?arnumber=9140728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:51:18Z","timestamp":1656453078000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9140728\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/rivf48685.2020.9140728","relation":{},"subject":[],"published":{"date-parts":[[2020,10]]}}}