Approximation algorithms for replenishment problems with fixed turnover times
From MaRDI portal
Recommendations
- Approximation algorithms for replenishment problems with fixed turnover times
- Better Approximation Bounds for the Joint Replenishment Problem
- Online inventory replenishment scheduling of temporary orders
- A fully polynomial time approximation scheme for the replenishment storage problem
- Replenishment routing problems between a single supplier and multiple retailers with direct delivery
Cites work
- A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A tight bound on approximating arbitrary metrics by tree metrics
- Approximation algorithms for replenishment problems with fixed turnover times
- Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
- Charlemagne's Challenge: The Periodic Latency Problem
- Complexity of inventory routing problems when routing is easy
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Cutting bamboo down to size
- Exponential Time Complexity of the Permanent and the Tutte Polynomial
- scientific article; zbMATH DE number 17808 (Why is no real title available?)
- Patrolling a path connecting a set of points with unbalanced frequencies of visits
- Pinwheel scheduling: Achievable densities
- Schedulability analysis of a graph-based task model for mixed-criticality systems
- Schedulers for larger classes of pinwheel instances
- Scheduling periodic tasks in a hard real-time environment
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
- Two Robots Patrolling on a Line: Integer Version and Approximability
Cited in
(4)
This page was built for publication: Approximation algorithms for replenishment problems with fixed turnover times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918783)
