Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Electronics, Information and Communication Engineering (EICE 2012)

Garry Lee
Garry Lee
Information Engineering Research Institute
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

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.

This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal