Cutting and Packing Problems with Placement Constraints

  • Andreas FischerEmail author
  • Guntram Scheithauer
Part of the Springer Optimization and Its Applications book series (SOIA, volume 105)


In real-life problems of cutting and packing very often placement constraints are present. For instance, defective regions of the raw material (wooden boards, steel plates, etc.) shall not become part of the desired products. More generally, due to different quality demands, some products may contain parts of lower quality which are not allowed for other goods. Within this work we consider one- and two-dimensional rectangular cutting and packing problems where items of given types have to be cut from (or packed on) raw material such that an objective function attains its maximum. In the one-dimensional (1D) case, we assume for each item type that allocation intervals (regions of the raw material) are given so that any item of the same type must be completely contained in one of the corresponding allocation intervals. In addition, we deal with problems where the lengths of the 1D items of a given type may vary within known tolerances. In the two-dimensional (2D) case, where rectangular items of different types have to be cut from a large rectangle, we investigate guillotine cutting under the condition that defective rectangular regions are not allowed to be part of the manufactured products (even not partially). For these scenarios we present solution strategies which rely on the branch and bound principle or on dynamic programming. Based on properties of the corresponding objective functions we discuss possibilities to reduce the computational complexity. This includes the definition of appropriate sets of potential allocation (cut) points which have to be inspected to obtain an optimal solution. By dominance considerations the set of allocation points is kept small. In particular, the computational complexity becomes independent of the unit of measure of the input data. Possible generalizations will be discussed as well.


Cutting and packing Placement constraints Quality demands Defective regions Set of allocation points 



This work is supported in a part by the German Research Foundation (DFG) in the Collaborative Research Center 912 “Highly Adaptive Energy-Efficient Computing.”


  1. 1.
    Astrand, E., Rönnqvist, M.: Crosscut optimization of boards given complete defect information. For. Prod. J. 44, 15–24 (1994)Google Scholar
  2. 2.
    Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33, 49–65 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Cintra, G.F., Miyazawa, F.K., Wakabayashi, Y., Xavier, E.C.: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur. J. Oper. Res. 191, 61–85 (2008)CrossRefzbMATHGoogle Scholar
  4. 4.
    Dowsland, K.A.: The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems. J. Oper. Res. Soc. 35, 895–905 (1984)CrossRefzbMATHGoogle Scholar
  5. 5.
    Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Oper. Res. 13, 94–120 (1965)CrossRefzbMATHGoogle Scholar
  6. 6.
    Hahn, S.G.: On the optimal cutting of defective sheets. Oper. Res. 16, 1100–1114 (1968)CrossRefGoogle Scholar
  7. 7.
    Herz, J.C.: Recursive computational procedure for two-dimensional stock cutting. IBM J. Res. Dev. 16, 462–469 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Nicholson, T.A.J.: Finding the shortest route between two points in a network. Comp. J. 9, 275–280 (1966)CrossRefzbMATHGoogle Scholar
  9. 9.
    Rönnqvist, M.: A method for the cutting stock problem with different qualities. Eur. J. Oper. Res. 83, 57–68 (1995)CrossRefzbMATHGoogle Scholar
  10. 10.
    Rönnqvist, M., Astrand, E.: Integrated defect detection and optimization for cross cutting of wooden boards. Eur. J. Oper. Res. 108, 490–508 (1998)CrossRefzbMATHGoogle Scholar
  11. 11.
    Scheithauer, G.: The solution of packing problems with pieces of variable length and additional allocation constraints. Optimization 34, 81–96 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Scheithauer, G.: Zuschnitt- und Packungsoptimierung. Vieweg + Teubner, Wiesbaden (2008)zbMATHGoogle Scholar
  13. 13.
    Scheithauer, G., Terno, J.: Guillotine cutting of defective boards. Optimization 19, 111–121 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Sweeney, P.E., Haessler, R.W.: One-dimensional cutting stock decisions for rolls with multiple quality grades. Eur. J. Oper. Res. 44, 224–231 (1990)CrossRefzbMATHGoogle Scholar
  15. 15.
    Sweeney, P.E., Paternoster, E.R.: Cutting and packing problems: A categorized application-oriented research bibliography. J. Oper. Res. Soc. 43, 691–706 (1992)CrossRefzbMATHGoogle Scholar
  16. 16.
    Terno, J., Lindemann, R., Scheithauer, G.: Zuschnittprobleme und ihre praktische Lösung. Harri Deutsch, Thun and Frankfurt/Main (1987)zbMATHGoogle Scholar
  17. 17.
    Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute of Numerical MathematicsTechnische Universität DresdenDresdenGermany

Personalised recommendations