Heuristics for sequencing cutting patterns
type: Item
instance of: scholarly article
title: Heuristics for sequencing cutting patterns
zbMATH Open document ID: 0729.90997
DOI: 10.1016/0377-2217(91)90222-H
author: Boon J. Yuen
published in: European Journal of Operational Research
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4207757
MaRDI profile type: Publication
cites work: A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: The Theory and Computation of Knapsack Functions
cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
cites work: Glass cutting in a small firm
full work available at URL: 0377-2217(91)90222-h
OpenAlex ID: W1974206331
description: scientific article; zbMATH DE number 4207757