Improved heuristics for sequencing cutting patterns
type: Item
instance of: scholarly article
title: Improved heuristics for sequencing cutting patterns
zbMATH Open document ID: 0914.90230
DOI: 10.1016/0377-2217(94)00068-N
author: Boon J. Yuen
published in: European Journal of Operational Research
publication date: 1998-07-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 1175043
zbMATH Keywords: heuristics
zbMATH Keywords: cutting patterns
zbMATH Keywords: maximum queue of partially cut orders
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: Heuristics for sequencing cutting patterns
description: scientific article; zbMATH DE number 1175043