{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T01:38:43Z","timestamp":1730252323605,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icnsc.2013.6548791","type":"proceedings-article","created":{"date-parts":[[2013,7,9]],"date-time":"2013-07-09T14:57:54Z","timestamp":1373381874000},"page":"509-513","source":"Crossref","is-referenced-by-count":0,"title":["A dynamic branch and bound approach for robotic rescheduling with randomly arriving jobs"],"prefix":"10.1109","author":[{"family":"Pengyu Yan","sequence":"first","affiliation":[]},{"family":"Xiaoqiang Cai","sequence":"additional","affiliation":[]},{"family":"Zhen Zhou","sequence":"additional","affiliation":[]},{"family":"Xiaowo Tang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1080\/00207549408956949"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1002\/aic.13852"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00054-7"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00272-X"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-006-0040-9"},{"key":"16","first-page":"1156","author":"che","year":"0","journal-title":"A polynomial algorithm for no-wait cyclic multi-hoist scheduling"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/70.660860"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2004.835600"},{"key":"11","first-page":"157","article-title":"Hoist scheduling for a PCB electroplating facility","volume":"20","author":"sharpiro","year":"1988","journal-title":"Trans Inst Indust Engineers"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1080\/00207540903225205"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.1995.496655"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0144"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00376-2"},{"key":"2","first-page":"185","article-title":"Optimal cyclic scheduling of a robotic processing line with two-product and time-window constraints","volume":"39","author":"lei","year":"2001","journal-title":"INFOR"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018909801944"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00167800"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/70.988976"},{"key":"6","article-title":"A proof: The cyclic hoist scheduling problem is NP-hard","author":"lei","year":"1989","journal-title":"Working Paper #89-0016 Rutgers University"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1080\/05695557608975070"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1080\/07408170208928921"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1080\/07408179408966593"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1080\/00207540802552659"}],"event":{"name":"2013 IEEE 10th International Conference on Networking, Sensing and Control (ICNSC 2013)","start":{"date-parts":[[2013,4,10]]},"location":"Evry","end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 10th IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530812\/6548700\/06548791.pdf?arnumber=6548791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T18:31:46Z","timestamp":1490207506000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6548791\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icnsc.2013.6548791","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}