{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:35:15Z","timestamp":1730205315846,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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":[[2019,6]]},"DOI":"10.1109\/cec.2019.8790210","type":"proceedings-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:07Z","timestamp":1565308807000},"page":"2160-2166","source":"Crossref","is-referenced-by-count":4,"title":["An Effective Memetic Algorithm for Resource Constrained Project Scheduling Problem"],"prefix":"10.1109","author":[{"given":"Humyun Fuad","family":"Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ripon","family":"Kumar Chakrabortty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.03.027"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9142-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.11.044"},{"key":"ref37","first-page":"1","article-title":"Single mode resource constrained project scheduling with unreliable resources","author":"chakrabortty","year":"2018","journal-title":"Operations Research"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.01.007"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.12.059"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.12.033"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12196"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0358"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.07.001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.07.010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557755"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-008-0004-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s001700050166"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.01.007"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.12.006"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.155"},{"key":"ref4","article-title":"Resource constrained project scheduling: A branch and cut approach","volume":"132","author":"chakrabortty","year":"2015","journal-title":"Proceedings of the 45th international conference on computers and industrial engineering Metz"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0380-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00489-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.12.011"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.07.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45237-0_35"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257231"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.08.023"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.01.063"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2016.1197610"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.065"},{"key":"ref20","first-page":"1","article-title":"Multiple-order permutation flow shop scheduling under process interruptions","author":"rahman","year":"2018","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-018-2146-z"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.08.006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55914-8_17"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900242"}],"event":{"name":"2019 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2019,6,10]]},"location":"Wellington, New Zealand","end":{"date-parts":[[2019,6,13]]}},"container-title":["2019 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8778428\/8789744\/08790210.pdf?arnumber=8790210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:13:55Z","timestamp":1658157235000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8790210\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/cec.2019.8790210","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}