Capacitated Multi-Item Lot-Sizing Problems with Time Windows

Abstract : This research concerns a new family of capacitated multi-item lot-sizing problems, namely, lot-sizing problems with time windows. Two classes of the problem are analyzed and solved using different Lagrangian heuristics. Capacity constraints and a subset of time window constraints are relaxed resulting in particular single-item time window problems that are solved in polynomial time. Other relaxations leading to the classical Wagner-Whitin problem are also tested. Several smoothing heuristics are implemented and tested, and their results are compared. The gaps between lower and upper bounds for most problems are very small (less than 1%). Moreover, the proposed algorithms are robust and do not seem to be too affected when different parameters of the problem are varied.
Document type :
Journal articles
Complete list of metadatas

http://hal.univ-nantes.fr/hal-00468364
Contributor : Mohamed Najib Najid <>
Submitted on : Tuesday, March 30, 2010 - 3:56:44 PM
Last modification on : Monday, February 25, 2019 - 10:26:08 AM

Identifiers

  • HAL Id : hal-00468364, version 1

Citation

Nadjib Brahimi, Stéphane Dauzère-Pérès, Mohamed Najib Najid. Capacitated Multi-Item Lot-Sizing Problems with Time Windows. Operations Research, INFORMS, 2006, 54 (5), pp.951-967. ⟨hal-00468364⟩

Share

Metrics

Record views

294