Applications of modern heuristic search methods to pattern sequencing problems

DOI10.1016/S0305-0548(98)80001-4zbMath0957.90044MaRDI QIDQ1302706

Stefan Voß, Andreas Fink

Publication date: 23 November 1999

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

tabu search; production planning; heuristic search; pattern sequencing

Mathematics Subject Classification ID

90B40: Search theory

90C59: Approximation methods and heuristics in mathematical programming

90B30: Production models

Related Items

Minimization of open orders: application of a re-distribution coordination policy, An enhanced branch-and-bound algorithm for the talent scheduling problem, On the one-dimensional stock cutting problem in the paper tube industry, Looking ahead with the pilot method, Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners, The minimization of open stacks problem: a review of some properties and their use in pre-processing operations, Solving the continuous flow-shop scheduling problem by metaheuristics., A method for solving the minimization of the maximum number of open stacks problem within a cutting process, Connections between cutting-pattern sequencing, VLSI design, and flexible machines, An integrated cutting stock and sequencing problem, A biased random-key genetic algorithm for the minimization of open stacks problem, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais