Applications of Modern Heuristic Search Methods to Pattern Sequencing Problems (1999)

by Andreas Fink , Stefan Voß
Venue:COMPUTERS & OPERATIONS RESEARCH
Citations:21 - 6 self

Documents Related by Co-Citation

40 Graph problems related to gate matrix layout and PLA folding – R H Mohring - 1990
7 Heuristic and exact methods for the cutting sequencing problem – E Faggioli, C A Bentivoglio - 1998
1134 Algorithmic Graph Theory and Perfect Graphs – M C Golumbic - 1980
7 Solving General Ring Network Design Problems by Meta-Heuristics – Andreas Fink, Gabriele Schneidereit, Stefan Voß
6 Connection between cutting-pattern sequencing, VLSI design and flexible machines – A Linhares, H Yanasse
9 Generic metaheuristics application to industrial engineering problems – A Fink, S Voß - 1999
104 Designing and reporting on computational experiments with heuristic methods – Richard S. Barr, Bruce L. Golden, James P. Kelly, Mauricio G. C, Resende William, R. Stewart - 1995
20 The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs – Cees Duin, Stefan Voß - 1999
3559 Optimization by simulated annealing – S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi - 1983
3 A.: A multiple population evolutionary approach to gate matrix layout, Int – A Mendes, Linhares - 2004
29 Schedule optimization using genetic algorithms Handbook of Genetic Algorithms – G Syswerda - 1991
5 Industrial Pattern Sequencing Problems: some complexity results and new local search models – Alexandre Linhares - 2001
8 A constructive genetic algorithm for gate matrix layout problems. Computer-Aided Design of Integrated Circuits and Systems – A C M Oliveira, L A N Lorena - 2002
121 Scatter Search and Path Relinking – Fred Glover - 1999
4 Complexity, algorithms, programs, systems: The shifting focus – J Nievergelt - 1994
436 PDDL2.1: An extension to PDDL for expressing temporal planning domains – Maria Fox, Derek Long - 2003
72 PDDL2.2: The language for the classical part of the 4th international planning competition, january 21 – Stefan Edelkamp, Jörg Hoffmann - 2004
15 NP-completness of the problem of finding a minimum clique number interval graph containing a given graph as asubgraph – T Kashiwabara, T Fujisawa - 1979
3 Benchmarks for basic scheduling instances – E Taillard - 1993