A GRASP with Path Relinking for the Single Machine Total Weighted Tardiness Problem

Author

Arroyo, José E C ; Santos, André G. ; Silva, Fabrício L S ; Araujo, Aleteia F.

Author_Institution

Dept. de Inf., Univ. Fed. de Vicosa, Vicosa

fYear

2008

fDate

10-12 Sept. 2008

Firstpage

726

Lastpage

731

Abstract

This study considers a single machine scheduling problem with the objective of minimizing the total weighted tardiness of the jobs. This problem is one of the most famous problems in single machine scheduling theory and it is NP-hard. In this paper, we propose a hybrid heuristic which combines GRASP with Path Relinking to find good quality solutions for the considered problem. The performance of the hybrid GRASP heuristic is tested over multiple benchmark problems from the OR-Library with up to 100 jobs and experimental results show that it is very competitive with the existing good performing algorithms.

Keywords

computational complexity; processor scheduling; NP-hard problem; OR-Library; hybrid GRASP heuristic; hybrid heuristic; multiple benchmark problems; path relinking; single machine scheduling problem; single machine total weighted tardiness problem; Ant colony optimization; Benchmark testing; Dispatching; Dynamic programming; Genetic algorithms; Hybrid intelligent systems; Iterative methods; Performance evaluation; Simulated annealing; Single machine scheduling; combinatorial optimization; grasp; job scheduling; metaheuristic; path-relinking;

fLanguage

English

Publisher

ieee

Conference_Titel

Hybrid Intelligent Systems, 2008. HIS '08. Eighth International Conference on

Conference_Location

Barcelona

Print_ISBN

978-0-7695-3326-1

Electronic_ISBN

978-0-7695-3326-1

Type

conf

DOI

10.1109/HIS.2008.156

Filename

4626717