Related references
Note: Only part of the references are listed.A biased random-key genetic algorithm for the Steiner triple covering problem
Mauricio G. C. Resende et al.
OPTIMIZATION LETTERS (2012)
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem
Jose Fernando Goncalves et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2011)
A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem
Jose Fernando Goncalves et al.
JOURNAL OF HEURISTICS (2011)
Biased random-key genetic algorithms for combinatorial optimization
Jose Fernando Goncalves et al.
JOURNAL OF HEURISTICS (2011)
Solving job shop scheduling problems utilizing the properties of backbone and big valley
Panos M. Pardalos et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2010)
A random key based genetic algorithm for the resource constrained project scheduling problem
J. J. M. Mendes et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
A very fast TS/SA algorithm for the job shop scheduling problem
Chao Yong Zhang et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
ChaoYong Zhang et al.
COMPUTERS & OPERATIONS RESEARCH (2007)
An algorithm for the job shop scheduling problem based on global equilibrium search techniques
Panos M. Pardalos et al.
COMPUTATIONAL MANAGEMENT SCIENCE (2006)
A hybrid genetic algorithm for the job shop scheduling problem
JF Gonçalves et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
An advanced tabu search algorithm for the job shop problem
E Nowicki et al.
JOURNAL OF SCHEDULING (2005)
Parallel GRASP with path-relinking for job shop scheduling
RM Aiex et al.
PARALLEL COMPUTING (2003)
Share Paper
