Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142766 | Operations Research Letters | 2009 | 5 Pages |
Abstract
This paper proposes a simple heuristic that generates a solution for echelon (r,nQ,T)(r,nQ,T) policies by sequentially solving a deterministic demand problem, a subproblem with fixed reorder intervals, and a subproblem with fixed batch sizes. For each of these problems, we further simplify the computation by solving a series of single-stage systems whose parameters are obtained directly from the original problem data. In a numerical study, we find that this heuristic outperforms an existing one in the literature.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kevin H. Shang, Sean X. Zhou,