Department of Economics and Business - Universitat Pompeu Fabra

Title:: A simple optimised search heuristic for the job-shop scheduling problem
Authors:: Susana Fernandes and Helena Ramalhinho-Lourenço
Date:: January 2007
Abstract:: 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.
Keywords:: Job-shop scheduling, hybrid metaheuristic, optimised search heuristics, GRASP, exact methods
JEL codes:: C61, M11
Area of Research:: Statistics, Econometrics and Quantitative Methods
Published in:: Lecture Notes in Computer Science (eds. C. Cotta and J. van Hemert), 4446:60-71, 2007
With the title:
A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling

Download the paper in PDF format