An incremental cost and resource smoothing heuristic for the capacitated lot sizing problem

An incremental cost and resource smoothing heuristic for the capacitated lot sizing problem

A heuristic lot sizing algorithm is proposed for the multi-item, multi-period problem with limited resources. The objective is to minimize the total cost consisting of set-up and inventory holding costs. The performance of the heuristic algorithm is compared with four existing heuristics.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering 1991, Vol.20 (4), p.469-474
Hauptverfasser: Singh, N., Rajamani, Divakar
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Comparative studies
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
Heuristic
Material requirements planning
Mathematical models
Process control. Computer integrated manufacturing
Production capacity
Production costs
Production scheduling
Statistical analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A heuristic lot sizing algorithm is proposed for the multi-item, multi-period problem with limited resources. The objective is to minimize the total cost consisting of set-up and inventory holding costs. The performance of the heuristic algorithm is compared with four existing heuristics.
ISSN:0360-8352
1879-0550
DOI:10.1016/0360-8352(91)90019-3