[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v28y1982i10p1174-1186.html
   My bibliography  Save this article

Computational Complexity of the Capacitated Lot Size Problem

Author

Listed:
  • Gabriel R. Bitran

    (Massachusetts Institute of Technology)

  • Horacio H. Yanasse

    (Institute Nacional de Pesquisas Espaciais, Brazil)

Abstract
In this paper we study the computational complexity of the capacitated lot size problem with a particular cost structure that is likely to be used in practical settings. For the single item case new properties are introduced, classes of problems solvable by polynomial time algorithms are identified, and efficient solution procedures are given. We show that special classes are NP-hard, and that the problem with two items and independent setups is NP-hard under conditions similar to those where the single item problem is easy. Topics for further research are discussed in the last section.

Suggested Citation

  • Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:10:p:1174-1186
    DOI: 10.1287/mnsc.28.10.1174
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.10.1174
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.28.10.1174?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:28:y:1982:i:10:p:1174-1186. 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.