A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times"

Thumbnail Image
Date
2008
Authors
Maria Antónia Carravilla
Bernardo Almada-Lobo
José Fernando Oliveira
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Abstract Gupta and Magnusson [The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers and Operations Research 2005;32(4):727–47] develop a model for the single machine capacitated lot-sizing and scheduling problem (CLSP) with sequence dependent setup times and setup costs, incorporating all the usual features of setup carryovers. In this note we show that this model does not avoid disconnected subtours. A new set of constraints is added to the model to provide an exact formulation for this problem.
Description
Keywords
Citation