Sunita Dhingra1, Ashwani K. Dhingra1 , Satinder Bal Gupta2 and Ranjit Biswas 1Maharshi Dayanand University, India 2Vaish College of Engineering, India3Jamia Hamdard University, India
ABSTRACT
Present work considers the minimization of the bi-criteria function including weighted sum of makespanand total completion time for a Multiprocessor taskscheduling problem.Genetic algorithm is the mostappealing choice for the different NP hard problemsincluding multiprocessor task scheduling.Performance of genetic algorithm depends on the quality of initial solution as good initial solution providesthe betterresults. Different list scheduling heuristics based hybrid genetic algorithms (HGAs) have beenproposed and developedfor the problem. Computational analysis with the help of defined performanceindex has been conducted on the standard task scheduling problems for evaluating the performance of theproposed HGAs. The analysis shows that the ETF-GA is quite efficient and best among the other heuristicbased hybrid genetic algorithms in terms of solution quality especially for large and complex problems.
KEYWORDS Multiprocessor task scheduling, heuristics, HybridGenetic algorithm, makespan, Total Completion time Original Source URL: http://aircconline.com/acii/V3N4/3416acii03.pdf http://airccse.org/journal/acii/vol3.html
No comments:
Post a Comment