A linear optimization approach to the combined production planning model
dc.contributor.author | Gramani, Maria Cristina N. | |
dc.contributor.author | Franca, Paulo M. [UNESP] | |
dc.contributor.author | Arenales, Marcos N. | |
dc.contributor.institution | Insper Inst Educ & Res | |
dc.contributor.institution | Universidade Estadual Paulista (Unesp) | |
dc.contributor.institution | Universidade de São Paulo (USP) | |
dc.date.accessioned | 2014-05-20T15:31:26Z | |
dc.date.available | 2014-05-20T15:31:26Z | |
dc.date.issued | 2011-09-01 | |
dc.description.abstract | Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved. | en |
dc.description.affiliation | Insper Inst Educ & Res, BR-04546042 São Paulo, Brazil | |
dc.description.affiliation | Univ Estadual Paulista, FCT, UNESP, BR-19060900 Presidente Prudente, SP, Brazil | |
dc.description.affiliation | Univ São Paulo, ICMC, BR-13560970 São Carlos, SP, Brazil | |
dc.description.affiliationUnesp | Univ Estadual Paulista, FCT, UNESP, BR-19060900 Presidente Prudente, SP, Brazil | |
dc.format.extent | 1523-1536 | |
dc.identifier | http://dx.doi.org/10.1016/j.jfranklin.2010.05.010 | |
dc.identifier.citation | Journal of The Franklin Institute-engineering and Applied Mathematics. Oxford: Pergamon-Elsevier B.V. Ltd, v. 348, n. 7, p. 1523-1536, 2011. | |
dc.identifier.doi | 10.1016/j.jfranklin.2010.05.010 | |
dc.identifier.issn | 0016-0032 | |
dc.identifier.uri | http://hdl.handle.net/11449/40568 | |
dc.identifier.wos | WOS:000293960600025 | |
dc.language.iso | eng | |
dc.publisher | Pergamon-Elsevier B.V. Ltd | |
dc.relation.ispartof | Journal of The Franklin Institute-engineering and Applied Mathematics | |
dc.relation.ispartofjcr | 3.576 | |
dc.relation.ispartofsjr | 1,322 | |
dc.rights.accessRights | Acesso restrito | pt |
dc.source | Web of Science | |
dc.subject | Lot sizing | en |
dc.subject | Cutting stock | en |
dc.subject | Column generation technique | en |
dc.subject | Linear optimization approach | en |
dc.title | A linear optimization approach to the combined production planning model | en |
dc.type | Artigo | pt |
dcterms.license | http://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy | |
dcterms.rightsHolder | Pergamon-Elsevier B.V. Ltd | |
dspace.entity.type | Publication | |
unesp.author.orcid | 0000-0002-0490-5515[2] | |
unesp.author.orcid | 0000-0001-7947-1777[1] | |
unesp.campus | Universidade Estadual Paulista (UNESP), Faculdade de Ciências e Tecnologia, Presidente Prudente | pt |
Arquivos
Licença do pacote
1 - 2 de 2
Carregando...
- Nome:
- license.txt
- Tamanho:
- 1.71 KB
- Formato:
- Item-specific license agreed upon to submission
- Descrição:
Carregando...
- Nome:
- license.txt
- Tamanho:
- 1.71 KB
- Formato:
- Item-specific license agreed upon to submission
- Descrição: