Approximation algorithms for replenishment problems with fixed turnover times
From MaRDI portal
Publication:5918783
DOI10.1007/s00453-022-00974-4OpenAlexW4390800053MaRDI QIDQ5918783
Thomas Bosman, Martijn van Ee, R. Ravi, Leen Stougie, Alberto Marchetti-Spaccamela, Yang Jiao
Publication date: 18 August 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://inria.hal.science/hal-03832879
approximation algorithminventory routingperiodic maintenancepinwheel schedulingreplenishment problem
Related Items (1)
Cites Work
- Unnamed Item
- Schedulability analysis of a graph-based task model for mixed-criticality systems
- Feasibility analysis of sporadic real-time multiprocessor task systems
- Pinwheel scheduling: Achievable densities
- A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
- Schedulers for larger classes of pinwheel instances
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
- Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
- Charlemagne's Challenge: The Periodic Latency Problem
- Scheduling Periodic Tasks in a Hard Real-Time Environment
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Exponential Time Complexity of the Permanent and the Tutte Polynomial
- Two Robots Patrolling on a Line: Integer Version and Approximability
- Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
- A tight bound on approximating arbitrary metrics by tree metrics
- Approximation algorithms for replenishment problems with fixed turnover times
- Complexity of inventory routing problems when routing is easy
This page was built for publication: Approximation algorithms for replenishment problems with fixed turnover times
