An improved genetic algorithm for solving the multiprocessor scheduling problem
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 algor...
Saved in:
Main Authors: | Alshaikhli, Imad Fakhri Taha, Khalil, Ismail |
---|---|
Format: | Article |
Language: | English English |
Published: |
INSI Publications
2011
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/8914/1/imad-fakhri.pdf http://irep.iium.edu.my/8914/4/An_improved_genetic.pdf http://irep.iium.edu.my/8914/ http://www.insipub.com/ajbas.html |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A practical method for the analysis of genetic algorithms
by: Alshaikhli, Imad Fakhri Taha
Published: (2011) -
Multi-round divisible real-time scheduling algorithm on multiprocessor platforms
by: Razmara, Pegah
Published: (2015) -
Applying divisible load theory in real-time multiprocessor scheduling
by: Chuprat, Suriayati, et al.
Published: (2008) -
Task scheduling
by: Shah, Asadullah, et al.
Published: (2011) -
Rational drug design using genetic algorithm: case of malaria disease
by: Al-Safi, Hassen Mohammed, et al.
Published: (2012)