Heuristics for the multi-item capacitated lot-sizing problem with lost sales - Mines Saint-Étienne Access content directly
Journal Articles Computers and Operations Research Year : 2013

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

Abstract

This paper deals with the Multi-item Capacitated Lot-Sizing problem with setup times and lost sales. Because of lost sales, demands can be partially or totally lost. To find a good lower bound, we use a Lagrangian relaxation of the capacity constraints, when single-item uncapacitated lot-sizing problems with lost sales have to be solved. Each subproblem is solved using an adaptation of the O(T^2) dynamic programming algorithm of Aksen et al. [5]. To find feasible solutions, we propose a non-myopic heuristic based on a probing strategy and a refining procedure. We also propose a metaheuristic based on the adaptive large neighborhood search principle to improve solutions. Some computational experiments showing the effectiveness and limitation of each approach are presented.

Dates and versions

emse-00733895 , version 1 (20-09-2012)

Identifiers

Cite

Nabil Absi, Boris Detienne, Stéphane Dauzère-Pérès. Heuristics for the multi-item capacitated lot-sizing problem with lost sales. Computers and Operations Research, 2013, 40 (1), pp.264-272. ⟨10.1016/j.cor.2012.06.010⟩. ⟨emse-00733895⟩
180 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More