Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups

Gislaine Mara Melega (), Silvio Alexandre de Araujo, Raf Jans and Reinaldo Morabito
Additional contact information
Gislaine Mara Melega: UFSCar - Universidade Federal de São Carlos
Silvio Alexandre de Araujo: UNESP - Universidade Estadual Paulista
Raf Jans: HEC Montréal and CIRRELT
Reinaldo Morabito: UFSCar - Universidade Federal de São Carlos

Flexible Services and Manufacturing Journal, 2023, vol. 35, issue 4, No 11, 1276-1312

Abstract: Abstract 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.

Keywords: Coupled bin-packing and lot-sizing problem; Sequence-dependent setups; Automatic-benders; Cutting stock problems (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10696-022-09464-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:flsman:v:35:y:2023:i:4:d:10.1007_s10696-022-09464-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10696

DOI: 10.1007/s10696-022-09464-9

Access Statistics for this article

Flexible Services and Manufacturing Journal is currently edited by Hans Günther

More articles in Flexible Services and Manufacturing Journal from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().