Paper #1050

Título:

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

Autores:

Susana Fernandes y Helena Ramalhinho-Lourenço

Data:

Enero 2007

Resumen:

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.

Palabras clave:

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

Códigos JEL:

C61, M11

Área de investigación:

Estadística, Econometría y Métodos Cuantitativos

Publicado en:

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

Descargar el paper en formato PDF