{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:35:36Z","timestamp":1730298936609,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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,12]]},"DOI":"10.1109\/ssci44817.2019.9003132","type":"proceedings-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T02:49:24Z","timestamp":1582253364000},"page":"2698-2705","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling method of maintenance support resource with task timing constraint"],"prefix":"10.1109","author":[{"given":"Chongchong","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.926731"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.08.012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586543"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/368996.369025"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580430"},{"key":"ref16","volume":"1","author":"johnson","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","article-title":"A multiplier adjustment method for the generalized assignment problem","volume":"32","author":"marshall l","year":"1986","journal-title":"Management Science"},{"key":"ref18","first-page":"589","article-title":"An algorithm for the generalized assignment problem","author":"martello","year":"1981","journal-title":"Operational Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2010.53"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.07.038"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSEE.2014.00008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2010.04.020"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2011.03.011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2872533"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2647742"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2014.06.006"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2015.07.002"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s13042-017-0731-3","article-title":"A modified nature inspired meta-heuristic whale optimization algorithm for solving 0-1 knapsack problem","volume":"10","author":"mohamed","year":"2019","journal-title":"International Journal of Machine Learning and Cybemetics"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/351827.384254","article-title":"Dijkstra's algorithm on-line: an empirical case study from public railroad transport","volume":"5","author":"frank","year":"2000","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"article-title":"A transition-based directed acyclic graph parser for UCCA","year":"2017","author":"daniel","key":"ref21"}],"event":{"name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2019,12,6]]},"location":"Xiamen, China","end":{"date-parts":[[2019,12,9]]}},"container-title":["2019 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8975711\/9002648\/09003132.pdf?arnumber=9003132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:50:00Z","timestamp":1658080200000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9003132\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/ssci44817.2019.9003132","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}