- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
A Genetic Algorithm in Scheduling Processes with Non – Permeability | ||
| TANMIYAT AL-RAFIDAIN | ||
| Article 12, Volume 30, Issue 89, 2008, Pages 245-256 PDF (136.07 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/tanra.2008.161777 | ||
| Authors | ||
| Isra Alkallak; Ruqaya Sha’ban | ||
| Abstract | ||
| Abstract The current paper tackles the combination of the genetic Algorithm with scheduling the multiprocessor by browsing the two algorithms for dependent tasks and non preemptive. The first algorithm is the highest level first estimated time (HLFET), and the second algorithm is smallest co -level first with estimated time (SCFET). The genetic algorithm proved to be powerful, efficient and appeared the feasible solution among many solutions; that minimize the schedule length (execution time) to find the optimal scheduling. In this research, it is proposed a genetic algorithm that finds a good combination of two list algorithms to produce a schedule with shortest schedule length. The results of the experiments showed that scheduling found with the proposed two list scheduling genetic algorithms outperform those found with each one of the two lists scheduling alone. . | ||
| Keywords | ||
| genetic algorithm; Scheduling Processes | ||
|
Statistics Article View: 309 PDF Download: 1,725 |
||