IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems

  • Panayotis Afentakis

    (Syracuse University)

  • Bezalel Gavish

    (University of Rochester)

  • Uday Karmarkar

    (University of Rochester)

Registered author(s):

    The scheduling of lot sizes in multistage production environments is a fundamental problem in many Material Requirements Planning Systems. Many heuristics have been suggested for this problem with varying degrees of success. Research to date on obtaining optimal solutions has been limited to small problems. This paper presents a new formulation of the lot-sizing problem in multistage assembly systems which leads to an effective optimization algorithm for the problem. The problem is reformulated in terms of "echelon stock" which simplifies its decomposition by a Lagrangean relaxation method. A Branch and Bound algorithm which uses the bounds obtained by the relaxation was developed and tested. Computational results are reported on 120 randomly generated problems involving up to 50 items in 15 stages and up to 18 time periods in the planning horizon.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://dx.doi.org/10.1287/mnsc.30.2.222
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 30 (1984)
    Issue (Month): 2 (February)
    Pages: 222-239

    as
    in new window

    Handle: RePEc:inm:ormnsc:v:30:y:1984:i:2:p:222-239
    Contact details of provider: Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page: http://www.informs.org/
    Email:


    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:2:p:222-239. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.