Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems (original) (raw)
Related papers
On formulations of the stochastic uncapacitated lot-sizing problem
Operations Research Letters, 2006
We consider two formulations of a stochastic uncapacitated lot-sizing problem. We show that by adding ( , S) inequalities to the one with the smaller number of variables, both formulations give the same LP bound. Then we show that for two-period problems, adding another class of inequalities gives the convex hull of integral solutions.
Dynamic lot sizing problem with continuous-time Markovian production cost
International Journal of Production Economics, 2009
This paper develops a polynomial algorithm for obtaining dynamic economic lot sizes in a single product multiperiod production system with the objective of minimizing total production and inventory costs over T periods. It is assumed that production costs are linear, inventory costs are concave, setup costs are zero and backlogging is not permitted in all periods. Moreover, the unit production cost is a stochastic variable, which is evolved according to a continuous-time Markov process over the planning horizon. The model is formulated as a stochastic dynamic programming (DP) optimization with the state variable being unit production cost. Then, it is solved using the backward dynamic programming approach. To justify the application of the proposed model, two practical cases are presented.
An algorithm for lot sizing with inventory bounds and fixed costs
Operations Research Letters, 2008
We present an O(n 2 ) dynamic programming algorithm for lot sizing with inventory bounds and fixed costs, where n is the number of time periods. The algorithm utilizes a hierarchy of two layers of value functions and improves the complexity bound of an earlier O(n 3 ) algorithm for concave-cost and bounded inventory.
Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
In this paper, we study the stochastic version of lot-sizing problems with inventory bounds and order capacities. Customer demands, inventory bounds, and costs are subject to uncertainty and dependent with each other throughout the finite planning horizon. Two models in stochastic programming are developed: the first one has inventory-bound constraints, and the second one has both inventory-bound and order-capacity constraints. We explore structural properties of the two models and develop Oðn 2 Þ and Oðn 2 T log nÞ dynamic programming algorithms for them, respectively. Our model also generalizes the deterministic lot-sizing problem with inventory bounds. For some cases, when applied to the deterministic versions, our algorithms outperform existing deterministic algorithms.
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Mathematical Programming, 2006
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalities for the deterministic lot-sizing polytope are also valid for the stochastic lot-sizing polytope. We then extend the ( , S) inequalities to a general class of valid inequalities, called the (Q, S Q ) inequalities, and we establish necessary and sufficient conditions which guarantee that the (Q, S Q ) inequalities are facet-defining. A separation heuristic for (Q, S Q ) inequalities is developed and incorporated into a branch-and-cut algorithm. A computational study verifies the usefulness of the (Q, S Q ) inequalities as cuts.
A note on solving the concave cost dynamic lot-sizing problem in almost linear time
Journal of Operations Management, 1989
The heavilydebated Wagner-Whitin algorithm is known to produce optimal ordering policies for minimal-cost dynamic lot--sizing problems. In an earlier paper in this journal, Evans showed that the Wagner-Whitin algorithm is essentially a shortest path computation on an acyclic network, and presented a simple O(n2) computer implementation with low storage requirements.
Stochastic lot-sizing problem with deterministic demands and Wagner–Whitin costs
In this paper, we consider a two-stage stochastic uncapacitated lot-sizing problem with deterministic demands and Wagner-Whitin costs. We develop an extended formulation in the higher dimensional space that provides integral solutions by showing that its constraint matrix is totally unimodular. We also provide the integral polyhedron of the problem in the original space by projecting the extended formulation to the original space.
2013
We consider the multilevel lot-sizing problem with production capacities (MLSP-PC), in which production and transportation decisions are made for a serial supply chain with capacitated production and concave cost functions. Existing approaches to the multistage version of this problem are limited to nonspeculative cost functions—up to now, no algorithm for the multistage version of this model with general concave cost functions has been developed. In this paper, we develop the first polynomial algorithm for the MLSP-PC with general concave costs at all of the stages, and we introduce a novel approach to overcome the limitations of previous approaches. In contrast to traditional approaches to lot-sizing problems, in which the problem is decomposed by time periods and is analyzed unidirectionally in time, we solve the problem by introducing the concept of a basis path, which is characterized by time and stage. Our dynamic programming algorithm proceeds both forward and backward in tim...