Present work considers the minimization of the bi-criteria function including weighted sum of makespan and total completion time for a Multiprocessor task scheduling problem.Genetic algorithm is the most appealing choice for the different NP hard problems including multiprocessor task scheduling. Performance of genetic algorithm depends on the quality of initial solution as good initial solution provides the better results. Different list scheduling heuristics based hybrid genetic algorithms (HGAs) have been proposed and developedfor the problem. Computational analysis with the help of defined performance index has been conducted on the standard task scheduling problems for evaluating the performance of the proposed HGAs. The analysis shows that the ETF-GA is quite efficient and best among the other heuristic based hybrid genetic algorithms in terms of solution quality especially for large and complex problems.
%0 Journal Article
%1 dhingrahybrid
%A Dhingra, Sunita
%D 2016
%J Advanced Computational Intelligence: An International Journal (ACII)
%K Completion Genetic Hybrid Multiprocessor Total algorithm heuristics makespan scheduling task time.
%N 4
%R 10.5121/acii.2016.3403
%T Hybrid Genetic Algorithm for Bi-Criteria Multiprocessor Task Scheduling with Communication Delay
%U http://airccse.org/journal/acii/vol3.html
%V 3
%X Present work considers the minimization of the bi-criteria function including weighted sum of makespan and total completion time for a Multiprocessor task scheduling problem.Genetic algorithm is the most appealing choice for the different NP hard problems including multiprocessor task scheduling. Performance of genetic algorithm depends on the quality of initial solution as good initial solution provides the better results. Different list scheduling heuristics based hybrid genetic algorithms (HGAs) have been proposed and developedfor the problem. Computational analysis with the help of defined performance index has been conducted on the standard task scheduling problems for evaluating the performance of the proposed HGAs. The analysis shows that the ETF-GA is quite efficient and best among the other heuristic based hybrid genetic algorithms in terms of solution quality especially for large and complex problems.
@article{dhingrahybrid,
abstract = {Present work considers the minimization of the bi-criteria function including weighted sum of makespan and total completion time for a Multiprocessor task scheduling problem.Genetic algorithm is the most appealing choice for the different NP hard problems including multiprocessor task scheduling. Performance of genetic algorithm depends on the quality of initial solution as good initial solution provides the better results. Different list scheduling heuristics based hybrid genetic algorithms (HGAs) have been proposed and developedfor the problem. Computational analysis with the help of defined performance index has been conducted on the standard task scheduling problems for evaluating the performance of the proposed HGAs. The analysis shows that the ETF-GA is quite efficient and best among the other heuristic based hybrid genetic algorithms in terms of solution quality especially for large and complex problems.},
added-at = {2020-07-22T11:16:08.000+0200},
author = {Dhingra, Sunita},
biburl = {https://www.bibsonomy.org/bibtex/284fdca14746ae746c272c328c15527b4/janakirob},
doi = {10.5121/acii.2016.3403},
interhash = {b1b5abe2d67f5c0105f2a019ca07220f},
intrahash = {84fdca14746ae746c272c328c15527b4},
journal = {Advanced Computational Intelligence: An International Journal (ACII)},
keywords = {Completion Genetic Hybrid Multiprocessor Total algorithm heuristics makespan scheduling task time.},
month = {October},
number = 4,
timestamp = {2020-07-22T11:16:08.000+0200},
title = {Hybrid Genetic Algorithm for Bi-Criteria Multiprocessor Task Scheduling with Communication Delay},
url = {http://airccse.org/journal/acii/vol3.html},
volume = 3,
year = 2016
}