Approximation algorithms for stochastic inventory control models

Authors:
Retsef Levi;Martin Pál;Robin Roundy;David B. Shmoys
Affiliations:
School of ORIE, Cornell University, Ithaca, NY;DIMACS Center, Rutgers University, Piscataway, NJ;School of ORIE, Cornell University, Ithaca, NY;School of ORIE and Department of Computer Science, Cornell University, Ithaca, NY
Venue:
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Year:
2005

Citing 9
Cited 4

Optimal centralized ordering policies in multi-echelon inventory systems with correlated demands

Management Science
Simple solution procedures for a class of two-echelon inventory problems

Operations Research
Approximation in stochastic scheduling: the power of LP-based priority policies

Journal of the ACM (JACM)
Integrating Replenishment Decisions with Advance Demand Information

Management Science
The Value of Information Sharing in a Two-Level Supply Chain

Management Science
Optimal Policies and Approximations for a Serial Multiechelon Inventory System with Time-Correlated Demand

Operations Research
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Stochastic Optimization is (Almost) as easy as Deterministic Optimization

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Inventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds

Operations Research

Approximation algorithms for 2-stage stochastic optimization problems

ACM SIGACT News
Inventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds

Operations Research
Approximation algorithms for restless bandit problems

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Multiresource Allocation Scheduling in Dynamic Environments

Manufacturing & Service Operations Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider stochastic control inventory models in which the goal is to coordinate a sequence of orders of a single commodity, aiming to supply stochastic demands over a discrete finite horizon with minimum expected overall ordering, holding and backlogging costs. In particular, we consider the periodic-review stochastic inventory control problem and the stochastic lot-sizing problem in the case where demands over time are correlated and non-stationary (time-dependent). In these cases, it is usually very hard to compute the optimal policy. We provide what we believe to be the first computationally efficient policies with constant worst-case performance guarantees. More specifically, we provide a general 2-approximation algorithm for the periodic-review stochastic inventory control problem and a 3-approximation algorithm for the stochastic lot-sizing problem. Our approach is based on several novel ideas: we present a new (marginal) cost accounting for stochastic inventory models; we use cost-balancing techniques; and we consider non base-stock (order-up-to) policies that are extremely easy to implement on-line. Our results are valid for all of the currently known approaches in the literature to model correlation and non-stationarity of demands over time.