Paper #1050

Títol:

A simple optimised search heuristic for the job-shop scheduling problem

Autors:

Susana Fernandes i Helena Ramalhinho-Lourenço

Data:

Gener 2007

Resum:

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Paraules clau:

Job-shop scheduling, hybrid metaheuristic, optimised search heuristics, GRASP, exact methods

Codis JEL:

C61, M11

Àrea de Recerca:

Estadística, Econometria i Mètodes Quantitatius

Publicat a:

Lecture Notes in Computer Science (eds. C. Cotta and J. van Hemert), 4446:60-71, 2007
Amb el títol:
A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling

Descarregar el paper en format PDF