Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)

DOI10.1007/978-3-319-51963-0_18zbMath1444.90053arXiv2202.01567OpenAlexW2568208948MaRDI QIDQ2971137

Jie Min, Tomasz Radzik, Ralf Klasing, Christos Levcopoulos, Leszek Gąsieniec, Andrzej Lingas

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Related Items (10)

Two Robots Patrolling on a Line: Integer Version and Approximability ⋮ Perpetual maintenance of machines with different urgency requirements ⋮ Bamboo garden trimming problem: priority schedulings ⋮ Buffer minimization with conflicts on a line ⋮ Approximation algorithms for replenishment problems with fixed turnover times ⋮ Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency ⋮ A 12/7-approximation algorithm for the discrete bamboo garden trimming problem ⋮ Cutting bamboo down to size ⋮ Two-agent tree evacuation ⋮ Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots

Uses Software

• PESPLib

Cites Work

• The minimum backlog problem
• On gallery watchmen in grids
• Pinwheel scheduling with two distinct numbers
• A pinwheel scheduler for three distinct numbers with a tight schedulability bound
• Pinwheel scheduling: Achievable densities
• Proportionate progress: A notion of fairness in resource allocation
• Fence patrolling by mobile agents with distinct speeds
• An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling
• Schedulers for larger classes of pinwheel instances
• Cinderella versus the Wicked Stepmother
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
• A Mathematical Model for Periodic Scheduling Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)