Modified multi-objective firefly algorithm for task scheduling problem on heterogeneous systems
by R. Eswari; S. Nickolas
International Journal of Bio-Inspired Computation (IJBIC), Vol. 8, No. 6, 2016

Abstract: Scheduling an application in a heterogeneous environment to find an optimal schedule is a challenging optimisation problem. Maximising the reliability of the application even when processors fails, adds more complexity to the problem. Both the objectives are conflict in nature, where maximising reliability of the application may increase application's completion time. Meta-heuristic algorithms are playing important role in solving the optimisation problem. In this paper, the applicability and efficiency of the new meta-heuristic algorithm called firefly algorithm to solve the workflow multi-objective task scheduling problem is studied. A modified version of the firefly algorithm (MFA) using weighted sum method and a modified version of multi-objective firefly algorithm (MMOFA) using Pareto-dominance method are proposed to solve the multi-objective task scheduling problem. The simulation results show that the proposed algorithms can be used for producing task assignments and also give significant improvements in terms of generating schedule with minimum makespan and maximum reliability compared with existing algorithms.

Online publication date: Thu, 05-Jan-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com