Article ID: | iaor20084404 |
Country: | United Kingdom |
Volume: | 84 |
Issue: | 12 |
Start Page Number: | 1731 |
End Page Number: | 1741 |
Publication Date: | Dec 2007 |
Journal: | International Journal of Computer Mathematics |
Authors: | Prabhaharan G., Asokan P., Khan B. Shahul Hamid |
Keywords: | heuristics |
In this paper we address the problem of minimizing the weighted sum of makespan and maximum tardiness in an m-machine flow shop environment. This is a NP-hard problem in the strong sense. An attempt has been made to solve this problem using a metaheuristic called Greedy Randomized Adaptive Search Procedure (GRASP). GRASP is a competitive algorithm and is a meta-heuristic for solving combinatorial optimization problems. We have customized the basic concepts of GRASP algorithm to solve a bicriteria flow shop problem and a new algorithm named B-GRASP (Bicriteria GRASP algorithm) is proposed. The new proposed algorithm is evaluated using benchmark problems taken from Taillard and compared with the existing simulated annealing based heuristic developed by Chakravarthy and Rajendran. Computational experiments indicate that the proposed algorithm is much better than the existing one in all cases.