A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times"
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://repositorio.inesctec.pt/handle/123456789/5900 |
Resumo: | 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. |
id |
RCAP_5b9f7ec5f06a346ff3d0257488705e59 |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/5900 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times"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.2018-01-10T16:23:20Z2008-01-01T00:00:00Z2008info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/5900engMaria Antónia CarravillaBernardo Almada-LoboJosé Fernando Oliveirainfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:48Zoai:repositorio.inesctec.pt:123456789/5900Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:39.302971Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" |
title |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" |
spellingShingle |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" Maria Antónia Carravilla |
title_short |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" |
title_full |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" |
title_fullStr |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" |
title_full_unstemmed |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" |
title_sort |
A note on "the capacited lot-sizing and scheduling problem with sequence-dependent setup costs and setup times" |
author |
Maria Antónia Carravilla |
author_facet |
Maria Antónia Carravilla Bernardo Almada-Lobo José Fernando Oliveira |
author_role |
author |
author2 |
Bernardo Almada-Lobo José Fernando Oliveira |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Maria Antónia Carravilla Bernardo Almada-Lobo José Fernando Oliveira |
description |
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. |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-01-01T00:00:00Z 2008 2018-01-10T16:23:20Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://repositorio.inesctec.pt/handle/123456789/5900 |
url |
http://repositorio.inesctec.pt/handle/123456789/5900 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131610513145856 |