A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs

In this paper we study a class of multi-item lot-sizing problems with dynamic demands, as well as lower and upper bounds on a shared resource with a piecewise linear cost. The shared resource might be supply, production or transportation capacity. The model is particularly applicable to problems wit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of production economics 2006-08, Vol.102 (2), p.344-357
Hauptverfasser:	Rizk, Nafee, Martel, Alain, Ramudhin, Amar
Format:	Artikel
Sprache:	eng
Schlagworte:	Discounts Dynamic demand Heuristic Integer programming Lagrangean relaxation Mixed integer programming Multi-item lot-sizing Optimization Piecewise linear costs Purchasing Studies Supply chains
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!