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

Full description

Bibliographic Details

Published in:	International journal of production research Vol. 56; no. 23; pp. 7064 - 7084
Main Authors:	Karagul, Hakan F., Warsing, Donald P., Hodgson, Thom J., Kapadia, Maaz S., Uzsoy, Reha
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 02.12.2018 Taylor & Francis LLC
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!