IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v34y1986i2p237-249.html
   My bibliography  Save this article

Optimal Lot-Sizing Algorithms for Complex Product Structures

Author

Listed:
  • Panayotis Afentakis

    (Syracuse University, Syracuse, New York)

  • Bezalel Gavish

    (University of Rochester, Rochester, New York)

Abstract

Lot sizing of products that have complex bills of materials plays an important role in the efficient operations of modern manufacturing and assembly processes. In this paper we develop algorithms for optimal lot sizing of products with a complex product structure. We convert the classical formulation of the general structure problem into a simple but expanded assembly structure with additional constraints, and solve the transformed problem by a branch-and-bound based procedure. The algorithm uses a Lagrangean relaxation and subgradient optimization procedure to generate tight lower bounds on the optimal solutions. In computational experiments, a code based on this method was able to solve single end product problems with up to 40 stages in the product structure. The model is extended to handle problems with multi-end items in the product structure, but with less favorable computational results.

Suggested Citation

  • Panayotis Afentakis & Bezalel Gavish, 1986. "Optimal Lot-Sizing Algorithms for Complex Product Structures," Operations Research, INFORMS, vol. 34(2), pages 237-249, April.
    • Handle: RePEc:inm:oropre:v:34:y:1986:i:2:p:237-249
    DOI: 10.1287/opre.34.2.237
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.34.2.237
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.34.2.237?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:oropre:v:34:y:1986:i:2:p:237-249. 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.