A heuristic approach to one-dimensional cutting stock problem (Q1088890)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic approach to one-dimensional cutting stock problem |
scientific article; zbMATH DE number 4001849
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic approach to one-dimensional cutting stock problem |
scientific article; zbMATH DE number 4001849 |
Statements
A heuristic approach to one-dimensional cutting stock problem (English)
0 references
1986
0 references
Instead of a mathematical programming model that minimizes the scrap in a one-dimensional cutting stock problem, a model that maximizes the utility of the scrap is considered. The model's constraints are linear, the utility function is a nonlinear separable function and the variables are nonnegative integers. A heuristic algorithm using a multistage decision making approach is given to solve the problem.
0 references
cutting stock
0 references
utility function
0 references
nonlinear separable function
0 references
heuristic algorithm
0 references
multistage decision making
0 references
