- 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
Exact and Local Search Methods For Three Machine Flow Shop with Transportation Times | ||
| Al-Mustansiriyah Journal of Science | ||
| Article 1, Volume 21, Issue 7, 2010, Pages 54-85 | ||
| Author | ||
| Abstract | ||
| This paper considers the problem of scheduling 'n' jobs on three machine flow shop with transportation times between the machines to minimize the maximum completion time. This problem is known as NP-hard. Theoretically, results concerning optimality for two special cases of the problem are given. Special attention is also given to branch and bound (BAB) and local search methods. The BAB algorithms use the quickly computed but possibly rather weak lower bounds obtained from relaxation of machines capacity constraints. The (BAB) algorithms are then tested on a large set of test problems. Also, we develop, compare and test different local search methods (Descent, Simulation Annealing, Threshold Accepting, Tabu Search, Genetic Algorithm, Ant Colony Algorithm) for the problem. Computational experience is found that these local search algorithms solve the problem to 7000 jobs with reasonable time. | ||
|
Statistics Article View: 173 PDF Download: 136 |
||