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

Authors:
Nabil Absi;Safia Kedad-Sidhoum
Affiliations:
Ecole des Mines de Saint-Etienne, CMP - Site Georges Charpak, 880 Avenue de Mimet, F-13541 Gardanne, France;Laboratoire d'Informatique de Paris 6, 4 place Jussieu, 75 252 Paris Cedex 05, France
Venue:
Computers and Operations Research
Year:
2009

Citing 12
Cited 3

Capacitated lot sizing with setup times

Management Science
Analysis of relaxations for the multi-item capacitated lot-sizing problem

Annals of Operations Research
A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
A faster strongly polynomial minimum cost flow algorithm

Operations Research
Improved algorithms for economic lot size problems

Operations Research
A Lagrange relaxation approach for very-large-scale capacitated lot-sizing

Management Science
Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs

Operations Research
Loss of customer goodwill in the uncapacitated lot-sizing problem

Computers and Operations Research
Capacitated Multi-Item Lot-Sizing Problems with Time Windows

Operations Research
Dynamic Version of the Economic Lot Size Model

Management Science
The Lagrangian Relaxation Method for Solving Integer Programming Problems

Management Science

Heuristics for the multi-item capacitated lot-sizing problem with lost sales

Computers and Operations Research
Dynamic capacitated lot sizing with random demand and dynamic safety stocks

OR Spectrum
Pig procurement plan considering pig growth and size distribution

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.