A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber

Ackermann H, Dinges A (2017) Computing efficient pressing operations for glued laminated timber production. In: Proceedings of the 13th workshop on models and algorithms for planning and scheduling problems. MAPSP ’17. Seeon Abbey, Germany, pp 122–124

Allahverdi, 2015, The third comprehensive survey on scheduling problems with setup times/costs, Eur J Oper Res, 246, 345, 10.1016/j.ejor.2015.04.004

Diessel E (2018) Design and analysis of algorithms for packing and sequencing in the production of glued laminated timber. B.Sc. thesis, Technische Universität Kaiserslautern

Diessel, 2019, Domino sequencing: scheduling with state-based sequence-dependent setup times, Oper Res Lett, 47, 274, 10.1016/j.orl.2019.04.004

Dyckhoff, 1990, A typology of cutting and packing problems, Eur J Oper Res, 44, 145, 10.1016/0377-2217(90)90350-K

Karmarkar N, Karp RM (1983) The differencing method of set partitioning. Tech. rep., EECS Department, University of California, Berkeley. http://www2.eecs.berkeley.edu/Pubs/TechRpts/1983/6353.html

Karp, 1972, Reducibility among combinatorial problems, 85

Kenyon, 2000, A near-optimal solution to a two-dimensional cutting stock problem, Math Oper Res, 25, 645, 10.1287/moor.25.4.645.12118

Leoff J (2016) Hierarchical scheduling and cutting stock with bounded open orders. PhD thesis, Technische Universität Kaiserslautern

Lodi, 2002, Two-dimensional packing problems: a survey, Eur J Oper Res, 141, 241, 10.1016/S0377-2217(02)00123-6

Lodi, 2002, Recent advances on two-dimensional bin packing problems, Discrete Appl Math, 123, 379, 10.1016/S0166-218X(01)00347-X

Michiels, 2007, Performance ratios of the Karmarkar-Karp differencing method, J Comb Optim, 13, 19, 10.1007/s10878-006-9010-z

Pisinger, 2005, The two-dimensional bin packing problem with variable bin sizes and costs, Discrete Optim, 2, 154, 10.1016/j.disopt.2005.01.002

Schreiber EL, Korf RE (2013) Improved bin completion for optimal bin packing and number partitioning. In: Proceedings of the twenty-third international joint conference on artificial intelligence. IJCAI ’13, Beijing, China, AAAI Press, pp 651–658

Schreiber EL, Korf RE (2014) Cached iterative weakening for optimal multi-way number partitioning. In; Proceedings of the twenty-eighth AAAI conference on artificial intelligence. AAAI’14. Quéebec City, Canada, AAAI Press, pp 2738–2744

Serrano, 2003, Mechanical performance and modelling of glulam

Song, 2006, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Eur J Oper Res, 175, 1870, 10.1016/j.ejor.2004.10.034

Tani, 2011, Enumeration of the partitions of an integer into parts of a specified number of different sizes and especially two sizes, J Integer Seq, 14, 1

Wäscher, 2007, An improved typology of cutting and packing problems, Eur J Oper Res, 183, 1109, 10.1016/j.ejor.2005.12.047

Wuttke, 2018, Two-dimensional cutting stock problem with sequence dependent setup times, Eur J Oper Res, 265, 303, 10.1016/j.ejor.2017.07.036

Zhi-Long, 2009, Integrated order scheduling and packing, Prod Oper Manag, 18, 672, 10.1111/j.1937-5956.2009.01029.x