A linear description of the discrete lot-sizing and scheduling problem

C.P.M. van Hoesel, A.W.J. Kolen

    Onderzoeksoutput: Boek/rapportRapportAcademic

    50 Downloads (Pure)

    Samenvatting

    A new integer linear programming formulation for the discrete lot-sizing and scheduling problem is presented. This polynomial-size formulation is obtained from the model with the natural variables by splitting these variables. Its linear programming relaxation is shown to be tight, by reformulating it as a shortest path problem. The latter also provides a dynamic programming formulation for the discrete lot-sizing and scheduling problem.
    Originele taal-2Engels
    Plaats van productieEindhoven
    UitgeverijTechnische Universiteit Eindhoven
    Aantal pagina's14
    StatusGepubliceerd - 1992

    Publicatie series

    NaamMemorandum COSOR
    Volume9247
    ISSN van geprinte versie0926-4493

    Vingerafdruk Duik in de onderzoeksthema's van 'A linear description of the discrete lot-sizing and scheduling problem'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

    van Hoesel, C. P. M., & Kolen, A. W. J. (1992). A linear description of the discrete lot-sizing and scheduling problem. (Memorandum COSOR; Vol. 9247). Technische Universiteit Eindhoven.