{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:01:29Z","timestamp":1780444889773,"version":"3.54.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/tase.2015.2432746","type":"journal-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T20:42:26Z","timestamp":1433364146000},"page":"950-962","source":"Crossref","is-referenced-by-count":50,"title":["An Iterative Approach for Collision Free Routing and Scheduling in Multirobot Stations"],"prefix":"10.1109","volume":"13","author":[{"given":"Domenico","family":"Spensieri","sequence":"first","affiliation":[{"name":"Geometry and Motion Planning Group, Fraunhofer-Chalmers Research Centre for Industrial Mathematics, Gothenburg, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan S.","family":"Carlson","sequence":"additional","affiliation":[{"name":"Geometry and Motion Planning Group, Fraunhofer-Chalmers Research Centre for Industrial Mathematics, Gothenburg, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fredrik","family":"Ekstedt","sequence":"additional","affiliation":[{"name":"Geometry and Motion Planning Group, Fraunhofer-Chalmers Research Centre for Industrial Mathematics, Gothenburg, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Bohlin","sequence":"additional","affiliation":[{"name":"Geometry and Motion Planning Group, Fraunhofer-Chalmers Research Centre for Industrial Mathematics, Gothenburg, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.08.012"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1080\/07408170008967423"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2006.886255"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2003.820590"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/00207540110118073"},{"key":"ref30","article-title":"Deadlock-free scheduling method using genetic algorithms and timed <ref_formula><tex Notation=\"TeX\">$S^{3}PR$<\/tex> <\/ref_formula> sets","author":"huang","year":"2004","journal-title":"Proc Amer Control Conf"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.6.1077"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/00207549108948090"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2043096"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.853489"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TSMCC.2011.2160626","article-title":"Deadlock control of automated manufacturing systems based on Petri nets a literature review","volume":"42","author":"li","year":"2012","journal-title":"IEEE Trans Syst Man Cybern -Part C Appl Rev"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TSMCC.2007.913920","article-title":"A survey and comparison of petri net-based deadlock prevention policies for flexible manufacturing systems","volume":"38","author":"li","year":"2008","journal-title":"IEEE Trans Syst Man Cybern -Part C Appl Rev"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2183353"},{"key":"ref2","year":"0"},{"key":"ref1","article-title":"Achieving sustainable production through increased utilization of production resource","author":"almstr\ufffdm","year":"2011","journal-title":"Proc 4th Swedish Prod Symp SPS11"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2004.823875"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2010.2058101"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1608-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2011.2156783"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2162502"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2007.909542"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2402619"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CoASE.2013.6654032"},{"key":"ref51","first-page":"381","article-title":"Scheduling algorithms for optimal robot cell coordination?A comparison","author":"kobetski","year":"2006","journal-title":"Proc IEEE Int Conf Autom Sci Eng"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2015.38"},{"key":"ref56","article-title":"Fast distance queries for triangles, lines, points using SSE instructions","volume":"3","author":"shellshear","year":"2014","journal-title":"J Comput Graph Tech"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2012.6465272"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.770022"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00073-9"},{"key":"ref11","author":"eek","year":"2009","journal-title":"Effective methods for solving the balanced and synchronized multiple TSP using genetic algorithms"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.07.004"},{"key":"ref12","article-title":"Throughput maximization by balancing, sequencing and coordinating motions of operations in multi-robot stations","author":"spensieri","year":"2010","journal-title":"Proc NordDesign Conf"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1115\/IMECE2010-40396"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1115\/IMECE2011-65102"},{"key":"ref15","author":"welz","year":"2010","journal-title":"Route planning for robot systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00142-0_75"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/00207540110091712"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018936219150"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/00207540110073037"},{"key":"ref4","author":"latombe","year":"1992","journal-title":"Robot Motion Planning"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","author":"toth","year":"2002","journal-title":"The Vehicle Routing Problem Monographs on Discrete Mathematics and Applications"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.2.132.118"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref8","year":"0"},{"key":"ref7","author":"na","year":"2003","journal-title":"Heuristic approaches for the no-depot k-traveling salesmen problem with a minmax objective"},{"key":"ref49","year":"0"},{"key":"ref9","article-title":"Solving the min-max multi-depot vehicle routing problem","author":"carlsson","year":"2007","journal-title":"Proc Fields Inst Workshop on Global Opt"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.2010407"},{"key":"ref45","author":"rambau","year":"2010","journal-title":"?How to avoid collisions in scheduling industrial robots? ?"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.011"},{"key":"ref47","article-title":"A direct Lin-Kernighan heuristic for the generalized traveling salesman","author":"ekstedt","year":"0"},{"key":"ref42","author":"clausen","year":"1999","journal-title":"?Branch and bound algorithms?Principles and examples ?"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.077"},{"key":"ref44","year":"0"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/7447676\/07114350.pdf?arnumber=7114350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:34:23Z","timestamp":1633919663000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7114350\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":57,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tase.2015.2432746","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}