{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:29:19Z","timestamp":1792787359715,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1756014"],"award-info":[{"award-number":["1756014"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of the Hong Kong Special Administrative Region, China.","award":["CityU 11268616"],"award-info":[{"award-number":["CityU 11268616"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771365"],"award-info":[{"award-number":["11771365"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323173","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T08:14:30Z","timestamp":1560845670000},"page":"237-239","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)"],"prefix":"10.1145","author":[{"given":"Lin","family":"Chen","sequence":"first","affiliation":[{"name":"University of Houston, Houston, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong SAR, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong & HHL Leipzig Graduate School of Management, Hong Kong SAR , China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"On the Complexity of Minimizing the Total Calibration Cost. In International Workshop on Frontiers in Algorithmics. Springer, 1--12","author":"Angel Eric","year":"2017","unstructured":"Eric Angel , Evripidis Bampis , Vincent Chau , and Vassilis Zissimopoulos . 2017 . On the Complexity of Minimizing the Total Calibration Cost. In International Workshop on Frontiers in Algorithmics. Springer, 1--12 . Eric Angel, Evripidis Bampis, Vincent Chau, and Vassilis Zissimopoulos. 2017. On the Complexity of Minimizing the Total Calibration Cost. In International Workshop on Frontiers in Algorithmics. Springer, 1--12."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '13)","author":"Bender Michael A.","unstructured":"Michael A. Bender , David P. Bunde , Vitus J. Leung , Samuel McCauley , and Cynthia A. Phillips . 2013. Efficient Scheduling to Minimize Calibrations . In Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '13) . ACM, New York, NY, USA, 280--287. Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, and Cynthia A. Phillips. 2013. Efficient Scheduling to Minimize Calibrations. In Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '13). ACM, New York, NY, USA, 280--287."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087573"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '15)","author":"Jeremy","unstructured":"Jeremy T. Fineman and Brendan Sheridan. 2015. Scheduling Non-Unit Jobs to Minimize Calibrations . Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '15) . ACM, New York, NY, USA, 161--170. Jeremy T. Fineman and Brendan Sheridan. 2015. Scheduling Non-Unit Jobs to Minimize Calibrations. Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '15). ACM, New York, NY, USA, 161--170."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_6_1","volume-title":"AAIM 2018, Dallas, TX, USA, December 3--4, 2018, Proceedings (Lecture Notes in Computer Science), Shaojie Tang, Ding-Zhu Du, David L. Woodruff, and Sergiy Butenko (Eds.)","volume":"11343","author":"Wang Kai","year":"2018","unstructured":"Kai Wang . 2018 . Calibration Scheduling with Time Slot Cost. In Algorithmic Aspects in Information and Management - 12th International Conference , AAIM 2018, Dallas, TX, USA, December 3--4, 2018, Proceedings (Lecture Notes in Computer Science), Shaojie Tang, Ding-Zhu Du, David L. Woodruff, and Sergiy Butenko (Eds.) , Vol. 11343 . Springer, 136--148. Kai Wang. 2018. Calibration Scheduling with Time Slot Cost. In Algorithmic Aspects in Information and Management - 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3--4, 2018, Proceedings (Lecture Notes in Computer Science), Shaojie Tang, Ding-Zhu Du, David L. Woodruff, and Sergiy Butenko (Eds.), Vol. 11343. Springer, 136--148."}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Phoenix AZ USA","acronym":"SPAA '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323173","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323173","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:23:16Z","timestamp":1750188196000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":6,"alternative-id":["10.1145\/3323165.3323173","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323173","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}