IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v42y1996i5p738-757.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Horst Tempelmeier & Matthias Derstroff, 1996. "A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times," Management Science, INFORMS, vol. 42(5), pages 738-757, May.
    • Handle: RePEc:inm:ormnsc:v:42:y:1996:i:5:p:738-757
    DOI: 10.1287/mnsc.42.5.738
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.42.5.738
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.42.5.738?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:42:y:1996:i:5:p:738-757. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.