Cutting stock problem

<h2 id="illustration-of-one-dimensional-cutting-stock-problem">Illustration of one-dimensional cutting-stock problem</h2>
<p>A paper machine can produce an unlimited number of master (jumbo) rolls, each 5600 mm wide. The following 13 items must be cut, in the table below.
</p><p>The important thing about this kind of problem is that many different product units can be made from the same master roll, and the number of possible combinations is itself very large, in general, and not trivial to enumerate.
</p><p>The problem therefore is to find an optimum set of patterns of making product rolls from the master roll, such that the demand is satisfied and waste is minimized.
</p>
<table><tbody><tr><th>Width</th><th>#Items</th></tr><tr><td>1380</td><td>22</td></tr><tr><td>1520</td><td>25</td></tr><tr><td>1560</td><td>12</td></tr><tr><td>1710</td><td>14</td></tr><tr><td>1820</td><td>18</td></tr><tr><td>1880</td><td>18</td></tr><tr><td>1930</td><td>20</td></tr><tr><td>2000</td><td>10</td></tr><tr><td>2050</td><td>12</td></tr><tr><td>2100</td><td>14</td></tr><tr><td>2140</td><td>16</td></tr><tr><td>2150</td><td>18</td></tr><tr><td>2200</td><td>20</td></tr></tbody></table>
<h3>Bounds and checks</h3>
<p>A simple lower bound is obtained by dividing the total amount of product by the size of each master roll. The total product required is 1380 x 22 + 1520 x 25 + ... + 2200 x 20 = 407160 mm. Each master roll is 5600  mm, requiring a minimum of 72.7 rolls, which means 73 rolls or more are required.
</p>
<h3>Solution</h3>

