To access the full text documents, please follow this link:

A simple optimised search heuristic for the job-shop scheduling problem;
A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling
Fernandes, Susana; Ramalhinho-Lourenço, Helena
Universitat Pompeu Fabra. Departament d'Economia i Empresa
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.
Statistics, Econometrics and Quantitative Methods
job-shop scheduling
hybrid metaheuristic
optimised search heuristics
exact methods
L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons
Working Paper

Show full item record