IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v7y2010i1p90-108.html
   My bibliography  Save this article

An improved heuristic for the Capacitated Lot-Sizing problem

Author

Listed:
  • Manu S. Madan
  • C.H. Cheng
  • Eric Yip
  • Jaideep Motwani

Abstract

In this research, we present a heuristic for the Capacitated Lot-Sizing (CLS) problem without set-up time considerations and no backordering option. The CLS problem is formulated as a mixed integer-programming problem with an underlying fixed charge transportation problem structure. This formulation is flexible enough to handle different types of production capacity such as regular time capacity, overtime capacity and subcontracting. A heuristic that exploits the fixed charge transportation structure and trade-offs involved in lot-sizing decisions is developed for the problem. We also present a new Lower Bound Procedure for the multi-item CLS problems. We demonstrate the performance of the heuristic over a variety of test problems. The heuristic is evaluated by comparing the solution values to the lower bound values as well as to the solution values from another algorithm for similar problems.

Suggested Citation

  • Manu S. Madan & C.H. Cheng & Eric Yip & Jaideep Motwani, 2010. "An improved heuristic for the Capacitated Lot-Sizing problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 7(1), pages 90-108.
    • Handle: RePEc:ids:ijores:v:7:y:2010:i:1:p:90-108
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=29519
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijores:v:7:y:2010:i:1:p:90-108. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.