- 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
Proposed method for solving the flow shop scheduling problem for n-jobs on m-machines | ||
| IRAQI JOURNAL OF STATISTICAL SCIENCES | ||
| Article 14, Volume 9, Issue 1, 2009, Pages 227-236 PDF (923.3 K) | ||
| DOI: 10.33899/iqjoss.2009.030635 | ||
| Abstract | ||
| This research suggested a new heuristic method for solving the n-jobs, m- machines flow shop scheduling problem to minimize total completion time. This method was compared with The (NEH) method for data generated by using (matlab) and showed high efficiency and easy to use. | ||
|
Statistics Article View: 327 PDF Download: 234 |
||