Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty

In this paper, we consider the two-stage minimax robust uncapacitated lot-sizing problem with interval uncertain demands. A mixed integer programming formulation is proposed. Even though the robust uncapacitated lot-sizing problem with discrete scenarios is an NP-hard problem, we show that it is polynomial solvable under the interval uncertain demand set. (C) 2011 Elsevier B.V. All rights reserved.