Heuristic and exact methods for the cutting sequencing problem
type: Item
instance of: scholarly article
title: Heuristic and exact methods for the cutting sequencing problem
zbMATH Open document ID: 0943.90061
DOI: 10.1016/S0377-2217(97)00268-3
author: Enrico Faggioli
author: Carlo Alberto Bentivoglio
published in: European Journal of Operational Research
publication date: 1999-09-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1337801
zbMATH Keywords: cutting stock
zbMATH Keywords: cutting sequencing
zbMATH Keywords: greedy algorithm
zbMATH Keywords: tabu search
zbMATH Keywords: generalized local search
zbMATH Keywords: heuristic
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: A user's guide to tabu search
cites work: Glass cutting in a small firm
cites work: Q3888839
cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
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
full work available at URL: s0377-2217(97)00268-3
OpenAlex ID: W1987445021
Recommended article: Establishing the optimality of sequencing heuristics for cutting stock problems
Recommended article: Improved heuristics for sequencing cutting patterns
Recommended article: Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
Recommended article: A sequential heuristic procedure for one-dimensional cutting
Recommended article: Q4368559
Recommended article: A Heuristic Solution of a Cutting Problem Using Hypergraphs
Recommended article: Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
Recommended article: Computing minimum cuts by randomized search heuristics
Recommended article: A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem
Recommended article: Randomized heuristics for the Max-Cut problem
description: scientific article; zbMATH DE number 1337801