Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty |
| |
| Authors: | Muhong Zhang |
| |
| Affiliation: | aSchool of Computing, Informatics and Decision Systems Engineering, Arizona State University, PO Box 878809 Tempe, AZ 85287-8809, USA |
| |
| Abstract: | 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. |
| |
| Keywords: | Lot-sizing Minimax regret Mixed integer programming Robust optimization |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
