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

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

    Research output: Book/ReportReportAcademic

    55 Downloads (Pure)

    Abstract

    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.
    Original languageEnglish
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    Number of pages14
    Publication statusPublished - 1992

    Publication series

    NameMemorandum COSOR
    Volume9247
    ISSN (Print)0926-4493

    Fingerprint Dive into the research topics of 'A linear description of the discrete lot-sizing and scheduling problem'. Together they form a unique fingerprint.

    Cite this