APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
From MaRDI portal
Publication:3397507
DOI10.1142/S1793830909000130zbMath1186.68565MaRDI QIDQ3397507
Publication date: 22 September 2009
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Analysis of algorithms (68W40) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)
Related Items
Combinatorial Heuristics for Inventory Routing Problems ⋮ Caching with Time Windows and Delays ⋮ Approximation algorithms for the joint replenishment problem with deadlines ⋮ Online Algorithms for Multilevel Aggregation ⋮ New results on multi-level aggregation
Cites Work
- On the hardness of approximating minimum vertex cover
- Computational complexity of uncapacitated multi-echelon production planning problems
- Approximation algorithms for hitting objects with straight lines
- Algorithmic graph theory and perfect graphs
- A review of the joint replenishment problem literature: 1989--2005
- Clique partitioning of interval graphs with submodular costs on the cliques
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
