### Abstract

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 |

### Fingerprint

### Cite this

*A linear description of the discrete lot-sizing and scheduling problem*. (Memorandum COSOR; Vol. 9247). Eindhoven: Technische Universiteit Eindhoven.

}

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

Research output: Book/Report › Report › Academic

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 -