Simulated annealing for order spread minimization in sequencing cutting patterns

DOI10.1016/S0377-2217(97)00257-9zbMath0948.90066OpenAlexW1978780936MaRDI QIDQ1303575

Gerhard Wäscher, Hildegard Foerster

Publication date: 16 September 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00257-9

zbMATH Keywords

heuristicssimulated annealingcutting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A method for solving the minimization of the maximum number of open stacks problem within a cutting process ⋮ An improved typology of cutting and packing problems ⋮ Mathematical models for the minimization of open stacks problem ⋮ Connections between cutting-pattern sequencing, VLSI design, and flexible machines ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais ⋮ The minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry ⋮ Performance analysis of cyclical simulated annealing algorithms ⋮ A simulated annealing methodology to distribution network design and management

Uses Software

• CUTGEN1

Cites Work

• Unnamed Item
• Heuristics for sequencing cutting patterns
• Simulated annealing: A tool for operational research
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• Establishing the optimality of sequencing heuristics for cutting stock problems
• Improved heuristics for sequencing cutting patterns
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• A Linear Programming Approach to the Cutting-Stock Problem
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry