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

被引：32

作者：

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

共 50 条

[41] The uncapacitated lot-sizing problem with sales and safety stocks
Marko Loparic
Yves Pochet
Laurence A. Wolsey
[J]. Mathematical Programming, 2001, 89 : 487 - 504
[42] LOT-SIZING IN MULTI-ITEM MULTI-MACHINE JOB SHOPS
KARMARKAR, US
KEKRE, S
KEKRE, S
[J]. IIE TRANSACTIONS, 1985, 17 (03) : 290 - 298
[43] The uncapacitated lot-sizing problem with sales and safety stocks
Loparic, M
Pochet, Y
Wolsey, LA
[J]. MATHEMATICAL PROGRAMMING, 2001, 89 (03) : 487 - 504
[44] Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities
Gutierrez, J.
Colebrook, M.
Abdul-Jalbar, B.
Sicilia, J.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) : 2844 - 2851
[45] Analysis of bounds for a capacitated single-item lot-sizing problem
Hardin, Jill R.
Nemhauser, George L.
Savelsbergh, Martin W. P.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (06) : 1721 - 1743
[46] Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
Narenji, M.
Ghomi, S. M. T. Fatemi
Nooraie, S. V. R.
[J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2011, 42 (03) : 489 - 498
[47] A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
Sambasivan, M
Schmidt, CP
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2002, 19 (01) : 87 - 105
[48] Compiling capacitated single-item lot-sizing problem in a CostMDD
Khellaf, Walid
Guillaume, Romain
Lamothe, Jacques
[J]. IFAC PAPERSONLINE, 2022, 55 (10): : 2024 - 2029
[49] Capacitated lot-sizing problem with outsourcing
Zhang, Minjiao
[J]. OPERATIONS RESEARCH LETTERS, 2015, 43 (05) : 479 - 483
[50] Solving Multi-item Multi-period Capacitated Lot Sizing Problem with Considerations of Backorders and Setups
Verma, Mayank
Sharma, R. R. K.
[J]. 2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 4, 2010, : 18 - 22

← 1 2 3 4 5 →