A GRASP and branch-and-bound metaheuristic for the job-shop scheduling

Authors:
Susana Fernandes;Helena R. Lourenço
Affiliations:
Universidade do Algarve, Faro, Portugal;Universitat Pompeu Fabra, Barcelona, Spain
Venue:
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Year:
2007

Citing 8
Cited 1

The shifting bottleneck procedure for job shop scheduling

Management Science
New search spaces for sequencing problems with application to job shop scheduling

Management Science
A fast taboo search algorithm for the job shop problem

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming: Series A and B
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling

Optimised Search Heuristic Combining Valid Inequalities and Tabu Search

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a simple algorithm for the job shop scheduling problem that combines the local search heuristic GRASP with a branch-and-bound exact method of integer programming. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.