- 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 hybrid lower bound for multi-processor task scheduling problems in multi-stage hybrid flow shop environment | ||
| IRAQI JOURNAL OF STATISTICAL SCIENCES | ||
| Article 30, Volume 10, Issue 1, 2010, Pages 261-274 PDF (0 K) | ||
| DOI: 10.33899/iqjoss.2010.029111 | ||
| Abstract | ||
| In this paper, a lower bound for the optimal makespan value have been improved (Hybrid lower bound) which can be used to evaluate the performance algorithm for multi-processor task scheduling problems in multi-stage FSMP(flow shop with multi-processor). So, the values of hybrid lower bounds can be used as an optimal solution when the problems are small size. After applying the hybrid bounds, the result has shown that the bounds are efficient in estimating the optimal makespen value. In addition, the high competence of this program in calculating the lower bound and execution speed are proofed | ||
|
Statistics Article View: 308 PDF Download: 204 |
||