Computers and Operations Research
An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization
Transportation Science
ESA'11 Proceedings of the 19th European conference on Algorithms
An efficient polynomial-time approximation scheme for the joint replenishment problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We study the classical multistage lot sizing problem that arises in distribution and inventory systems. A celebrated result in this area is the 94% and 98% approximation guarantee provided by power-of-two policies. In this paper, we propose a simple randomized rounding algorithm to establish these performance bounds. We use this new technique to extend several results for the capacitated lot sizing problems to the case with submodular ordering cost. For the joint replenishment problem under a fixed base period model, we construct a 95.8% approximation algorithm to the (possibly dynamic) optimal lot sizing policy. The policies constructed are stationary but not necessarily of the power-of-two type. This shows that for the fixed based planning model, the class of stationary policies is within 95.8% of the optimum, improving on the previously best known 94% approximation guarantee.