Applications of modern heuristic search methods to pattern sequencing problems
From MaRDI portal
Publication:1302706
DOI10.1016/S0305-0548(98)80001-4zbMath0957.90044MaRDI QIDQ1302706
Publication date: 23 November 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (15)
Optimal patchings for consecutive ones matrices ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ A method for solving the minimization of the maximum number of open stacks problem within a cutting process ⋮ An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ An integrated cutting stock and sequencing problem ⋮ Minimization of open orders: application of a re-distribution coordination policy ⋮ Mathematical models for the minimization of open stacks problem ⋮ Connections between cutting-pattern sequencing, VLSI design, and flexible machines ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ A Review for Submodular Optimization on Machine Scheduling Problems ⋮ 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 ⋮ The minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ Looking ahead with the pilot method
This page was built for publication: Applications of modern heuristic search methods to pattern sequencing problems
