Author:

Keywords:

Cutting stock, sequence dependent cut losses, integer programming, pattern based heuristic, itec, iMinds, Social Sciences, Science & Technology, Technology, Management, Operations Research & Management Science, Business & Economics, cutting stock, sequence-dependent cut losses, pattern-based heuristic, TRAVELING SALESMAN PROBLEM, PACKING PROBLEMS, BIN-PACKING, TYPOLOGY, 0102 Applied Mathematics, 0806 Information Systems, 1503 Business and Management, 3509 Transportation, logistics and supply chains, 4901 Applied mathematics

Abstract:

The paper presents a new generalisation of the one-dimensional cutting stock problem (1D-CSP) that considers cut losses that depend on the items’ cutting sequence. It is shown that this generalisation can still be solved approximately by standard 1D-CSP approaches. Furthermore, a pattern-based heuristic (denoted HSD) is presented that specifically considers sequence dependent cut losses (SDCL). A computational study shows that whenever some variability in SDCL occurs consideration of SDCL in the HSD heuristic is beneficial. Finally, two case studies illustrate the relevance of this new generalisation.