A 12/7-approximation algorithm for the discrete bamboo garden trimming problem

DOI10.1016/j.orl.2021.07.001OpenAlexW3181683098MaRDI QIDQ2060339

Martijn van Ee

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.11731

zbMATH Keywords

approximation algorithmspinwheel schedulingbamboo garden trimming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Perpetual maintenance of machines with different urgency requirements ⋮ Approximation algorithms for replenishment problems with fixed turnover times ⋮ A 12/7-approximation algorithm for the discrete bamboo garden trimming problem ⋮ Cutting bamboo down to size

Cites Work

• Pinwheel scheduling: Achievable densities
• A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
• Schedulers for larger classes of pinwheel instances
• Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
• Charlemagne's Challenge: The Periodic Latency Problem
• Approximation algorithms for replenishment problems with fixed turnover times
• Complexity of inventory routing problems when routing is easy

This page was built for publication: A 12/7-approximation algorithm for the discrete bamboo garden trimming problem