MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

作     者：Absi, Nabil Kedad-Sidhoum, Safia 

作者机构：Lab LIP6 F-75252 Paris 05 France Dynasys SA F-67300 Schiltigheim France 

出 版 物：《RAIRO-OPERATIONS RESEARCH》 (RAIRO Oper. Res.)

年 卷 期：2007年第41卷第2期

页      面：171-192页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

主　　题：lot-sizing setup time shortage cost safety stock de. cit production planning mixed integer programming heuristic 

摘      要：We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported.