An improved genetic algorithm for solving the multiprocessor scheduling problem

Alshaikhli, Imad Fakhri Taha and Khalil, Ismail (2011) An improved genetic algorithm for solving the multiprocessor scheduling problem. Australian Journal of Basic and Applied Sciences. ISSN 1991-8178 (In Press)

	PDF (An improved genetic algorithm for solving the multiprocessor scheduling problem) - Accepted Version Restricted to Repository staff only Download (81kB) | Request a copy
Preview	PDF Download (71kB) | Preview

Abstract

Multiprocessor Scheduling Problem (MSP) is an NP-complete optimization problem. The applications of this problem are numerous, but are, as suggested by the name of the problem, most strongly associated with the scheduling of computational tasks in a multiprocessor environment. Many methods and algorithms were suggested to solve this problem due to its importance. Genetic algorithms were among the suggested methods. In this research, sound improvements were done on one of the known papers [3]. Results show very good improvements in increasing the percentage of getting the exact solution as well as decreasing the number of generations needed to converge.

Item Type:	Article (Journal)
Additional Information:	6534/8914
Uncontrolled Keywords:	multiprocessor scheduling problem, genetic algorithms, list scheduler, optimization
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Professor Imad Taha
Date Deposited:	19 Dec 2011 22:22
Last Modified:	10 Feb 2012 15:04
URI:	http://irep.iium.edu.my/id/eprint/8914

Actions (login required)

View Item