2012•ASME Press eBooksRequires access

Evaluation of Solution Quality of GRASP and Simulated Annealing+GRASP Metaheuristics in FJSP

Tadeusz Witkowski, Paweł Antczak, Arkadiusz Antczak

Abstract

The paper presents the comparison of solution quality between Greedy Randomized Adaptive Search Procedure (GRASP) and Simulated Annealing (SA) +GRASP metaheuristics in solving of flexible job shop problem (FJSP). Each of the production 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 SA+GRASP algorithm was more competitive than the GRASP algorithm in the solution quality test. The solution quality of the SA+GRASP algorithm changed to a different degree depending on the task being solved.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: GRASP, Metaheuristic, Simulated annealing, Mathematical optimization, Greedy randomized adaptive search procedure, Job shop scheduling, Computer science, Quality (philosophy)