Performance comparison of discrete particle swarm optimisation and shuffled frog leaping algorithm in multiprocessor task scheduling problem
by S. Sarathambekai; K. Umamaheswari
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 9, No. 2/3, 2017

Abstract: Particle swarm optimisation (PSO) and Shuffled frog leaping (SFL) are Swarm Intelligence (SI) based algorithms. SI algorithms are stochastic based optimisation techniques that imitate process inspired from nature. This paper presents a comparative performance of two recent SI based optimisation algorithms such as discrete PSO (DPSO) and SFL in task scheduling problem. Task scheduling (TS) is a complex combinatorial optimisation problem and known to be NP-hard. It is an important challenging issue in distributed systems. Make span, mean flow time and reliability cost are performance criteria used to evaluate the efficiency of the DPSO and SFL algorithms for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the algorithms.

Online publication date: Fri, 17-Mar-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 Advanced Intelligence Paradigms (IJAIP):
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