{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T20:56:55Z","timestamp":1762808215228,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486181","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"271-279","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Reallocation problems in scheduling"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University & Tokutek, Stony Brook & New York, NY, USA"}]},{"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ & Tokutek, New York, NY, USA"}]},{"given":"S\u00e1ndor","family":"Fekete","sequence":"additional","affiliation":[{"name":"TU Braunschweig, Braunschweig, Germany"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington D.C., USA"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"issue":"3","key":"e_1_3_2_1_1_1","first-page":"154","volume":"42","author":"Archetti C.","year":"2003","unstructured":"C. Archetti , L. Bertazzi , and M. G. Speranza . Reoptimizing the Traveling Salesman Problem. Networks , 42 ( 3 ): 154 -- 159 , 2003 . C. Archetti, L. Bertazzi, and M. G. Speranza. Reoptimizing the Traveling Salesman Problem. Networks, 42(3):154--159, 2003.","journal-title":"Reoptimizing the Traveling Salesman Problem. Networks"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.08.003"},{"key":"e_1_3_2_1_3_1","volume-title":"Proccedings of CiE: Logic and Computation and Logic in the Real World","author":"Ausiello G.","year":"2007","unstructured":"G. Ausiello , V. Bonifaci , and B. Escoffier . Complexity and approximation in reoptimization . In Proccedings of CiE: Logic and Computation and Logic in the Real World , 2007 . G. Ausiello, V. Bonifaci, and B. Escoffier. Complexity and approximation in reoptimization. In Proccedings of CiE: Logic and Computation and Logic in the Real World, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.12.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970037446X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333875.1334231"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.06.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496890"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292609.1292616"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34735-6_21"},{"key":"e_1_3_2_1_11_1","series-title":"OpenAccess Series in Informatics (OASIcs)","first-page":"24","volume-title":"Proc. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems","author":"Caprara A.","year":"2010","unstructured":"A. Caprara , L. Galli , L. Kroon , G. Mar\u00f3ti , and P. Toth . Robust train routing and online re-scheduling . In T. Erlebach and M. L\u00fcbbecke, editors, Proc. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems , volume 14 of OpenAccess Series in Informatics (OASIcs) , pages 24 -- 33 , Dagstuhl, Germany , 2010 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik . A. Caprara, L. Galli, L. Kroon, G. Mar\u00f3ti, and P. Toth. Robust train routing and online re-scheduling. In T. Erlebach and M. L\u00fcbbecke, editors, Proc. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, volume 14 of OpenAccess Series in Informatics (OASIcs), pages 24--33, Dagstuhl, Germany, 2010. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_12_1","volume-title":"Robust flight schedules through slack re-allocation. Submitted","author":"Chiraphadhanakul V.","year":"2011","unstructured":"V. Chiraphadhanakul and C. Barnhart . Robust flight schedules through slack re-allocation. Submitted , 2011 . V. Chiraphadhanakul and C. Barnhart. Robust flight schedules through slack re-allocation. Submitted, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2209285.2209287"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_35"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0101"},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-10843-2_34","volume-title":"Proc. 8th Internationl Colloquium on Automata, Languages, and Programming (ICALP)","author":"Itai A.","year":"1981","unstructured":"A. Itai , A. G. Konheim , and M. Rodeh . A sparse table implementation of priority queues . In Proc. 8th Internationl Colloquium on Automata, Languages, and Programming (ICALP) , volume 115 of Lecture Notes in Computer Science , pages 417 -- 431 , 1981 . A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. 8th Internationl Colloquium on Automata, Languages, and Programming (ICALP), volume 115 of Lecture Notes in Computer Science, pages 417--431, 1981."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0269"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_21_1","first-page":"443","volume-title":"Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Katriel I.","year":"2005","unstructured":"I. Katriel and H. L. Bodlaender . Online topological ordering . In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 443 -- 450 , Vancouver, British Columbia, Canada , January 2005 . I. Katriel and H. L. Bodlaender. Online topological ordering. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 443--450, Vancouver, British Columbia, Canada, January 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0134"},{"key":"e_1_3_2_1_24_1","volume-title":"Robust optimization of large-scale systems. Operations Research, 43(2)","author":"Mulvey J. M.","year":"1995","unstructured":"J. M. Mulvey , R. J. Vanderbei , and S. A. Zenios . Robust optimization of large-scale systems. Operations Research, 43(2) , 1995 . J. M. Mulvey, R. J. Vanderbei, and S. A. Zenios. Robust optimization of large-scale systems. Operations Research, 43(2), 1995."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0068-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0381"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_52"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800330414"},{"key":"e_1_3_2_1_29_1","first-page":"70","article-title":"Rescheduling on a single machine with part-type dependent setup times and deadlines","author":"Unal A. T.","year":"1997","unstructured":"A. T. Unal , R. Uzsoy , and A. S. Kiran . Rescheduling on a single machine with part-type dependent setup times and deadlines . Annals of Operations Research , 70 , 1997 . A. T. Unal, R. Uzsoy, and A. S. Kiran. Rescheduling on a single machine with part-type dependent setup times and deadlines. Annals of Operations Research, 70, 1997.","journal-title":"Annals of Operations Research"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1074"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802183"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16879"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90034-D"}],"event":{"name":"SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":32,"alternative-id":["10.1145\/2486159.2486181","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486181","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}