- 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
Solvable Special Cases for Flow Shop Scheduling Problem Involving Transportation Time | ||
| Al-Mustansiriyah Journal of Science | ||
| Article 1, Volume 24, Issue 5, 2013, Pages 243-252 | ||
| Author | ||
| Niran Abbas Ali | ||
| Abstract | ||
| This study considers the problem of scheduling n-jobs on m-machines with transportation time between machines to minimize the maximum completion time,Makespan. This problem, when there is no transportation time, is considered NP-hard, while the problem with transportation time is considered more difficult to solve. Theoretically, we derive and prove 13 results concerning optimality of special cases for the problem with ten algorithms. | ||
|
Statistics Article View: 131 PDF Download: 74 |
||