<p>There are 308 possible patterns for this small instance. The optimal answer requires 73 master rolls and has 0.401% waste; it can be shown computationally that in this case the minimum number of patterns with this level of waste is 10. It can also be computed that 19 different such solutions exist, each with 10 patterns and a waste of 0.401%, of which one such solution is shown below and in the picture:
</p>
<table><tbody><tr><th>Repetition</th><th>Contents</th></tr><tr><td>2</td><td>1820 + 1820 + 1820</td></tr><tr><td>3</td><td>1380 + 2150 + 1930</td></tr><tr><td>12</td><td>1380 + 2150 + 2050</td></tr><tr><td>7</td><td>1380 + 2100 + 2100</td></tr><tr><td>12</td><td>2200 + 1820 + 1560</td></tr><tr><td>8</td><td>2200 + 1520 + 1880</td></tr><tr><td>1</td><td>1520 + 1930 + 2150</td></tr><tr><td>16</td><td>1520 + 1930 + 2140</td></tr><tr><td>10</td><td>1710 + 2000 + 1880</td></tr><tr><td>2</td><td>1710 + 1710 + 2150</td></tr><tr><td>73</td></tr></tbody></table>
<h2 id="classification">Classification</h2>
<p>Cutting-stock problems can be classified in several ways.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> One way is the dimensionality of the cutting: the above example illustrates a one-dimensional (1D) problem; other industrial applications of 1D occur when cutting pipes, cables, and steel bars. Two-dimensional (2D) problems are encountered in furniture, clothing and glass production. When either the master item or the required parts are irregular-shaped (a situation often encountered in the leather, textile, metals industries) this is referred to as the <i>nesting</i> problem.
</p><p>Not many three-dimensional (3D) applications involving cutting are known; however the closely related 3D <a href="/facts/Packing_problem/nQtnMb6Y">packing problem</a> has many industrial applications, such as packing objects into <a href="/facts/Shipping_container/7mPdo1SE">shipping containers</a> (see e.g. <a href="/facts/Containerization/fxuCbDc3">containerization</a>: the related <a href="/facts/Sphere_packing/NY2FKyMf">sphere packing</a> problem has been studied since the 17th century (<a href="/facts/Kepler_conjecture/5cFNDqwA">Kepler conjecture</a>)).
</p>
<h2 id="applications">Applications</h2>
<p>Industrial applications of cutting-stock problems for high production volumes arise especially when basic material is produced in large rolls that are further cut into smaller units (see <a href="/facts/Roll_slitting/pM1l6sNf">roll slitting</a>). This is done e.g. in paper and plastic film industries but also in production of flat metals like steel or brass. There are many variants and additional constraints arising from special production constraints due to machinery and process limits, customer requirements and quality issues; some examples are:
</p>
<ul><li>Two-stage, where the rolls produced in the first stage are then processed a second time. For instance, all office stationery (e.g. <a href="/facts/ISO_216/jsfzqPxA">A4</a> size in Europe, <a href="/facts/Letter_(paper_size)/NsRpV24a">Letter size</a> in US) is produced in such a process. The complication arises because the machinery in the second stage is narrower than the primary.  Efficient utilisation of both stages of production is important (from an energy or material use perspective) and what is efficient for the primary stage may be inefficient for the secondary, leading to trade-offs. <a href="/facts/Metallised_film/43tgeJUn">Metallised film</a> (used in packaging of snacks), and plastic extrusion on paper (used in <a href="/facts/Liquid_packaging_board/j0EwcNaJ">liquid packaging</a>, e.g. juice cartons) are further examples of such a process.</li>
<li>Winder constraints where the slitting process has physical or logical constraints: a very common constraint is that only a certain number of slitting knives are available, so that feasible patterns should not contain more than a maximum number of rolls. Because winder machinery is not standardised, very many other constraints are encountered.</li>
<li>An example of a customer requirement is when a particular order cannot be satisfied from either of the two edge positions: this is because the edges of the sheet tend to have greater variations in thickness and some applications can be very sensitive to these.</li>
<li>An example of a quality issue is when the master roll contains defects that have to be cut around. Expensive materials with demanding quality characteristics such as <a href="/facts/Photographic_paper/7P6Q8H6D">photographic paper</a> or <a href="/facts/Tyvek/WPI97eh1">Tyvek</a> have to be carefully optimised so that the wasted area is minimised.</li>
<li>Multi-machine problems arise when orders can be produced on more than one machine and these machines have different widths. Generally availability of more than one master roll width improves the waste considerably; in practice however additional order splitting constraints may have to be taken into account.</li>
<li>There is also a semi-continuous problem, where the produced rolls do not have to be of the same diameter, but can vary within a range. This typically occurs with sheet orders. This is sometimes known as a <i>1½ dimensional</i> problem. This variant also occurs in the production of <a href="/facts/Corrugated_fiberboard/VjDFR6II">corrugated fiberboard</a>, where it is called, somewhat confusingly, the <i>corrugator scheduling problem</i>.</li>
<li>Because some paper machines are relatively narrow compared to the demanded items, some companies have invested in a <i>skiving</i> (also known as a <i>web-welding</i>) secondary process, whereby two reels (produced by slitting the initial jumbo reels) are joined side-by-side (with a little overlap) to make up a wider roll. Producing narrower reels in the primary process leads to lower overall waste.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a></li>
<li>In the metals industry one key difference is that typically the master rolls are produced earlier and are generally different from each other (both in terms of width and length). Therefore, there are similarities with the multi-machine problem mentioned above. The presence of length variations creates a 2-D problem, because waste can occur both width-wise and length-wise.</li>
<li>The <a href="/facts/Guillotine_problem/d2wEn9Rj">guillotine problem</a> is another 2-D problem of cutting sheets into rectangles of specified sizes, however only cuts that continue all the way across each sheet are allowed. Industrial applications of this problem can be found in the glass industry.</li></ul>

<ul><li>The cutting stock problem of determining, for the one-dimensional case, the best master size that will meet given demand is known as the <i>assortment</i> problem.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a></li></ul>
<h2 id="history">History</h2>
<p>The cutting stock problem was first formulated by <a href="/facts/Kantorovich/jqjjA4zY">Kantorovich</a> in 1939.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> In 1951 before computers became widely available, L. V. <a href="/facts/Kantorovich/jqjjA4zY">Kantorovich</a> and V. A. <a href="/facts/Zalgaller/RlCPSQTK">Zalgaller</a> suggested<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> solving the problem of the economical use of material at the cutting stage with the help of linear programming. The proposed technique was later called the <i>column generation method</i>.
</p>
<h2 id="mathematical-formulation-and-solution-approaches">Mathematical formulation and solution approaches</h2>
<p>The standard formulation for the cutting-stock problem (but not the only one) starts with a list of <i>m</i> orders, each requiring 
  
    
      
        
          q
          
            j
          
        
      
    
    {\displaystyle q_{j}}
  
 pieces, where 
  
    
      
        j
        =
        1
        ,
        …
        ,
        m
      
    
    {\displaystyle j=1,\ldots ,m}
  
