Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes
Autor(a) principal: | |
---|---|
Data de Publicação: | 2010 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | por |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1590/S0101-74382010000300008 http://hdl.handle.net/11449/71852 |
Resumo: | In this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation. |
id |
UNSP_978800ddd93073100cd1f814ff2fd08c |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/71852 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotesA priori reformulationExtended formulationLot sizing and schedulingMixed-integer programmingProduction planningIn this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation.Dep. de Ciências da Computação e Estatística Insti. de Bioci., Letras e Ciências Exatas UNESP-Univ. Estadual Paulista, São José do Rio Preto - SPDep. de Ciências da Computação e Estatística Insti. de Bioci., Letras e Ciências Exatas UNESP-Univ. Estadual Paulista, São José do Rio Preto - SPUniversidade Estadual Paulista (Unesp)Bernardes, Eduardo Delcides [UNESP]Araujo, Silvio Alexandre de [UNESP]Rangel, Socorro [UNESP]2014-05-27T11:24:47Z2014-05-27T11:24:47Z2010-09-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article637-655application/pdfhttp://dx.doi.org/10.1590/S0101-74382010000300008Pesquisa Operacional, v. 30, n. 3, p. 637-655, 2010.0101-74381678-5142http://hdl.handle.net/11449/7185210.1590/S0101-74382010000300008S0101-743820100003000082-s2.0-79952386485S0101-74382010000300008.pdf99197731823160620000-0002-4762-2048Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPporPesquisa Operacional0,365info:eu-repo/semantics/openAccess2024-01-22T06:23:20Zoai:repositorio.unesp.br:11449/71852Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T23:40:16.812219Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes |
title |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes |
spellingShingle |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes Bernardes, Eduardo Delcides [UNESP] A priori reformulation Extended formulation Lot sizing and scheduling Mixed-integer programming Production planning |
title_short |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes |
title_full |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes |
title_fullStr |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes |
title_full_unstemmed |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes |
title_sort |
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes |
author |
Bernardes, Eduardo Delcides [UNESP] |
author_facet |
Bernardes, Eduardo Delcides [UNESP] Araujo, Silvio Alexandre de [UNESP] Rangel, Socorro [UNESP] |
author_role |
author |
author2 |
Araujo, Silvio Alexandre de [UNESP] Rangel, Socorro [UNESP] |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Bernardes, Eduardo Delcides [UNESP] Araujo, Silvio Alexandre de [UNESP] Rangel, Socorro [UNESP] |
dc.subject.por.fl_str_mv |
A priori reformulation Extended formulation Lot sizing and scheduling Mixed-integer programming Production planning |
topic |
A priori reformulation Extended formulation Lot sizing and scheduling Mixed-integer programming Production planning |
description |
In this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation. |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-09-01 2014-05-27T11:24:47Z 2014-05-27T11:24:47Z |
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://dx.doi.org/10.1590/S0101-74382010000300008 Pesquisa Operacional, v. 30, n. 3, p. 637-655, 2010. 0101-7438 1678-5142 http://hdl.handle.net/11449/71852 10.1590/S0101-74382010000300008 S0101-74382010000300008 2-s2.0-79952386485 S0101-74382010000300008.pdf 9919773182316062 0000-0002-4762-2048 |
url |
http://dx.doi.org/10.1590/S0101-74382010000300008 http://hdl.handle.net/11449/71852 |
identifier_str_mv |
Pesquisa Operacional, v. 30, n. 3, p. 637-655, 2010. 0101-7438 1678-5142 10.1590/S0101-74382010000300008 S0101-74382010000300008 2-s2.0-79952386485 S0101-74382010000300008.pdf 9919773182316062 0000-0002-4762-2048 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.none.fl_str_mv |
Pesquisa Operacional 0,365 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
637-655 application/pdf |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129541713952768 |