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

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

    Research output: Book/ReportReportAcademic

    49 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

    Lot Sizing
    Scheduling Problem
    Formulation
    Linear Programming Relaxation
    Shortest Path Problem
    Integer Linear Programming
    Dynamic Programming
    Polynomial
    Model

    Cite this

    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). Eindhoven: Technische Universiteit Eindhoven.
    van Hoesel, C.P.M. ; Kolen, A.W.J. / A linear description of the discrete lot-sizing and scheduling problem. Eindhoven : Technische Universiteit Eindhoven, 1992. 14 p. (Memorandum COSOR).
    @book{258c944cb7a0439eb57b03f871cdb319,
    title = "A linear description of the discrete lot-sizing and scheduling problem",
    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.",
    author = "{van Hoesel}, C.P.M. and A.W.J. Kolen",
    year = "1992",
    language = "English",
    series = "Memorandum COSOR",
    publisher = "Technische Universiteit Eindhoven",

    }

    van Hoesel, CPM & Kolen, AWJ 1992, A linear description of the discrete lot-sizing and scheduling problem. Memorandum COSOR, vol. 9247, Technische Universiteit Eindhoven, Eindhoven.

    A linear description of the discrete lot-sizing and scheduling problem. / van Hoesel, C.P.M.; Kolen, A.W.J.

    Eindhoven : Technische Universiteit Eindhoven, 1992. 14 p. (Memorandum COSOR; Vol. 9247).

    Research output: Book/ReportReportAcademic

    TY - BOOK

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

    AU - van Hoesel, C.P.M.

    AU - Kolen, A.W.J.

    PY - 1992

    Y1 - 1992

    N2 - 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.

    AB - 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.

    M3 - Report

    T3 - Memorandum COSOR

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

    PB - Technische Universiteit Eindhoven

    CY - Eindhoven

    ER -

    van Hoesel CPM, Kolen AWJ. A linear description of the discrete lot-sizing and scheduling problem. Eindhoven: Technische Universiteit Eindhoven, 1992. 14 p. (Memorandum COSOR).