. We then construct a list of all possible combinations of cuts (often called "patterns" or "configurations"). Let 
  
    
      
        C
      
    
    {\displaystyle C}
  
 be the number of those patterns. We associate with each pattern a positive integer variable 
  
    
      
        
          x
          
            i
          
        
      
    
    {\displaystyle x_{i}}
  
, representing how many times pattern 
  
    
      
        i
      
    
    {\displaystyle i}
  
 is to be used, where 
  
    
      
        i
        =
        1
        ,
        …
        ,
        C
      
    
    {\displaystyle i=1,\ldots ,C}
  
.  The linear integer program is then:
</p>

min
        
          ∑
          
            i
            =
            1
          
          
            C
          
        
        
          c
          
            i
          
        
        
          x
          
            i
          
        
      
    
    {\displaystyle \min \sum _{i=1}^{C}c_{i}x_{i}}

s.t.
        
        
          ∑
          
            i
            =
            1
          
          
            C
          
        
        
          a
          
            i
            j
          
        
        
          x
          
            i
          
        
        ≥
        
          q
          
            j
          
        
        ,
        
        
        ∀
        j
        =
        1
        ,
        …
        ,
        m
      
    
    {\displaystyle {\text{s.t.}}\sum _{i=1}^{C}a_{ij}x_{i}\geq q_{j},\quad \quad \forall j=1,\dots ,m}

x
          
            i
          
        
        ≥
        0
      
    
    {\displaystyle x_{i}\geq 0}
  
, integer
<p>where 
  
    
      
        
          a
          
            i
            j
          
        
      
    
    {\displaystyle a_{ij}}
  
 is the number of times order 
  
    
      
        j
      
    
    {\displaystyle j}
  
 appears in pattern 
  
    
      
        i
      
    
    {\displaystyle i}
  
 and 
  
    
      
        
          c
          
            i
          
        
      
    
    {\displaystyle c_{i}}
  
 is the cost (often the waste) of pattern 
  
    
      
        i
      
    
    {\displaystyle i}
  
. The precise nature of the quantity constraints can lead to subtly different mathematical characteristics. The above formulation's quantity constraints are minimum constraints (at least the given amount of each order must be produced, but possibly more). 
</p><p>When 
  
    
      
        
          c
          
            i
          
        
        =
        1
      
    
    {\displaystyle c_{i}=1}
  
, the objective minimises the number of utilised master items and, if the constraint for the quantity to be produced is replaced by equality, it is called the <a href="/facts/Bin_packing_problem/T67Qe934">bin packing problem</a>. 
</p><p>The most general formulation has two-sided constraints (and in this case a minimum-waste solution may consume more than the minimum number of master items):
</p>

q
          
            j
          
        
        ≤
        
          ∑
          
            i
            =
            1
          
          
            n
          
        
        
          a
          
            i
            j
          
        
        
          x
          
            i
          
        
        ≤
        
          Q
          
            j
          
        
        ,
        
        
        ∀
        j
        =
        1
        ,
        …
        ,
        m
      
    
    {\displaystyle q_{j}\leq \sum _{i=1}^{n}a_{ij}x_{i}\leq Q_{j},\quad \quad \forall j=1,\dots ,m}

