A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
type: Item
instance of: scholarly article
title: A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
zbMATH Open document ID: 1081.90572
DOI: 10.1016/S0377-2217(02)00128-5
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1829901
zbMATH Keywords: Cutting stock problem
zbMATH Keywords: Heuristic
zbMATH Keywords: Pattern sequencing
author: Michael Armbruster
MaRDI profile type: Publication
cites work: Heuristic and exact methods for the cutting sequencing problem
cites work: Simulated annealing for order spread minimization in sequencing cutting patterns
cites work: Q4198056
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: Q3993418
cites work: Near-optimal solutions to one-dimensional cutting stock problems
cites work: Q3805803
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
cites work: On a pattern sequencing problem to minimize the maximum number of open stacks
cites work: Heuristics for sequencing cutting patterns
cites work: Establishing the optimality of sequencing heuristics for cutting stock problems
cites work: Improved heuristics for sequencing cutting patterns
description: scientific article; zbMATH DE number 1829901