{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:38:30Z","timestamp":1776105510762,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"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.2486193","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"280-287","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Efficient scheduling to minimize calibrations"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University & Tokutek, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Bunde","sequence":"additional","affiliation":[{"name":"Knox College, Galesburg, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitus J.","family":"Leung","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"McCauley","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia A.","family":"Phillips","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"March","year":"2006","unstructured":"New integrated stockpile evaluation program to better ensure weapons stockpile safety , security, reliability , March 2006 . http:\/\/www.sandia.gov\/LabNews\/060331.html. New integrated stockpile evaluation program to better ensure weapons stockpile safety, security, reliability, March 2006. http:\/\/www.sandia.gov\/LabNews\/060331.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109598"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90012-4"},{"key":"e_1_3_2_1_4_1","volume-title":"Scheduling Algorithms","author":"Brucker P.","year":"2007","unstructured":"P. Brucker . Scheduling Algorithms . Springer , New York , 2007 . P. Brucker. Scheduling Algorithms. Springer, New York, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9574.1990.tb01276.x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(98)00105-3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00194-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204035"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_3_2_1_11_1","volume-title":"CRC Handbook of Computer Science","author":"Karger D.","year":"1997","unstructured":"D. Karger , C. Stein , and J. Wein . Scheduling algorithms . CRC Handbook of Computer Science , 1997 . D. Karger, C. Stein, and J. Wein. Scheduling algorithms. CRC Handbook of Computer Science, 1997."},{"key":"e_1_3_2_1_12_1","first-page":"81","volume-title":"Twente Workshop on Graphs and Combinatorial Optimization","author":"Kern W.","year":"1991","unstructured":"W. Kern and W. N. Nawijn . Scheduling multi-operation jobs with time lags on a single machine . In Twente Workshop on Graphs and Combinatorial Optimization , pages 81 -- 86 , 1991 . W. Kern and W. N. Nawijn. Scheduling multi-operation jobs with time lags on a single machine. In Twente Workshop on Graphs and Combinatorial Optimization, pages 81--86, 1991."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00914-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.1.80"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.386982"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/957195.808055"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000036858.59787.c2"}],"event":{"name":"SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"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.2486193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486193","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.2486193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":16,"alternative-id":["10.1145\/2486159.2486193","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486193","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"}}]}}