%0 Journal Article %1 sunitadhingrasatinderbalgupta2014hybrid %A Sunita Dhingra, Satinder Bal Gupta, Ranjit Biswas %D 2014 %J Computer Applications: An International Journal (CAIJ) %K computer %N 1 %P 1-11 %T HYBRID GASA FOR BI-CRITERIA MULTIPROCESSOR TASK SCHEDULING WITH PRECEDENCE CONSTRAINTS %U http://airccse.com/caij/papers/1114caij02.pdf %V 1 %X Task scheduling on different processors with precedence constraints is NP hard and finds a prominent place in the field of parallel computing and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Amongst the metaheuristics, Simulated Annealing (SA) and Genetic Algorithm (GA) represent the powerful combinatorial optimization methods with corresponding strengths and weaknesses. Borrowing the respective advantages of the two paradigms, an effective combination of GA and SA called hybrid GASA has been proposed for multiprocessor task scheduling problems with precedence constraints. The bi-criteria objective function, including the weighted sum of makespan and total completion has been considered for the analysis. Comparative analysis with the help of defined performance index on the standard problems shows that the proposed hybrid GASA provides better results when compared to simple GA and SA alone in terms of solution quality.

@article{sunitadhingrasatinderbalgupta2014hybrid, abstract = {Task scheduling on different processors with precedence constraints is NP hard and finds a prominent place in the field of parallel computing and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Amongst the metaheuristics, Simulated Annealing (SA) and Genetic Algorithm (GA) represent the powerful combinatorial optimization methods with corresponding strengths and weaknesses. Borrowing the respective advantages of the two paradigms, an effective combination of GA and SA called hybrid GASA has been proposed for multiprocessor task scheduling problems with precedence constraints. The bi-criteria objective function, including the weighted sum of makespan and total completion has been considered for the analysis. Comparative analysis with the help of defined performance index on the standard problems shows that the proposed hybrid GASA provides better results when compared to simple GA and SA alone in terms of solution quality. }, added-at = {2018-02-14T05:05:12.000+0100}, author = {{Sunita Dhingra, Satinder Bal Gupta}, Ranjit Biswas}, biburl = {https://www.bibsonomy.org/bibtex/2bf112589325e4c86a8865c53ccb87452/caij}, interhash = {761274e6c19a8b61d844f94b28f53dd3}, intrahash = {bf112589325e4c86a8865c53ccb87452}, journal = {Computer Applications: An International Journal (CAIJ)}, keywords = {computer}, month = {2014/08}, number = 1, pages = {1-11}, timestamp = {2018-02-14T05:05:12.000+0100}, title = {HYBRID GASA FOR BI-CRITERIA MULTIPROCESSOR TASK SCHEDULING WITH PRECEDENCE CONSTRAINTS }, url = {http://airccse.com/caij/papers/1114caij02.pdf}, volume = 1, year = 2014 }