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

A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times

Author

Listed:
  • Dirk Cattrysse

    (Katholieke Universiteit Leuven, IB, Celestijnenlaan 300A, B-3001 Leuven-Heverlee, Belgium)

  • Marc Salomon

    (Rotterdam School of Management, Erasmus University, P.O. Box 1738, NL-3000 DR Rotterdam, The Netherlands)

  • Roelof Kuik

    (Rotterdam School of Management, Erasmus University, P.O. Box 1738, NL-3000 DR Rotterdam, The Netherlands)

  • Luk N. Van Wassenhove

    (INSEAD, Boulevard de Constance, F-17305 Fontainebleau Cedex, France)

Abstract

In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) with setup times is considered. DLSP is the problem of determining the sequence and size of production batches for multiple items on a single machine. The objective is to find a minimal cost production schedule such that dynamic demand is fulfilled without backlogging. DLSP is formulated as a Set Partitioning Problem (SPP). We present a dual ascent and column generation heuristic to solve SPP. The quality of the solutions can be measured, since the heuristic generates lower and upper bounds. Computational results on a personal computer show that the heuristic is rather effective, both in terms of quality of the solutions as well as in terms of required memory and computation time.

Suggested Citation

  • Dirk Cattrysse & Marc Salomon & Roelof Kuik & Luk N. Van Wassenhove, 1993. "A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times," Management Science, INFORMS, vol. 39(4), pages 477-486, April.
    • Handle: RePEc:inm:ormnsc:v:39:y:1993:i:4:p:477-486
    DOI: 10.1287/mnsc.39.4.477
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.39.4.477
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.39.4.477?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:39:y:1993:i:4:p:477-486. 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.