| Article ID: | iaor2009988 |
| Country: | United Kingdom |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 1374 |
| End Page Number: | 1376 |
| Publication Date: | Apr 2008 |
| Journal: | Computers and Operations Research |
| Authors: | Oliveira Jos F., Carravilla Maria Antnia, Almada-Lobo Bernardo |
Gupta and Magnusson developed 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.