Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1007/s10696-022-09464-9 http://hdl.handle.net/11449/241625 |
Resumo: | We study bin-packing and lot-sizing decisions in an integrated way. Such a problem appears in several manufacturing settings where items first need to be cut and next assembled into final products. One of the main novelties of this research is the modeling of the complex setup operations in the cutting process, which is modeled using a bin-packing formulation. More specifically, we consider the operation regarding the insertion or removal of the knives in the cutting process. Since this operation depends on the number of items cut in the current cutting process and in the previous one, the number of insertions and removals is sequence-dependent. The setups in the lot-sizing problem related to the production of the final products are also sequence-dependent. To deal with such a problem, two compact formulations are proposed. The sequence-dependent setups in the bin-packing problem are modeled in two different ways: based on known constraints from the literature, and based on the idea of micro-periods and a phantom cutting process. Due to the dependency in the setups decisions, the resulting formulations are mixed-integer nonlinear mathematical models. In order to deal with the sequence-dependent cutting and production setups, different polynomial-sized sets of subtour elimination constraints are employed to the coupled problem. A computational study is conducted in order to analyze the impact of the proposed approaches to model sequence-dependent setups, as well as the different subtour elimination strategies to solve the coupled bin-packing and lot-sizing problem, via an automatic-Benders decomposition algorithm. |
id |
UNSP_f914219f6b1ce1ea0a7cda7470e0130f |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/241625 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setupsAutomatic-bendersCoupled bin-packing and lot-sizing problemCutting stock problemsSequence-dependent setupsWe study bin-packing and lot-sizing decisions in an integrated way. Such a problem appears in several manufacturing settings where items first need to be cut and next assembled into final products. One of the main novelties of this research is the modeling of the complex setup operations in the cutting process, which is modeled using a bin-packing formulation. More specifically, we consider the operation regarding the insertion or removal of the knives in the cutting process. Since this operation depends on the number of items cut in the current cutting process and in the previous one, the number of insertions and removals is sequence-dependent. The setups in the lot-sizing problem related to the production of the final products are also sequence-dependent. To deal with such a problem, two compact formulations are proposed. The sequence-dependent setups in the bin-packing problem are modeled in two different ways: based on known constraints from the literature, and based on the idea of micro-periods and a phantom cutting process. Due to the dependency in the setups decisions, the resulting formulations are mixed-integer nonlinear mathematical models. In order to deal with the sequence-dependent cutting and production setups, different polynomial-sized sets of subtour elimination constraints are employed to the coupled problem. A computational study is conducted in order to analyze the impact of the proposed approaches to model sequence-dependent setups, as well as the different subtour elimination strategies to solve the coupled bin-packing and lot-sizing problem, via an automatic-Benders decomposition algorithm.Departamento de Engenharia de Produção UFSCar - Universidade Federal de São Carlos, SPDepartamento de Matemática IBILCE UNESP - Universidade Estadual Paulista, SPGERADDepartment of Logistics and Operations Management HEC Montréal and CIRRELT, 3000, chemin de la Côte Sainte CatherineDepartamento de Matemática IBILCE UNESP - Universidade Estadual Paulista, SPUniversidade Federal de São Carlos (UFSCar)Universidade Estadual Paulista (UNESP)GERADHEC Montréal and CIRRELTMelega, Gislaine Marade Araujo, Silvio Alexandre [UNESP]Jans, RafMorabito, Reinaldo2023-03-01T21:13:40Z2023-03-01T21:13:40Z2022-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1007/s10696-022-09464-9Flexible Services and Manufacturing Journal.1936-65901936-6582http://hdl.handle.net/11449/24162510.1007/s10696-022-09464-92-s2.0-85137526453Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengFlexible Services and Manufacturing Journalinfo:eu-repo/semantics/openAccess2023-03-01T21:13:40Zoai:repositorio.unesp.br:11449/241625Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T20:15:17.701451Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups |
title |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups |
spellingShingle |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups Melega, Gislaine Mara Automatic-benders Coupled bin-packing and lot-sizing problem Cutting stock problems Sequence-dependent setups |
title_short |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups |
title_full |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups |
title_fullStr |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups |
title_full_unstemmed |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups |
title_sort |
Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups |
author |
Melega, Gislaine Mara |
author_facet |
Melega, Gislaine Mara de Araujo, Silvio Alexandre [UNESP] Jans, Raf Morabito, Reinaldo |
author_role |
author |
author2 |
de Araujo, Silvio Alexandre [UNESP] Jans, Raf Morabito, Reinaldo |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Universidade Federal de São Carlos (UFSCar) Universidade Estadual Paulista (UNESP) GERAD HEC Montréal and CIRRELT |
dc.contributor.author.fl_str_mv |
Melega, Gislaine Mara de Araujo, Silvio Alexandre [UNESP] Jans, Raf Morabito, Reinaldo |
dc.subject.por.fl_str_mv |
Automatic-benders Coupled bin-packing and lot-sizing problem Cutting stock problems Sequence-dependent setups |
topic |
Automatic-benders Coupled bin-packing and lot-sizing problem Cutting stock problems Sequence-dependent setups |
description |
We study bin-packing and lot-sizing decisions in an integrated way. Such a problem appears in several manufacturing settings where items first need to be cut and next assembled into final products. One of the main novelties of this research is the modeling of the complex setup operations in the cutting process, which is modeled using a bin-packing formulation. More specifically, we consider the operation regarding the insertion or removal of the knives in the cutting process. Since this operation depends on the number of items cut in the current cutting process and in the previous one, the number of insertions and removals is sequence-dependent. The setups in the lot-sizing problem related to the production of the final products are also sequence-dependent. To deal with such a problem, two compact formulations are proposed. The sequence-dependent setups in the bin-packing problem are modeled in two different ways: based on known constraints from the literature, and based on the idea of micro-periods and a phantom cutting process. Due to the dependency in the setups decisions, the resulting formulations are mixed-integer nonlinear mathematical models. In order to deal with the sequence-dependent cutting and production setups, different polynomial-sized sets of subtour elimination constraints are employed to the coupled problem. A computational study is conducted in order to analyze the impact of the proposed approaches to model sequence-dependent setups, as well as the different subtour elimination strategies to solve the coupled bin-packing and lot-sizing problem, via an automatic-Benders decomposition algorithm. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-01-01 2023-03-01T21:13:40Z 2023-03-01T21:13:40Z |
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.1007/s10696-022-09464-9 Flexible Services and Manufacturing Journal. 1936-6590 1936-6582 http://hdl.handle.net/11449/241625 10.1007/s10696-022-09464-9 2-s2.0-85137526453 |
url |
http://dx.doi.org/10.1007/s10696-022-09464-9 http://hdl.handle.net/11449/241625 |
identifier_str_mv |
Flexible Services and Manufacturing Journal. 1936-6590 1936-6582 10.1007/s10696-022-09464-9 2-s2.0-85137526453 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Flexible Services and Manufacturing Journal |
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_ |
1808129179661631488 |