{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:07:16Z","timestamp":1775326036307,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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,11]]},"DOI":"10.1109\/iros40897.2019.8967809","type":"proceedings-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T23:53:51Z","timestamp":1580428431000},"page":"7386-7393","source":"Crossref","is-referenced-by-count":6,"title":["Cannot avoid penalty for fluctuating order arrival rate? Let's minimize"],"prefix":"10.1109","author":[{"given":"Marichi","family":"Agarwal","sequence":"first","affiliation":[{"name":"Embedded Systems & Robotics division of TCS Research & Innovation,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chayan","family":"Sarkar","sequence":"additional","affiliation":[{"name":"Embedded Systems & Robotics division of TCS Research & Innovation,India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.803462"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2274-6_6"},{"key":"ref12","article-title":"Monte carlo tree search with branch and bound for multi-robot task allocation","author":"kartal","year":"2016","journal-title":"IJCAI Workshop on Autonomous Mobile Service Robots"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2014.895902"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570270"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630994"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794338"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2018.8560555"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460886"},{"key":"ref4","first-page":"492","article-title":"Decentralised online planning for multi-robot warehouse commissioning","author":"claes","year":"2017","journal-title":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems"},{"key":"ref3","author":"baker","year":"2005","journal-title":"Comparison of Empirical Success Rates of Global vs Partitioned Fixed-priority and EDF Scheduling for Hard Real Time"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.07.009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-014-0154-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14031-0_42"},{"key":"ref7","article-title":"The partitioned multiprocessor scheduling of non-preemptive sporadic task systems","author":"fisher","year":"2006","journal-title":"14th International Conference on Real-Time and Network Systems"},{"key":"ref2","first-page":"1082","article-title":"Incentivizing cooperation between heterogeneous agents in dynamic task allocation","author":"amador nelke","year":"2017","journal-title":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems"},{"key":"ref1","year":"2017","journal-title":"Capacitated Vehicle Routing Problem Library"},{"key":"ref9","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(95)00057-7"},{"key":"ref22","first-page":"739","article-title":"Distributed strategy adaptation with a prediction function in multi-agent task allocation","author":"turner","year":"2018","journal-title":"Proc of International Conference on Autonomous Agents and Multiagent Systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.2005.65"},{"key":"ref23","first-page":"475","article-title":"Dynamic task scheduling with load balancing using hybrid particle swarm optimization","volume":"2","author":"visalakshi","year":"2009","journal-title":"Int J Open Problems Compt Math"}],"event":{"name":"2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","location":"Macau, China","start":{"date-parts":[[2019,11,3]]},"end":{"date-parts":[[2019,11,8]]}},"container-title":["2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8957008\/8967518\/08967809.pdf?arnumber=8967809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:23:57Z","timestamp":1755800637000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8967809\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/iros40897.2019.8967809","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}