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

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

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

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

Research output: Book/Report › Report › Academic

164 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 language	English
Place of Publication	Eindhoven
Publisher	Technische Universiteit Eindhoven
Number of pages	14
Publication status	Published - 1992

Publication series

Name	Memorandum COSOR
Volume	9247
ISSN (Print)	0926-4493

Access to Document

389347Final published version, 602 KB

Cite this

@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",

}

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 -

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

Abstract

Publication series

Access to Document

Fingerprint

Cite this