{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T10:27:48Z","timestamp":1777026468433,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1016\/j.orl.2021.07.001","type":"journal-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T11:32:23Z","timestamp":1625830343000},"page":"645-649","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["A 12\/7-approximation algorithm for the discrete Bamboo Garden Trimming problem"],"prefix":"10.1016","volume":"49","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-7724-8990","authenticated-orcid":false,"given":"Martijn","family":"van Ee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.orl.2021.07.001_br0010","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.21908","article-title":"Complexity of inventory routing problems when routing is easy","volume":"75","author":"Baller","year":"2020","journal-title":"Networks"},{"key":"10.1016\/j.orl.2021.07.001_br0020","series-title":"10th International Conference on Fun with Algorithms (FUN 2021)","first-page":"5:1","article-title":"Cutting bamboo down to size","volume":"vol. 157","author":"Bil\u00f2","year":"2020"},{"key":"10.1016\/j.orl.2021.07.001_br0030","series-title":"LATIN 2018: Theoretical Informatics","first-page":"217","article-title":"Approximation algorithms for replenishment problems with fixed turnover times","volume":"vol. 10807","author":"Bosman","year":"2018"},{"issue":"6","key":"10.1016\/j.orl.2021.07.001_br0040","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1109\/12.144627","article-title":"General schedulers for the pinwheel problem based on double-integer reduction","volume":"41","author":"Chan","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/j.orl.2021.07.001_br0050","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01187034","article-title":"Schedulers for larger classes of pinwheel instances","volume":"9","author":"Chan","year":"1993","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.orl.2021.07.001_br0060","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/opre.1110.0919","article-title":"Charlemagne's challenge: the periodic latency problem","volume":"59","author":"Coene","year":"2011","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2021.07.001_br0070","author":"Della Croce"},{"key":"10.1016\/j.orl.2021.07.001_br0080","author":"van Ee"},{"issue":"1","key":"10.1016\/j.orl.2021.07.001_br0090","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s00453-002-0938-9","article-title":"Pinwheel scheduling: achievable densities","volume":"34","author":"Fishburn","year":"2002","journal-title":"Algorithmica"},{"key":"10.1016\/j.orl.2021.07.001_br0100","series-title":"SOFSEM","first-page":"229","article-title":"Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)","author":"Gasieniec","year":"2017"},{"key":"10.1016\/j.orl.2021.07.001_br0110","series-title":"Proceedings of the 22th Annual Hawaii International Conference on System Sciences, vol. 2","first-page":"693","article-title":"The pinwheel: a real-time scheduling problem","author":"Holte","year":"1989"},{"key":"10.1016\/j.orl.2021.07.001_br0120","author":"Jacobs"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637721001036?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637721001036?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T22:36:14Z","timestamp":1759098974000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637721001036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["S0167637721001036"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2021.07.001","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A 12\/7-approximation algorithm for the discrete Bamboo Garden Trimming problem","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2021.07.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}