{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:41Z","timestamp":1770921401111,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_46","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:10Z","timestamp":1770918790000},"page":"634-647","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Limitations of\u00a0Density-Based Heuristics and\u00a0an\u00a0Alternative Approach for\u00a0Pinwheel Scheduling with\u00a0Durations"],"prefix":"10.1007","author":[{"given":"Yosuke","family":"Kusano","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"4","key":"46_CR1","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1137\/S009753970240447X","volume":"32","author":"A Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SIAM J. Comput. 32(4), 1091\u20131113 (2003). https:\/\/doi.org\/10.1137\/S009753970240447X","journal-title":"SIAM J. Comput."},{"key":"46_CR2","doi-asserted-by":"publisher","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms 3(3), 28\u2013es (2007). https:\/\/doi.org\/10.1145\/1273340.1273344","DOI":"10.1145\/1273340.1273344"},{"issue":"9","key":"46_CR3","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1007\/s00453-022-00974-4","volume":"84","author":"T Bosman","year":"2022","unstructured":"Bosman, T., van Ee, M., Jiao, Y., Marchetti-Spaccamela, A., Ravi, R., Stougie, L.: Approximation algorithms for replenishment problems with fixed turnover times. Algorithmica 84(9), 2597\u20132621 (2022). https:\/\/doi.org\/10.1007\/s00453-022-00974-4","journal-title":"Algorithmica"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF01187034","volume":"9","author":"M Chan","year":"1993","unstructured":"Chan, M., Chin, F.: Schedulers for larger classes of pinwheel instances. Algorithmica 9, 425\u2013462 (1993). https:\/\/doi.org\/10.1007\/BF01187034","journal-title":"Algorithmica"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-031-92935-9_21","volume-title":"Algorithms and Complexity","author":"W Evans","year":"2025","unstructured":"Evans, W., Tabatabaee, S.A.: Perpetual scheduling with explorable uncertainty. In: Finocchi, I., Georgiadis, L. (eds.) Algorithms and Complexity, pp. 331\u2013344. Springer Nature Switzerland, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-92935-9_21"},{"key":"46_CR6","doi-asserted-by":"publisher","unstructured":"Feinberg, E., Curry, M.: Generalized pinwheel problem. Math. Methods Oper. Res. 62, 99\u2013122 (2005). https:\/\/doi.org\/10.1007\/s00186-005-0443-4","DOI":"10.1007\/s00186-005-0443-4"},{"key":"46_CR7","doi-asserted-by":"publisher","unstructured":"Feinberg, E.A., Bender, M.A., Curry, M.T., Huang, D., Koutsoudis, T., Bernstein, J.L.: Sensor resource management for an airborne early warning radar. In: Drummond, O.E. (ed.) Signal and Data Processing of Small Targets 2002. vol.\u00a04728, pp. 145 \u2013 156. International Society for Optics and Photonics, SPIE (2002). https:\/\/doi.org\/10.1117\/12.478500","DOI":"10.1117\/12.478500"},{"key":"46_CR8","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-51963-0_18"},{"key":"46_CR9","doi-asserted-by":"publisher","unstructured":"G\u0105sieniec, L., et al.: Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139, 103476 (2024). https:\/\/doi.org\/10.1016\/j.jcss.2023.103476","DOI":"10.1016\/j.jcss.2023.103476"},{"key":"46_CR10","doi-asserted-by":"publisher","unstructured":"H\u00f6hne, F., van Stee, R.: A 10\/7-Approximation for discrete bamboo garden trimming and continuous trimming on star graphs. In: Megow, N., Smith, A. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0275, pp. 16:1\u201316:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2023.16","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2023.16"},{"key":"46_CR11","doi-asserted-by":"publisher","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: a real-time scheduling problem. In: [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track. vol.\u00a02, pp. 693\u2013702 (1989). https:\/\/doi.org\/10.1109\/HICSS.1989.48075","DOI":"10.1109\/HICSS.1989.48075"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Kanellopoulos, S., Pergaminelis, C., Kokkou, M., Markou, E., Pagourtzis, A.: Finite pinwheel scheduling: the k-visits problem (2025). https:\/\/arxiv.org\/abs\/2507.11681","DOI":"10.1137\/1.9781611978971.16"},{"key":"46_CR13","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer US, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"46_CR14","doi-asserted-by":"publisher","unstructured":"Kawamura, A.: Proof of the density threshold conjecture for pinwheel scheduling. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 1816\u20131819. STOC 2024, Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3618260.3649757","DOI":"10.1145\/3618260.3649757"},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-031-92935-9_12","volume-title":"Algorithms and Complexity","author":"A Kawamura","year":"2025","unstructured":"Kawamura, A., Kobayashi, Y., Kusano, Y.: Pinwheel covering. In: Finocchi, I., Georgiadis, L. (eds.) Algorithms and Complexity, pp. 185\u2013199. Springer Nature Switzerland, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-92935-9_12"},{"key":"46_CR16","doi-asserted-by":"publisher","unstructured":"Kuszmaul, J.: Bamboo trimming revisited: simple algorithms can do well too. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 411\u2013417. SPAA \u201922, Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3490148.3538580","DOI":"10.1145\/3490148.3538580"},{"key":"46_CR17","doi-asserted-by":"publisher","unstructured":"Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: Algorithms and complexity of the periodic maintenance problem. Microprocess. Microprogram. 27(1), 657\u2013664 (1989). https:\/\/doi.org\/10.1016\/0165-6074(89)90128-2","DOI":"10.1016\/0165-6074(89)90128-2"},{"issue":"5","key":"46_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., Lenstra, J.K.: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is np-hard. J. of Scheduling 7(5), 333\u2013348 (2004). https:\/\/doi.org\/10.1023\/B:JOSH.0000036858.59787.c2","journal-title":"J. of Scheduling"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:12Z","timestamp":1770918792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}