{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:21Z","timestamp":1759638741209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596044"},{"type":"electronic","value":"9783319596051"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59605-1_1","type":"book-chapter","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T15:06:26Z","timestamp":1495465586000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Minimizing the Total Calibration Cost"],"prefix":"10.1007","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Chau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"key":"1_CR1","unstructured":"New integrated stockpile evaluation program to better ensure weapons stockpile safety, security, reliability (2006). http:\/\/www.sandia.gov\/LabNews\/060331.html"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Bunde, D.P., Leung, V.J., McCauley, S., Phillips, C.A.: Efficient scheduling to minimize calibrations. In: 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 280\u2013287. ACM (2013). http:\/\/doi.acm.org\/10.1145\/2486159.2486193","DOI":"10.1145\/2486159.2486193"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Fineman, J.T., Sheridan, B.: Scheduling non-unit jobs to minimize calibrations. In: Blelloch, G.E., Agrawal, K. (eds.) Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, 13\u201315 June 2015, pp. 161\u2013170. ACM (2015). http:\/\/doi.acm.org\/10.1145\/2755573.2755605","DOI":"10.1145\/2755573.2755605"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617\u2013643 (2000). http:\/\/doi.acm.org\/10.1145\/347476.347479","journal-title":"J. ACM"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0167-6377(93)90072-O","volume":"14","author":"T Lai","year":"1993","unstructured":"Lai, T.: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems. Oper. Res. Lett. 14(4), 215\u2013220 (1993). http:\/\/dx.doi.org\/10.1016\/0167-6377(93)90072-O","journal-title":"Oper. Res. Lett."},{"key":"1_CR7","unstructured":"Lueker, G.: Two NP-complete problems in nonnegative integer programming. Report No. 178, Computer Science Laboratory, Princeton University (1975)"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"CA Phillips","year":"2002","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica 32(2), 163\u2013200 (2002). http:\/\/dx.doi.org\/10.1007\/s00453-001-0068-9","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59605-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:25:31Z","timestamp":1710343531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59605-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596044","9783319596051"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/faw2017.uestc.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}