A comparison of mixed integer programming formulations of the capacitated lot-sizing problem

We propose a novel mixed integer programming formulation for the capacitated lot-sizing problem with set-up times and set-up carryover. We compare our formulation to two earlier formulations, the Classical and Modified formulations, and a more recent formulation due to Suerie and Stadtler. Extensive...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of production research Ročník 56; číslo 23; s. 7064 - 7084
Hlavní autori:	Karagul, Hakan F., Warsing, Donald P., Hodgson, Thom J., Kapadia, Maaz S., Uzsoy, Reha
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 02.12.2018 Taylor & Francis LLC
Predmet:	capacitated lot sizing Formulations Integer programming Job shops Lot sizing Lower bounds Mixed integer mixed integer linear programming optimisation printing industry Production scheduling set-up planning
ISSN:	0020-7543, 1366-588X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!