{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:49Z","timestamp":1759638949507,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_12","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"136-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Calibration Scheduling with Time Slot Cost"],"prefix":"10.1007","author":[{"given":"Kai","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-59605-1_1","volume-title":"Frontiers in Algorithmics","author":"E Angel","year":"2017","unstructured":"Angel, E., Bampis, E., Chau, V., Zissimopoulos, V.: On the complexity of minimizing the total calibration cost. In: Xiao, M., Rosamond, F. (eds.) FAW 2017. LNCS, vol. 10336, pp. 1\u201312. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59605-1_1"},{"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: Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 280\u2013287. ACM, New York (2013)","key":"12_CR2","DOI":"10.1145\/2486159.2486193"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0007-8506(07)60147-4","volume":"54","author":"B Bringmann","year":"2005","unstructured":"Bringmann, B., K\u00fcng, A., Knapp, W.: A measuring artefact for true 3D machine testing and calibration. CIRP Ann.-Manuf. Technol. 54(1), 471\u2013474 (2005)","journal-title":"CIRP Ann.-Manuf. Technol."},{"unstructured":"Burroughs, C.: New integrated stockpile evaluation program to better ensure weapons stockpile safety, security, reliability (2006)","key":"12_CR4"},{"doi-asserted-by":"crossref","unstructured":"Chau, V., Li, M., McCauley, S., Wang, K.: Minimizing total weighted flow time with calibrations. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, pp. 67\u201376. ACM, New York (2017)","key":"12_CR5","DOI":"10.1145\/3087556.3087573"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-662-48054-0_18","volume-title":"Mathematical Foundations of Computer Science 2015","author":"L Chen","year":"2015","unstructured":"Chen, L., Megow, N., Rischke, R., Stougie, L., Verschae, J.: Optimal algorithms and a PTAS for cost-aware scheduling. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 211\u2013222. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_18"},{"doi-asserted-by":"crossref","unstructured":"Fineman, J.T., Sheridan, B.: Scheduling non-unit jobs to minimize calibrations. In: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, pp. 161\u2013170. ACM, New York (2015)","key":"12_CR7","DOI":"10.1145\/2755573.2755605"},{"key":"12_CR8","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.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"12_CR9","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)","journal-title":"J. ACM"},{"issue":"7","key":"12_CR10","doi-asserted-by":"publisher","first-page":"9132","DOI":"10.3390\/s130709132","volume":"13","author":"H-N Nguyen","year":"2013","unstructured":"Nguyen, H.-N., Zhou, J., Kang, H.-J.: A new full pose measurement method for robot calibration. Sensors 13(7), 9132\u20139147 (2013)","journal-title":"Sensors"},{"key":"12_CR11","volume-title":"Matroid Theory","author":"JG Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"doi-asserted-by":"crossref","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the 29th ACM Symposium on Theory of Computing, STOC 1997, pp. 140\u2013149. ACM Press, New York (1997)","key":"12_CR12","DOI":"10.1145\/258533.258570"},{"issue":"2","key":"12_CR13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/nav.20393","volume":"57","author":"G Wan","year":"2010","unstructured":"Wan, G., Qi, X.: Scheduling with variable time slot costs. Naval Res. Log. (NRL) 57(2), 159\u2013171 (2010)","journal-title":"Naval Res. Log. (NRL)"},{"issue":"11","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/34.888718","volume":"22","author":"Z Zhang","year":"2000","unstructured":"Zhang, Z.: A flexible new technique for camera calibration. IEEE Trans. Pattern Anal. Mach. Intell. 22(11), 1330\u20131334 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"12_CR15","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10951-015-0462-9","volume":"19","author":"Y Zhao","year":"2016","unstructured":"Zhao, Y., Qi, X., Li, M.: On scheduling with non-increasing time slot cost to minimize total weighted completion time. J. Sched. 19(6), 759\u2013767 (2016)","journal-title":"J. Sched."},{"key":"12_CR16","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-25766-7_90","volume-title":"Recent Advances in Computer Science and Information Engineering","author":"W Zhong","year":"2012","unstructured":"Zhong, W., Liu, X.: A single machine scheduling problem with time slot costs. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds.) Recent Advances in Computer Science and Information Engineering. LNEE, vol. 126, pp. 677\u2013681. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25766-7_90"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:58:12Z","timestamp":1710338292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}