Single item lot sizing problems

Abstract : A state-of-the-art of a particular planning problem, the Single Item Lot Sizing Problem (SILSP), is given for its uncapacitated and capacitated versions. First classes of lot sizing problems are briefly surveyed. Various solution methods for the Uncapacitated Single Item Lot Sizing Problem (USILSP) are reviewed. Four different mathematical programming formulations of the classical problem are presented. Different extensions for real-world applications of this problem are discussed. Complexity results of the Capacitated Single Item Lot Sizing Problem (CSILSP) are given together with its different formulations and solution techniques.
Document type :
Journal articles
Complete list of metadatas

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

Identifiers

  • HAL Id : hal-00468355, version 1

Citation

Nadjib Brahimi, Stéphane Dauzère-Pérès, Mohamed Najib Najid, Atle Nordli. Single item lot sizing problems. European Journal of Operational Research, Elsevier, 2006, 168, pp.1-16. ⟨hal-00468355⟩

Share

Metrics

Record views

444