VARIANTS OF THE CUTTING STOCK PROBLEM AND THE SOLUTION METHODS
M. M. Malik,J. H. Taplin,M. Qiu
Over the years, column generation based algorithms such as branch and price
have been the preferred solution techniques for the classical cutting stock problem
(CSP). However, most cutting stock problems encountered in the real world are
variants of the classical CSP with many more complexities. The exact algorithms
have been found wanting for these variant problems such as cutting stock with
knives setup considerations, pattern minimization, ordered cutting stock, order
spread minimization, minimization of open stacks, CSP with contiguity, CSP with
due dates and service level considerations, CSP with multiple objectives and
integration of the cutting stock problem with other production processes. This
paper studies the cutting stock variants with an emphasis on the optimality of
solutions obtained by the approximate methods.
Cutting Stock Problems, Computational Techniques, Optimization
Araujo, S. A., Constantino, A. A., & Poldi, K. C. (2011). An evolutionary algorithm for the one-dimensional cutting stock problem. International Transactions in Operational Research, 18, 115-127.