Authors: Shahul Hamid Khan .B
In this paper we address the problem of minimizing makespan in m-machine flow shop environment. This is a NP-hard problem. An attempt has been made to solve this problem using a Metaheuristic called Greedy Randomized Adaptive Search Procedure (GRASP) with new local search algorithm. We consider well-known algorithms such as NEH algorithm  CDS algorithms  for comparison. This algorithm is evaluated by the benchmark problems taken from Taillard . The average percentage deviations for 90 benchmark instances are tabulated.
Keywords: Flow shop scheduling, Makespan, GRASP, Metaheuristic