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

Deterministic Production Planning: Algorithms and Complexity

Author

Listed:
  • M. Florian

    (Université de Montréal)

  • J. K. Lenstra

    (Mathematisch Centrum, Amsterdam)

  • A. H. G. Rinnooy Kan

    (Erasmus University, Rotterdam)

Abstract

A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he subject to capacity limits. The computational complexity of the problems in this class is investigated. Several algorithms proposed for their solution are described and analyzed. It is also shown that some special cases are NP-hard and hence unlikely to be solvable in polynomial time.

Suggested Citation

  • M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    • Handle: RePEc:inm:ormnsc:v:26:y:1980:i:7:p:669-679
    DOI: 10.1287/mnsc.26.7.669
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.26.7.669
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.26.7.669?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:26:y:1980:i:7:p:669-679. 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.