An efficient polynomial-time approximation scheme for the joint replenishment problem

Authors:
Tim Nonner;Maxim Sviridenko
Affiliations:
IBM Research, Zurich, Switzerland;University of Warwick, UK
Venue:
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Year:
2013

Citing 9
Cited 0

A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Improved algorithms for economic lot size problems

Operations Research
Multistage Lot Sizing Problems via Randomized Rounding

Operations Research
Duality and Existence of Optimal Policies in Generalized Joint Replenishment

Mathematics of Operations Research
Primal-Dual Algorithms for Deterministic Inventory Problems

Mathematics of Operations Research
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem

Management Science
Approximation algorithms and hardness results for the joint replenishment problem with constant demands

ESA'11 Proceedings of the 19th European conference on Algorithms
A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computational complexity of uncapacitated multi-echelon production planning problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an efficient polynomial-time approximation scheme (EPTAS) for the Joint Replenishment Problem (JRP) with stationary demand. Moreover, using a similar technique, we give a PTAS for the capacitated JRP with non-stationary demand but constant size capacities.