IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1994027.html
   My bibliography  Save this paper

Algorithms and Reformulations for Lot Sizing Problems

Author

Listed:
  • POCHET, Yves

    (CORE and IAG, Université catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium)

  • WOLSEY , Laurence

    (CORE and FSA, Université catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium)

Abstract

In this paper we give a "personal" survey of the research on the polyhedral approach to lot-sizing problems developed over the last ten years. Most results concern the formulation and reformulations of single-item problems which can be used to tighten the formulation of practical multi-item and multi-stage problems. The discussion is restricted to exact algorithms, and more specifically to extended linear programming refomulations, cutting planes and separation algorithms. The large body of work on heuristic algorithms is not discussed. The single item lot-sizing subproblems that we discuss in some detail are the uncapacitated lot-sizing problem (ULS), the uncapacitated lot-sizing problem with start-up costs (ULSS), the constant capacity lot-sizing problem (CCLS) and the varying capacity lot-sizing problem (CLS). We give also references to the work done on the reformulations of other single-item, multi-item single stage and multi-item multistage lot-sizing problems.

Suggested Citation

  • POCHET, Yves & WOLSEY , Laurence, 1994. "Algorithms and Reformulations for Lot Sizing Problems," LIDAM Discussion Papers CORE 1994027, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1994027
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp1994.html
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
    2. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    3. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.

    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:cor:louvco:1994027. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.