haku: @indexterm KNAPSACK PROBLEM / yhteensä: 30
viite: 3 / 30
| Tekijä: | Vanderbeck, F. |
| Otsikko: | A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem |
| Lehti: | Management Science
2001 : JUN, VOL. 47:6, p. 864-879 |
| Asiasana: | CUTTING-STOCK PROBLEM KNAPSACK PROBLEM INTEGER PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | The authors consider the cutting of rectangular order pieces into stock pieces of specified width and length. The cutting process involves three stages of orthogonal guillotine cutting. Stock pieces are cut into sections that are cut into slits that are cut into order pieces. Restrictions imposed on the cutting process make the combinatorial structure of the problem more complex, but limit the scope of solution space. The objective of the problem is mainly to minimize waste, but the authors' model also accounts for other issues such as aging stock pieces, urgent or optional orders, and fixed setup costs. Their solution approach involves a nested decomposition of the problem and the recursive use of the column-generation technique. |
SCIMA