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

Capacitated Lot Sizing with Setup Times

  • William W. Trigeiro

    (Systems and Technology Research, 10805 Parkridge Boulevard, Reston, Virginia 22091)

  • L. Joseph Thomas

    (Johnson Graduate School of Management, Cornell University, Ithaca, New York 14853)

  • John O. McClain

    (Johnson Graduate School of Management, Cornell University, Ithaca, New York 14853)

Registered author(s):

    This research focuses on the effect of setup time on lot sizing. The setting is the Capacitated Lot Sizing Problem (the single-machine lot sizing problem) with nonstationary costs, demands, and setup times. A Lagrangian relaxation of the capacity constraints of CLSP allows it to be decomposed into a set of uncapacitated single product lot sizing problems. The Lagrangian dual costs are updated by subgradient optimization, and the single-item problems are solved by dynamic programming. A heuristic smoothing procedure constructs feasible solutions (production plans) which do not require overtime. The algorithm solves problems with setup time or setup cost. Problems with extremely tightly binding capacity constraints were much more difficult to solve than anticipated. Solutions without overtime could not always be found for them. The most significant results are that (1) the tightness of the capacity constraint is a good indicator of problem difficulty for problems with setup time; and (2) the algorithm solves larger problems better than smaller problems, although they are more time consuming to solve. This indicates that larger problems may be easier despite the greater computational effort they require.

    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.35.3.353
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 35 (1989)
    Issue (Month): 3 (March)
    Pages: 353-366

    as
    in new window

    Handle: RePEc:inm:ormnsc:v:35:y:1989:i:3:p:353-366
    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:35:y:1989:i:3:p:353-366. 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.