<p>This formulation applies not just to one-dimensional problems. Many variations are possible, including one where the objective is not to minimise the waste, but to maximise the total value of the produced items, allowing each order to have a different value.
</p><p>In general, the number of possible patterns grows exponentially as a function of <i>m</i>, the number of orders. As the number of orders increases, it may therefore become impractical to enumerate the possible cutting patterns.
</p><p>An alternative approach uses <a href="/facts/Delayed_column-generation/3T355xua">delayed column-generation</a>. This method solves the cutting-stock problem by starting with just a few patterns. It generates additional patterns when they are needed. For the one-dimensional case, the new patterns are introduced by solving an auxiliary optimization problem called the <a href="/facts/Knapsack_problem/HMIdVJH5">knapsack problem</a>, using dual variable information from the <a href="/facts/Linear_program/GduXFQxT">linear program</a>. The knapsack problem has well-known methods to solve it, such as <a href="/facts/Branch_and_bound/mhALtav7">branch and bound</a> and <a href="/facts/Dynamic_programming/CLcabtmk">dynamic programming</a>. The Delayed Column Generation method can be much more efficient than the original approach, particularly as the size of the problem grows. The <a href="/facts/Column_generation/3T355xua">column generation</a> approach as applied to the cutting stock problem was pioneered by Gilmore and Gomory in a series of papers published in the 1960s.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a><a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> Gilmore and Gomory showed that this approach is guaranteed to converge to the (fractional) optimal solution, without needing to enumerate all the possible patterns in advance.
</p><p>A limitation of the original Gilmore and Gomory method is that it does not handle integrality, so the solution may contain fractions, e.g. a particular pattern should be produced 3.67 times. Rounding to the nearest integer often does not work, in the sense that it may lead to a sub-optimal solution and/or under- or over-production of some of the orders (and possible infeasibility in the presence of two-sided demand constraints). This limitation is overcome in modern algorithms, which can solve to optimality (in the sense of finding solutions with minimum waste) very large instances of the problem (generally larger than encountered in practice<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a><a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a>).
</p><p>The cutting-stock problem is often highly degenerate, in that multiple solutions with the same amount of waste are possible. This degeneracy arises because it is possible to move items around, creating new patterns, without affecting the amount of waste. This gives rise to a whole collection of related problems which are concerned with some other criterion, such as the following:
</p>
<ul><li>The minimum pattern count problem: to find a minimum-pattern-count solution amongst the minimum-waste solutions. This is a very hard problem, even when the waste is known.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a><a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a><a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> There is a <a href="/facts/Conjecture/oPWUb7SF">conjecture</a> that any equality-constrained one-dimensional instance with <i>n</i> sizes has at least one minimum waste solution with no more than <i>n</i> + 1 patterns. This conjecture was first refuted in April 2020 with an example with 9 sizes that requires 11 patterns.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a></li>
<li>The minimum stack problem: this is concerned with the sequencing of the patterns so as not to have too many partially completed orders at any time. This was an open problem until 2007, when an efficient algorithm based on dynamic programming was published.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a></li>
<li>The minimum number of knife changes problem (for the one-dimensional problem): this is concerned with sequencing and permuting the patterns so as to minimise the number of times the slitting knives have to be moved. This is a special case of the generalised <a href="/facts/Travelling_salesman_problem/2WEKVLnV">travelling salesman problem</a>.</li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/High-multiplicity_bin_packing/8Q00AXap">High-multiplicity bin packing</a></li>
<li><a href="/facts/Configuration_linear_program/GzKDyIQ8">Configuration linear program</a></li></ul>

