The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs

被引：33

作者：

Absi, Nabil ^{[1
]}

Kedad-Sidhoum, Safia ^{[2
]}

机构：

[1] Ecole Mines St Etienne, F-13541 Gardanne, France

[2] Lab Informat Paris 6, F-75252 Paris 05, France

来源：

COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 11期

关键词：

Lot-sizing; Dynamic programming; Lagrangian heuristic; Safety stocks; Shortages; SETUP TIMES; HEURISTICS; ALGORITHM; MODELS; SALES; N);

D O I：

10.1016/j.cor.2009.01.007

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We address a multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages. 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 a Lagrangian relaxation of the resource capacity constraints. We develop a dynamic programming algorithm to solve the induced sub-problems. An upper bound is also proposed using a Lagrangian heuristic with several smoothing algorithms. Some experimental results showing the effectiveness of the approach are reported. (C) 2009 Elsevier Ltd. All rights reserved.

引用

页码：2926 / 2936

页数：11

共 27 条

[1]

ABSI N, 2005, THESIS U P M CURIE P

[2] The multi-item capacitated lot-sizing problem with setup times and shortage costs [J].