A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times

Horst Tempelmeier and Matthias Derstroff
Additional contact information
Horst Tempelmeier: Universität zu Köln, Seminar für Allgemeine Betriebswirtschaftslehre, Industriebetriebslehre und Produktionswirtschaft, Albertus Magnus-Platz, D-50923 Braunschweig, Germany
Matthias Derstroff: Technische Universität Braunschweig, Fachgebiet Produktionswirtschaft, Braunschweig, Germany

Management Science, 1996, vol. 42, issue 5, 738-757

Abstract: In this paper a heuristic approach for the dynamic multilevel multiitem lotsizing problem in general product structures with multiple constrained resources and setup times is proposed. With the help of Lagrangean relaxation the capacitated multilevel multiitem lotsizing problem is decomposed into several uncapacitated single-item lotsizing problems. From the solutions of these single-item problems lower bounds on the minimum objective function value are derived. Upper bounds are generated by means of a heuristic finite scheduling procedure. The quality of the approach is tested with reference to various problem groups of differing sizes.

Keywords: production planning; MRP; capacity constraints; multilevel lotsizing; setup times (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (55)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.42.5.738 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:42:y:1996:i:5:p:738-757

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().