<h2 id="further-reading">Further reading</h2>
<ul><li><a href="/facts/V%25C3%25A1clav_Chv%25C3%25A1tal/kUQzU5oP">Chvátal, V.</a> (1983). <a href="https://archive.org/details/linearprogrammin00chv"><i>Linear Programming</i></a>. W.H. Freeman. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-7167-1587-0.</li>
<li>Hatem Ben Amor, J.M. Valério de Carvalho, <i>Cutting Stock Problems</i> in Column Generation, edited by Guy Desaulniers, Jacques Desrosiers, and Marius M. Solomon, Springer, 2005, XVI, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-387-25485-4</li>
<li>M. Delorme, M. Iori, S. Martello, <i>Bin packing and cutting stock problems: Mathematical models and exact algorithms</i>, European Journal of Operational Research 2016, 255, 1–20, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2Fj.ejor.2016.04.030">10.1016/j.ejor.2016.04.030</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Wäscher, G.; Haußner, H.; Schumann, H. An Improved Typology of Cutting and Packing Problems Archived 2020-04-24 at the Wayback Machine. European Journal of Operational Research Volume 183, Issue 3, 1109-1130 <a href="http://prolog.univie.ac.at/teaching/LVAs/KFK-Seminar/SS15/2007%20W%E4scherHaussnerSchuhmann%20An%20improved%20typology%20of%20cutting%20and%20packing%20problems.pdf" target="_blank">http://prolog.univie.ac.at/teaching/LVAs/KFK-Seminar/SS15/2007%20W%E4scherHaussnerSchuhmann%20An%20improved%20typology%20of%20cutting%20and%20packing%20problems.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>M.P. Johnson, C. Rennick & E. Zak (1997), Skiving addition to the cutting stock problem in the paper industry, SIAM Review, 472-483 <a href="https://epubs.siam.org/doi/pdf/10.1137/S003614459531004X" target="_blank">https://epubs.siam.org/doi/pdf/10.1137/S003614459531004X</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Raffensperger, J. F. (2010). "The generalized assortment and best cutting stock length problems". International Transactions in Operational Research. 17: 35–49. doi:10.1111/j.1475-3995.2009.00724.x. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>L. V. Kantorovich Mathematical methods of organizing and planning production. Leningrad State University. 1939 <a href="http://resistir.info/livros/kantorovich_mathematical_methods.pdf" target="_blank">http://resistir.info/livros/kantorovich_mathematical_methods.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Kantorovich L. V. and Zalgaller V. A. . (1951). Calculation of Rational Cutting of Stock. Lenizdat, Leningrad. <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Gilmore P. C., R. E. Gomory (1961). A linear programming approach to the cutting-stock problem.  Operations Research 9: 849-859 <a href="https://web.archive.org/web/20190219020906/http://pdfs.semanticscholar.org/1417/64b5e86dc6c2647dfce48098794c79d5a38b.pdf" target="_blank">https://web.archive.org/web/20190219020906/http://pdfs.semanticscholar.org/1417/64b5e86dc6c2647dfce48098794c79d5a38b.pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Gilmore P. C., R. E. Gomory (1963). A linear programming approach to the cutting-stock problem - Part II.  Operations Research 11: 863-888 <a href="http://people.stern.nyu.edu/rgomory/academic_papers/24_LP.pdf" target="_blank">http://people.stern.nyu.edu/rgomory/academic_papers/24_LP.pdf</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>Goulimis C (1990). Optimal solutions for the cutting stock problem.  European Journal of Operational Research 44: 197-208 <a href="https://www.sciencedirect.com/science/article/pii/037722179090355F" target="_blank">https://www.sciencedirect.com/science/article/pii/037722179090355F</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
<li id="fn:9"><p>de Carvalho V (1998). Exact solution of cutting stock problems using column generation and branch-and-bound. International Transactions in Operational Research 5: 35–44 <a href="https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1475-3995.1998.tb00100.x" target="_blank">https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1475-3995.1998.tb00100.x</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li>
<li id="fn:10"><p>S. Umetani, M. Yagiura, and T. Ibaraki (2003). One dimensional cutting stock problem to minimize the number of different patterns. European Journal of Operational Research 146, 388–402 <a href="/wiki/Toshihide_Ibaraki" target="_blank">/wiki/Toshihide_Ibaraki</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li>
<li id="fn:11"><p>A. Diegel, E. Montocchio, E. Walters, S. van Schalkwyk and S. Naidoo (1996). Setup minimizing conditions in the trim loss problem. European Journal of Operational Research 95:631-640 <a href="https://www.sciencedirect.com/science/article/pii/0377221795003037" target="_blank">https://www.sciencedirect.com/science/article/pii/0377221795003037</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li>
<li id="fn:12"><p>C. McDiarmid (1999). Pattern Minimisation in Cutting Stock Problems. Discrete Applied Mathematics, 121-130 <a href="https://www.sciencedirect.com/science/article/pii/S0166218X99001122" target="_blank">https://www.sciencedirect.com/science/article/pii/S0166218X99001122</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li>
<li id="fn:13"><p>Constantine Goulimis. Counterexamples in the CSP. 	arXiv:2004.01937 <a href="https://arxiv.org/abs/2004.01937" target="_blank">https://arxiv.org/abs/2004.01937</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li>
<li id="fn:14"><p>María García de la Banda, P. J. Stuckey. Dynamic Programming to Minimize the Maximum Number of Open Stacks. INFORMS Journal on Computing, Vol. 19, No. 4, Fall 2007, 607-617. <a href="/wiki/Mar%C3%ADa_Garc%C3%ADa_de_la_Banda" target="_blank">/wiki/Mar%C3%ADa_Garc%C3%ADa_de_la_Banda</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li>
</ol>

Cutting stock problem open-in-new

Cutting stock problem