Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143234 | Operations Research Letters | 2007 | 10 Pages |
Abstract
For the two-stage (R,nTR,nT) policy, we present an algorithm to estimate expected costs, given (R,nTR,nT), and to compute near-optimal (R,nTR,nT) values. We illustrate that the (R,nTR,nT) policy is cost-effective compared to an (r,nQ)(r,nQ) policy and to lower bounds on minimum achievable costs. We explore the impact of parameters on costs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Keli Feng, Uday S. Rao,