Greedy Randomized Adaptive Search Procedure (GRASP)

Greedy Randomized Adaptive Search Procedure (GRASP) employs a randomized min-min completion time algorithm for initial solution generation, followed by a variable neighborhood descent algorithm for solution refinement.