.png){kind=icon}
.png){kind=icon}
Return
Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.12.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Cutting
Cutting stock
One-dimensional cutting
Pattern reduction
Setup cost
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W