| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10347159 | Computers & Operations Research | 2012 | 9 Pages |
Abstract
⺠We present a heuristic for the constrained two-dimensional cutting problem of rectangular pieces. ⺠T-shape patterns are used to simplify the cutting process. ⺠The approach can solve large-scale instances quickly. ⺠The computational results indicate that T-shape patterns can yield much better material utilization than both two-staged and homogenous T-shape patterns.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yaodong Cui, Baixiong Huang,