Polynomial time algorithms for the Minimax Regret Uncapacitated Lot Sizing Model

We study the Minimax Regret Uncapacitated Lot Sizing (MRULS) model, where the production cost function and the demand are subject to uncertainty. We propose a polynomial time algorithm which solves the MRULS model in O(n^6) time. We improve this running time to O(n^5) when only the demand is uncertain, and to O(n^4) when only the production cost function is uncertain.

Citation

Said Business School, University of Oxford, Park End Street, Oxford, OX1 1HP, United Kingdom, 2013

Article

Download

View Polynomial time algorithms for the Minimax Regret Uncapacitated Lot Sizing Model