{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T07:56:48Z","timestamp":1782460608009,"version":"3.54.5"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Boeing Research and Technology Contract","award":["BR&T-1218-282"],"award-info":[{"award-number":["BR&T-1218-282"]}]},{"name":"Boeing Advanced Research Center (BARC) at the University of Washington, Seattle, WA, USA"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/lra.2019.2929983","type":"journal-article","created":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T23:14:08Z","timestamp":1563837248000},"page":"3844-3851","source":"Crossref","is-referenced-by-count":60,"title":["An Efficient Scheduling Algorithm for Multi-Robot Task Allocation in Assembling Aircraft Structures"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7343-8172","authenticated-orcid":false,"given":"Veniamin","family":"Tereshchuk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2254-1241","authenticated-orcid":false,"given":"Nikolay","family":"Bykov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Pedigo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5823-5123","authenticated-orcid":false,"given":"Santosh","family":"Devasia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5898-7563","authenticated-orcid":false,"given":"Ashis G.","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"4222","article-title":"Monte Carlo tree search for multi-robot task allocation","author":"kartal","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2013.IX.049"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2869999"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2514\/6.2008-6839"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.21236\/ADA526116"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1115\/1.2764504"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2007.4282558"},{"key":"ref17","first-page":"249","article-title":"Improving market-based task allocation with optimal seed scheduling","author":"korsah","year":"0","journal-title":"Proc Int Conf Intell Auton Syst"},{"key":"ref18","first-page":"2110","article-title":"Multi-robot auctions for allocation of tasks with temporal constraints","author":"nunes","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-012-9303-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.11.097"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2018.08.317"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18299-5_2"},{"key":"ref5","first-page":"1","article-title":"Real time auction based allocation of tasks for multi-robot exploration problem in dynamic environments","author":"sariel","year":"0","journal-title":"Proc AAAI Workshop Integr Plan Scheduling"},{"key":"ref8","first-page":"4863","article-title":"Multi-robot allocation of tasks with temporal and ordering constraints","author":"gini","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref7","article-title":"Branch and bound algorithms-principles and examples","author":"clausen","year":"1999"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-012-9143-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969496"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2016.2522096"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630995"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353763"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2013.IX.033"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8764082\/08767956.pdf?arnumber=8767956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:51:04Z","timestamp":1657745464000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8767956\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":23,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2929983","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}