A heuristic approach to one-dimensional cutting stock problem
type: Item
instance of: scholarly article
title: A heuristic approach to one-dimensional cutting stock problem
zbMATH Open document ID: 0617.90042
author: Arvind Seth
author: V. Rajendra Prasad
author: K. G. Ramamurthy
published in: Opsearch
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4001849
zbMATH Keywords: cutting stock
zbMATH Keywords: utility function
zbMATH Keywords: nonlinear separable function
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: multistage decision making
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4001849