Integrated lot sizing and blending problems

Detalhes bibliográficos
Autor(a) principal: Fiorotto, Diego Jacinto
Data de Publicação: 2021
Outros Autores: Jans, Raf, de Araujo, Silvio Alexandre [UNESP]
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1016/j.cor.2021.105255
http://hdl.handle.net/11449/221700
Resumo: The standard blending problem consists of combining components to produce a final product with a given demand, while satisfying specific criteria with respect to the global blend and minimizing the total cost. The Bill-Of-Material (BOM) (or recipe) indicates which components are used and in which proportion. Typically, there is some flexibility in the planning process with respect to the proportion used for each of the components, where it may vary between a minimum and a maximum level instead of being fixed. This problem has been widely studied in a single period setting. However, the problem becomes more complex when we take into account a longer time frame. In such a case, demand for the final product occurs in several time periods, and both the final product and the components can be held in stock. In the integrated lot sizing and blending problem, the decisions relate to the production of the final product via the blending process, and the production (or procurement) of the components over an extended time horizon. We propose three mathematical formulations for this integrated problem and present a theoretical analysis of their Linear Programming relaxation bounds. In a computational experiment, we analyse the impact of important parameters such as the level of flexibility in the BOM, the variance in the procurement cost among the components, and the variance of the proportion of the components in the total mix. Furthermore, we analyse the value of integration by comparing the solution of the integrated models to the solutions of approaches that do not fully capture this integration such as a lot-for-lot approach, just-in-time models without inventory for the final product or components, and a hierarchical approach.
id UNSP_edb3295fb395cc5e866fea8070fc264a
oai_identifier_str oai:repositorio.unesp.br:11449/221700
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Integrated lot sizing and blending problemsBill of materialBlending problemLot sizingProduct flexibilityThe standard blending problem consists of combining components to produce a final product with a given demand, while satisfying specific criteria with respect to the global blend and minimizing the total cost. The Bill-Of-Material (BOM) (or recipe) indicates which components are used and in which proportion. Typically, there is some flexibility in the planning process with respect to the proportion used for each of the components, where it may vary between a minimum and a maximum level instead of being fixed. This problem has been widely studied in a single period setting. However, the problem becomes more complex when we take into account a longer time frame. In such a case, demand for the final product occurs in several time periods, and both the final product and the components can be held in stock. In the integrated lot sizing and blending problem, the decisions relate to the production of the final product via the blending process, and the production (or procurement) of the components over an extended time horizon. We propose three mathematical formulations for this integrated problem and present a theoretical analysis of their Linear Programming relaxation bounds. In a computational experiment, we analyse the impact of important parameters such as the level of flexibility in the BOM, the variance in the procurement cost among the components, and the variance of the proportion of the components in the total mix. Furthermore, we analyse the value of integration by comparing the solution of the integrated models to the solutions of approaches that do not fully capture this integration such as a lot-for-lot approach, just-in-time models without inventory for the final product or components, and a hierarchical approach.Faculdade de Ciências Aplicadas Univ. Estadual de CampinasHEC Montréal and CIRRELTDepartamento de Matemática Aplicada Univ. Estadual PaulistaDepartamento de Matemática Aplicada Univ. Estadual PaulistaUniv. Estadual de CampinasHEC Montréal and CIRRELTUniversidade Estadual Paulista (UNESP)Fiorotto, Diego JacintoJans, Rafde Araujo, Silvio Alexandre [UNESP]2022-04-28T19:30:16Z2022-04-28T19:30:16Z2021-07-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1016/j.cor.2021.105255Computers and Operations Research, v. 131.0305-0548http://hdl.handle.net/11449/22170010.1016/j.cor.2021.1052552-s2.0-85102633610Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengComputers and Operations Researchinfo:eu-repo/semantics/openAccess2022-04-28T19:30:16Zoai:repositorio.unesp.br:11449/221700Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-28T19:30:16Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Integrated lot sizing and blending problems
title Integrated lot sizing and blending problems
spellingShingle Integrated lot sizing and blending problems
Fiorotto, Diego Jacinto
Bill of material
Blending problem
Lot sizing
Product flexibility
title_short Integrated lot sizing and blending problems
title_full Integrated lot sizing and blending problems
title_fullStr Integrated lot sizing and blending problems
title_full_unstemmed Integrated lot sizing and blending problems
title_sort Integrated lot sizing and blending problems
author Fiorotto, Diego Jacinto
author_facet Fiorotto, Diego Jacinto
Jans, Raf
de Araujo, Silvio Alexandre [UNESP]
author_role author
author2 Jans, Raf
de Araujo, Silvio Alexandre [UNESP]
author2_role author
author
dc.contributor.none.fl_str_mv Univ. Estadual de Campinas
HEC Montréal and CIRRELT
Universidade Estadual Paulista (UNESP)
dc.contributor.author.fl_str_mv Fiorotto, Diego Jacinto
Jans, Raf
de Araujo, Silvio Alexandre [UNESP]
dc.subject.por.fl_str_mv Bill of material
Blending problem
Lot sizing
Product flexibility
topic Bill of material
Blending problem
Lot sizing
Product flexibility
description The standard blending problem consists of combining components to produce a final product with a given demand, while satisfying specific criteria with respect to the global blend and minimizing the total cost. The Bill-Of-Material (BOM) (or recipe) indicates which components are used and in which proportion. Typically, there is some flexibility in the planning process with respect to the proportion used for each of the components, where it may vary between a minimum and a maximum level instead of being fixed. This problem has been widely studied in a single period setting. However, the problem becomes more complex when we take into account a longer time frame. In such a case, demand for the final product occurs in several time periods, and both the final product and the components can be held in stock. In the integrated lot sizing and blending problem, the decisions relate to the production of the final product via the blending process, and the production (or procurement) of the components over an extended time horizon. We propose three mathematical formulations for this integrated problem and present a theoretical analysis of their Linear Programming relaxation bounds. In a computational experiment, we analyse the impact of important parameters such as the level of flexibility in the BOM, the variance in the procurement cost among the components, and the variance of the proportion of the components in the total mix. Furthermore, we analyse the value of integration by comparing the solution of the integrated models to the solutions of approaches that do not fully capture this integration such as a lot-for-lot approach, just-in-time models without inventory for the final product or components, and a hierarchical approach.
publishDate 2021
dc.date.none.fl_str_mv 2021-07-01
2022-04-28T19:30:16Z
2022-04-28T19:30:16Z
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.1016/j.cor.2021.105255
Computers and Operations Research, v. 131.
0305-0548
http://hdl.handle.net/11449/221700
10.1016/j.cor.2021.105255
2-s2.0-85102633610
url http://dx.doi.org/10.1016/j.cor.2021.105255
http://hdl.handle.net/11449/221700
identifier_str_mv Computers and Operations Research, v. 131.
0305-0548
10.1016/j.cor.2021.105255
2-s2.0-85102633610
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Computers and Operations Research
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
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_ 1799964805217386496