Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6896810 | European Journal of Operational Research | 2015 | 7 Pages |
Abstract
The primary objective in the one-dimensional cutting stock problem is to minimize material cost. In real applications it is often necessary to consider auxiliary objectives, one of which is to reduce the number of different cutting patterns (setups). This paper first presents an integer linear programming model to minimize the sum of material and setup costs over a given pattern set, and then describes a sequential grouping procedure to generate the patterns in the set. Two sets of benchmark instances are used in the computational test. The results indicate that the approach is efficient in improving the solution quality.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yaodong Cui, Cheng Zhong, Yi Yao,