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

Some Extensions of the Discrete Lotsizing and Scheduling Problem

Author

Listed:
  • Marc Salomon

    (Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands)

  • Leo G. Kroon

    (Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands)

  • Roelof Kuik

    (Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands)

  • Luk N. Van Wassenhove

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

Abstract

In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process. This involves the sequencing and sizing of production lots for a number of different items over a discrete and finite planning horizon. Feasibility of production schedules is subject to production quantities being within bounds set by capacity. A problem classification for DLSP is introduced and results on computational complexity are derived for a number of single and parallel machine problems. Furthermore, efficient algorithms are discussed for solving special single and parallel machine variants of DLSP.

Suggested Citation

  • Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
    • Handle: RePEc:inm:ormnsc:v:37:y:1991:i:7:p:801-812
    DOI: 10.1287/mnsc.37.7.801
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.37.7.801
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.37.7.801?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:37:y:1991:i:7:p:801-812. 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.