Work

One-dimensional Cutting Stock Problem That Minimizes the Number of Different Patterns

Year: 2022
Type: article
Abstract: Cutting stock problem (CSP) is a problem of cutting an object into several smaller objects to fulfill the existing demand with a minimum unused object remaining. Besides minimizing the remaining of the object, sometimes there is another additional problem in CSP, namely minimizing the number of different cutting patterns. This happens because there is a setup cost for each pattern. This study shows a way to obtain a minimum number of different patterns in the cutting stock problem (CSP). An example problem is modeled in linear programming and then solved by a column generation algorithm using the Lingo 18.0 software.
Institution: IPB University
Language: English
Open Access status: diamond
OpenAlex ID: W4297538091
FWCI: 0.26
Cites: 18
Cited by: 3
Related to: 10