Single item lot sizing problems

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)...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2006, Vol.168 (1), p.1-16
Main Authors: Brahimi, Nadjib, Dauzere-Peres, Stéphane, Najid, Najib M., Nordli, Atle
Format: Article
Language:English
Subjects:
Computer Science
Lot-sizing
Mathematical models
Mathematical programming
Operations Research
Planning
Production
Single item
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2004.01.054