Multistage multiprocessor task scheduling in hybrid flow shop problems using discrete firefly algorithm
by A. Delphin Carolina Rani; B.S.E. Zoraida
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 8, No. 4, 2016

Abstract: Task scheduling aims to allocate the tasks to the set of available processors. To minimise the total execution time of the application, the scheduling with proper arrangement of the tasks on each processor is important. In real time computing and industrial applications, this scheduling problem is faced frequently. By considering today's industrial applications and needs, this paper considers the multistage multiprocessor task scheduling in hybrid flow shop (HFS) environment. To solve such an issue, a novel discrete firefly algorithm (DFA) which is recently developed and motivated by social behaviour of fireflies is employed. The effectiveness of the proposed approaches is tested experimentally and performance study is documented. The results of the algorithms are compared with other meta heuristics algorithms and conclusions are presented.

Online publication date: Mon, 07-Nov-2016

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 subs@inderscience.com