{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:57:28Z","timestamp":1742921848891,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-77404-6_17","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"217-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for Replenishment Problems with Fixed Turnover Times"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4346-920X","authenticated-orcid":false,"given":"Thomas","family":"Bosman","sequence":"first","affiliation":[]},{"given":"Martijn","family":"van Ee","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Jiao","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7603-1207","authenticated-orcid":false,"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"17_CR1","unstructured":"Baruah, S., Goossens, J.: Scheduling real-time tasks: algorithms and complexity. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2003)"},{"key":"17_CR2","unstructured":"Baruah, S., Rosier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium, pp. 315\u2013320 (1990)"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s00453-011-9505-6","volume":"63","author":"V Bonifaci","year":"2012","unstructured":"Bonifaci, V., Marchetti-Spaccamela, A.: Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica 63(4), 763\u2013780 (2012)","journal-title":"Algorithmica"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bosman, T., van Ee, M., Jiao, Y., Marchetti-Spaccamela, A., Ravi, R., Stougie, L.: Approximation algorithms for replenishment problems with fixed turnover times. arXiv preprint arXiv:1712.05218 (2017)","DOI":"10.1007\/978-3-319-77404-6_17"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.jcss.2007.06.015","volume":"74","author":"C Calabro","year":"2008","unstructured":"Calabro, C., Impagliazzo, R., Kabenets, V., Paturi, R.: The complexity of unique $$k$$-SAT: an isolation lemma for $$k$$-CNFs. J. Comput. Syst. Sci. 74(3), 386\u2013393 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1109\/12.144627","volume":"41","author":"MY Chan","year":"1992","unstructured":"Chan, M.Y., Chin, F.Y.L.: General schedulers for the pinwheel problem based on double-integer reduction. IEEE Trans. Comput. 41(6), 755\u2013768 (1992)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF01187034","volume":"9","author":"MY Chan","year":"1993","unstructured":"Chan, M.Y., Chin, F.Y.L.: Schedulers for larger classes of pinwheel instances. Algorithmica 9(5), 425\u2013462 (1993)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2013","unstructured":"Coelho, L.C., Cordeau, J.-F., Laporte, G.: Thirty years of inventory routing. Transp. Sci. 48(1), 1\u201319 (2013)","journal-title":"Transp. Sci."},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/opre.1110.0919","volume":"59","author":"S Coene","year":"2011","unstructured":"Coene, S., Spieksma, F.C.R., Woeginger, G.J.: Charlemagne\u2019s challenge: the periodic latency problem. Oper. Res. 59(3), 674\u2013683 (2011)","journal-title":"Oper. Res."},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2635812","volume":"10","author":"H Dell","year":"2014","unstructured":"Dell, H., Husfeldt, T., Marx, D., Taslaman, N., Wahl\u00e9n, M.: Exponential time complexity of the permanent and the tutte polynomial. ACM Trans. Algorithms 10(4), 21:1\u201321:32 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-14165-2_26","volume-title":"Automata, Languages and Programming","author":"F Eisenbrand","year":"2010","unstructured":"Eisenbrand, F., H\u00e4hnle, N., Niemeier, M., Skutella, M., Verschae, J., Wiese, A.: Scheduling periodic tasks in a hard real-time environment. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 299\u2013311. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_26"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11241-015-9225-0","volume":"52","author":"P Ekberg","year":"2016","unstructured":"Ekberg, P., Yi, W.: Schedulability analysis of a graph-based task model for mixed-criticality systems. Real-Time Syst. 52(1), 1\u201337 (2016)","journal-title":"Real-Time Syst."},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00453-002-0938-9","volume":"34","author":"PC Fishburn","year":"2002","unstructured":"Fishburn, P.C., Lagarias, J.C.: Pinwheel scheduling: achievable densities. Algorithmica 34(1), 14\u201338 (2002)","journal-title":"Algorithmica"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. In: Proceedings of the 17th International Symposium on Foundations of Computer Science, pp. 216\u2013227 (1976)","DOI":"10.1109\/SFCS.1976.6"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-51963-0_18","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"L G\u0105sieniec","year":"2017","unstructured":"G\u0105sieniec, L., Klasing, R., Levcopoulos, C., Lingas, A., Min, J., Radzik, T.: Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors). In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 229\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_18"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: a real-time scheduling problem. In: Proceedings of the 22th Annual Hawaii International Conference on System Sciences, vol. 2, pp. 693\u2013702 (1989)","DOI":"10.1109\/HICSS.1989.48075"},{"key":"17_CR18","unstructured":"Jacobs, T., Longo, S.: A new perspective on the windows scheduling problem. arXiv preprint arXiv:1410.7237 (2014)"},{"issue":"1\u20135","key":"17_CR19","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/0165-6074(89)90128-2","volume":"27","author":"A Mok","year":"1989","unstructured":"Mok, A., Rosier, L., Tulchinksy, I., Varvel, D.: Algorithms and complexity of the periodic maintenance problem. Microprocess. Microprogr. 27(1\u20135), 657\u2013664 (1989)","journal-title":"Microprocess. Microprogr."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T23:09:07Z","timestamp":1719875347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_17","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":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","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":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}