Comparison of optimality and robustness between SA, TS and GRASP metaheuristics in FJSP problem

Authors:
Tadeusz Witkowski;Arkadiusz Antczak;Paweł Antczak
Affiliations:
Warsaw University of Technology, Warsaw, Poland;Warsaw University of Technology, Warsaw, Poland;Warsaw University of Technology, Warsaw, Poland
Venue:
ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Year:
2010

Citing 6
Cited 0

Sensitivity analysis of list scheduling heuristics

Discrete Applied Mathematics
Algorithms and Theory of Computation Handbook

Algorithms and Theory of Computation Handbook
Sensitivity Analysis for Scheduling Problems

Journal of Scheduling
Design and Analysis of Experiments

Design and Analysis of Experiments
Metaheuristics: From Design to Implementation

Metaheuristics: From Design to Implementation
Approach by localization and multiobjective evolutionaryoptimization for flexible job-shop scheduling problems

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents the comparison of optimality and robustness between Greedy Randomized Adaptive Search Procedure (GRASP), Simulated Annealing (SA) and Tabu Search (TS) metaheuristics in solving of flexible job shop problem (FJSP). Each of the scheduling problems have been tested with metaheuristics and have been run a number of times to get the best solution. All the results have been analyzed on certain parameter of performance for the metaheuristics - makespan. Overall, testing showed that the TS+GRASP algorithm was slightly more competitive than the SA+GRASP algorithm in the optimality and robustness test. The robustness of the algorithm increased as the best solutions produced by the algorithm were closer to the know optimal.