Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482832 | European Journal of Operational Research | 2006 | 16 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Nadjib Brahimi, Stéphane Dauzere-Peres, Najib M. Najid, Atle Nordli,