Multidimensional Approximation Algorithms for Capacity‐Expansion Problems

Multidimensional Approximation Algorithms for Capacity‐Expansion Problems

0.00 Avg rating0 Votes
Article ID: iaor20115732
Volume: 59
Issue: 2
Start Page Number: 313
End Page Number: 327
Publication Date: Mar 2011
Journal: Operations Research
Authors: ,
Keywords: capacity expansion, approximation algorithms
Abstract:

We develop multidimensional balancing algorithms to compute provably near‐optimal capacity‐expansion policies. Our approach is computationally efficient and guaranteed to produce a policy with total expected cost of no more than twice that of an optimal policy. We overcome the curse of dimensionality by introducing novel cost‐separation schemes to separate the lost‐sales cost of the system into exact monotonic subparts. This is the first approximation technique for multimachine, multiproduct systems facing stochastic, nonstationary, and correlated demands. To show the generality of this separation technique, we apply it to the capacity‐expansion problem under two different production planning models: monotone production and revenue‐maximizing production. We make the assumptions of minimal inventory and lost sales.

Reviews

Required fields are marked *. Your email address will not be published.