Abstract
In this paper, we address an extension of the classical two-dimensional bin packing (2BPP) that considers the spread of customer orders (2BPP-OS). The 2BPP-OS addresses a set of rectangular items, required from different customer orders, to be cut from a set of rectangular bins. All the items of a customer order are dispatched together to the next stage of production or distribution after its completion. The objective is to minimize the number of bins used and the spread of customer orders over the cutting process. The 2BPP-OS gains relevance in manufacturing environments that seek minimum waste solutions with satisfactory levels of customer service. We propose integer linear programming (ILP) models for variants of the 2BPP-OS that consider non-guillotine, 2-stage, restricted 3-stage, and unrestricted 3-stage patterns. We are not aware of integrated approaches for the 2BPP-OS in the literature despite its relevance in practical settings. Using a general-purpose ILP solver, the results show that the 2BPP-OS takes more computational effort to solve than the 2BPP, as it has to consider several symmetries that are often disregarded by the traditional 2BPP approaches. The solutions obtained by the proposed approaches have similar bin usage and significantly better metrics of customer satisfaction concerning the approaches that neglect the customer order spread.




Similar content being viewed by others
Data Availibility
The datasets analyzed during the current study are available from the corresponding author upon reasonable request.
References
Alvelos F, Chan T, Vilaça P, Gomes T, Silva E, Valério de Carvalho J (2009) Sequence based heuristics for two-dimensional bin packing problems. Eng Optim 41:773–791. https://doi.org/10.1080/03052150902835960
Arbib C, Marinelli F, Pizzuti A (2021) Number of bins and maximum lateness minimization in two-dimensional bin packing. Eur J Oper Res 291:101–113. https://doi.org/10.1016/j.ejor.2020.09.023
Arbib C, Marinelli F, Ventura P (2016) One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. Int Trans Oper Res 23:47–63. https://doi.org/10.1111/itor.12134
Baptiste P (2005). Simple MIP formulations to minimize the maximum number of open stacks. In Smith BM, & Gent IP (Eds.), Constraint modelling challenge 2005. Edinburgh. https://ipg.host.cs.st-andrews.ac.uk/challenge/
Beasley JE (1985) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297. https://doi.org/10.2307/2582416
Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49–64. https://doi.org/10.1287/opre.33.1.49
Bennell JA, Soon Lee L, Potts CN (2013) A genetic algorithm for two-dimensional bin packing with due dates. Int J Prod Econ 145:547–560. https://doi.org/10.1016/j.ijpe.2013.04.040
Berkey JO, Wang PY (1987) Two-dimensional finite bin-packing algorithms. J Oper Res Soc 38:423–429. https://doi.org/10.1057/jors.1987.70
Boschetti MA, Mingozzi A (2003a). The two-dimensional finite bin packing problem-Part I: new lower bounds for the oriented case. 40(1), 27–42. https://doi.org/10.1007/s10288-002-0005-z
Boschetti MA, Mingozzi A (2003b). The two-dimensional finite bin packing problem - Part II: new lower and upper bounds. 4OR, 1, 135–147. https://doi.org/10.1007/s10288-002-0006-y
Coffman EG Jr, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J Comput 9:808–826. https://doi.org/10.1137/0209062
Cui Y-P, Cui Y, Tang T (2015) Sequential heuristic for the two-dimensional bin-packing problem. Eur J Oper Res 240:43–53. https://doi.org/10.1016/j.ejor.2014.06.032
Dyson RG, Gregory AS (1974) The cutting stock problem in the flat glass industry. J Oper Res Soc 25:41–53. https://doi.org/10.1057/jors.1974.5
Foerster H, Wäscher G (1998) Simulated annealing for order spread minimization in sequencing cutting patterns. Eur J Oper Res 110:272–281. https://doi.org/10.1016/S0377-2217(97)00257-9
Garey MR, Johnson DS (1979) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co, USA
Gilmore PC, Gomory RE (1965) Multistage cutting stock problems of two and more dimensions. Oper Res 13:94–120. https://doi.org/10.1287/opre.13.1.94
Iori M, De Lima VL, Martello S, Miyazawa FK, Monaci M (2021) Exact solution techniques for two-dimensional cutting and packing. Eur J Oper Res 289:399–415. https://doi.org/10.1016/j.ejor.2020.06.050
Linhares A, Yanasse HH (2002) Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Comput Oper Res 29:1759–1772. https://doi.org/10.1016/S0305-0548(01)00054-5
Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141:241–252. https://doi.org/10.1016/S0377-2217(02)00123-6
Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11:345–357. https://doi.org/10.1287/ijoc.11.4.345
Lodi A, Martello S, Vigo D (2002) Recent advances on two-dimensional bin packing problems. Discret Appl Math 123:379–396. https://doi.org/10.1016/S0166-218X(01)00347-X
Lodi A, Martello S, Vigo D (2004) Models and bounds for two-dimensional level packing problems. J Comb Optim 8:363–379. https://doi.org/10.1023/B:JOCO.0000038915.62826.79
Lopes IC, De Carvalho JM (2015) Graph properties of minimization of open stacks problems and a new integer programming model. Pesquisa Operacional 35:213–250. https://doi.org/10.1590/0101-7438.2015.035.02.0213
Macedo R, Alves C, Valério de Carvalho JM (2010) Arc-flow model for the two-dimensional guillotine cutting stock problem. Comput Oper Res 37:991–1001. https://doi.org/10.1016/j.cor.2009.08.005
Madsen OBG (1979) Glass cutting in a small firm. Math Program 17:85–90. https://doi.org/10.1007/BF01588227
Madsen OBG (1983). Production planning in a small firm in the industry glass. In Wilson B, Berg CC, & French D (Eds.), Efficiency of manufacturing systems (pp. 245–253). Boston, MA: Springer US. https://doi.org/10.1007/978-1-4684-4475-9
Madsen OBG (1988) An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry. J Oper Res Soc 39:249–256. https://doi.org/10.1057/jors.1988.42
Martin M, Yanasse HH, Pinto MJ (2021) Mathematical models for the minimization of open stacks problem. International transactions in operational research, n/a. https://doi.org/10.1111/itor.13053
Martin M, Yanasse HH, Santos MO, Morabito R (2022) Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks. Int J Prod Res. https://doi.org/10.1080/00207543.2022.2070882
Melega GM, De Araujo SA, Jans R, Morabito R (2022) Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups. Flex Serv Manuf J. https://doi.org/10.1007/s10696-022-09464-9
Padberg M (2000) Packing small boxes into a big box. Math Methods Oper Res 52:1–21. https://doi.org/10.1007/s001860000066
Piñana E, Plana I, Campos V, Martí R (2004) Grasp and path relinking for the matrix bandwidth minimization. Eur J Oper Res 153:200–210. https://doi.org/10.1016/S0377-2217(02)00715-4
Polyakovskiy S, M’Hallah R (2021) Just-in-time two-dimensional bin packing. Omega 102:102311. https://doi.org/10.1016/j.omega.2020.102311
Puchinger J, Raidl GR (2007) Models and algorithms for three-stage two-dimensional bin packing. Eur J Oper Res 183:1304–1327. https://doi.org/10.1016/j.ejor.2005.11.064
Scheithauer G (2018). Introduction to cutting and packing optimization: problems, modeling approaches, solution methods. International series in operations research and management science. Springer. https://doi.org/10.1007/978-3-319-64143-0
Silva E, Alvelos F, Valério de Carvalho JM (2010) An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur J Oper Res 205:699–708. https://doi.org/10.1016/j.ejor.2010.01.039
Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109–1130. https://doi.org/10.1016/j.ejor.2005.12.047
Yanasse HH, Lamosa MJP (2007) An integrated cutting stock and sequencing problem. Eur J Oper Res 183:1353–1370. https://doi.org/10.1016/j.ejor.2005.09.054
Funding
The authors would like to thank the São Paulo Research Foundation (FAPESP-Brazil) [grant numbers 2020/00747-2, 2016/01860-1] and the National Council for Scientific and Technological Development (CNPq-Brazil) [grant number 304144/2019-3] for the financial support. Research was carried out using the computational resources of the Center for Mathematical Sciences Applied to Industry (CeMEAI) funded by FAPESP-Brazil [grant number 2013/07375-0].
Author information
Authors and Affiliations
Contributions
All authors contributed to the study’s conception and design. Material preparation, data collection, and analysis were performed by Mateus Martin, Horacio Hideki Yanasse, Maristela O. Santos, and Reinaldo Morabito. The first draft of the manuscript was written by Mateus Martin and all authors commented on previous versions of the manuscript.
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Martin, M., Yanasse, H.H., Santos, M.O. et al. Models for two-dimensional bin packing problems with customer order spread. J Comb Optim 48, 8 (2024). https://doi.org/10.1007/s10878-024-01201-2
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-024-01201-2