- 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 TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING | ||
| IRAQI JOURNAL OF STATISTICAL SCIENCES | ||
| Article 3, Volume 13, Issue 1, 2013, Pages 11-26 PDF (0 K) | ||
| DOI: 10.33899/iqjoss.2013.075435 | ||
| Author | ||
| MANAL ABDULKAREEM ZEIDAN | ||
| Abstract | ||
| The aim of this paper is to propose genetic algorithm to finding the optimal schedule with minimum makespan for n jobs in flow shop environment with three machines. In this pape, a new approach for selection, a new crossover operation (3PLOX) and a new stopping criteria based on the lower bound of the makespan (LB) are proposed.Also, a new procedure of calculating the make span for n jobs at processing by three machine in flow shop environment is suggested. In order to examine the effectiveness of the proposed GA, a comparison was made with Johnson's algorithm. After the application on several problems which generated randomly by uniform distribution, the results showed that the proposed GA is better than Johnson's algorithm with rate 94% in finding the optimal sequence for scheduling jobs which gives optimal makespan. | ||
|
Statistics Article View: 358 PDF Download: 216 |
||