An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
From MaRDI portal
Publication:3779982
DOI10.1057/jors.1988.42zbMath0638.90047OpenAlexW2025671688MaRDI QIDQ3779982
Publication date: 1988
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1988.42
two-stage procedurecutting sequencingtravelling-salesman3-optimal methodelimination of order spreadpattern allocationreal-life cutting-stocktwo-dimensional pattern- allocation problem
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27)
Related Items
A method for solving the minimization of the maximum number of open stacks problem within a cutting process ⋮ An integrated cutting stock and sequencing problem ⋮ Heuristic methods to consecutive block minimization ⋮ Establishing the optimality of sequencing heuristics for cutting stock problems ⋮ Iterated local search for consecutive block minimization ⋮ Improved heuristics for sequencing cutting patterns ⋮ Exponential neighborhood search for consecutive block minimization ⋮ Connections between cutting-pattern sequencing, VLSI design, and flexible machines ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Knowledge based approach to the cutting stock problem ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais ⋮ On a pattern sequencing problem to minimize the maximum number of open stacks ⋮ The minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ Heuristic and exact methods for the cutting sequencing problem ⋮ Simulated annealing for order spread minimization in sequencing cutting patterns ⋮ Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem ⋮ A heuristic and an exact method for the gate matrix connection cost minimization problem ⋮ Heuristics for sequencing cutting patterns
