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

dc.contributor.author Maria Antónia Carravilla en
dc.contributor.author Bernardo Almada-Lobo en
dc.contributor.author José Fernando Oliveira en
dc.date.accessioned 2018-01-10T16:23:20Z
dc.date.available 2018-01-10T16:23:20Z
dc.date.issued 2008 en
dc.description.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. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/5900
dc.language eng en
dc.relation 265 en
dc.relation 1297 en
dc.relation 5428 en
dc.rights info:eu-repo/semantics/embargoedAccess en
dc.title A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" en
dc.type article en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
PS-05763.pdf
Size:
185.19 KB
Format:
Adobe Portable Document Format
Description: