- 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
Exerct and Near Optimal Solution for Three Machine Flow Shop Scheduling | ||
| Journal of College of Education | ||
| Article 1, Volume 0, Issue 3, 2017, Pages 50-63 | ||
| Authors | ||
| Tariq S. Abdul-Razaq; Manal H. AL-Harby | ||
| Abstract | ||
| In this paper we consider F3/ /C.o* problem in which the processing order is assumed to be the same on each machine, the resulting problem is called the permutation flow shop problem. The objective is to find a processing order on each machine such that the makespan C*o* , which is the completion time of the last job is minimized. This problem is NP-hard, hence the existence of a polynomial time algorithm for finding an optimal solution is unlikely. This complexity result leads us to use an enumeration solution approach. In this paper rve proposc a branch and bound al-eorithm to solve this problem. Also we develop fast approximation algorithms yielding near optimal solution. We | ||
|
Statistics Article View: 106 PDF Download: 58 |
||