Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/5900
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaria Antónia Carravillaen
dc.contributor.authorBernardo Almada-Loboen
dc.contributor.authorJosé Fernando Oliveiraen
dc.date.accessioned2018-01-10T16:23:20Z-
dc.date.available2018-01-10T16:23:20Z-
dc.date.issued2008en
dc.identifier.urihttp://repositorio.inesctec.pt/handle/123456789/5900-
dc.description.abstractAbstract 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.en
dc.languageengen
dc.relation265en
dc.relation1297en
dc.relation5428en
dc.rightsinfo:eu-repo/semantics/embargoedAccessen
dc.titleA note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times"en
dc.typearticleen
dc.typePublicationen
Appears in Collections:CESE - Articles in International Journals

Files in This Item:
File Description SizeFormat 
PS-05763.pdf
  Restricted Access
185.19 kBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.