- 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
Local Search Algorithms for Multiobjective Scheduling Problem | ||
| Al-Rafidain University College For Sciences | ||
| Article 1, Volume 0, Issue 36, 2017, Pages 201-217 | ||
| Author | ||
| Adawiya A. Mahmood Al-Nuaimi | ||
| Abstract | ||
| This paper presents local search algorithms for finding approximation solutions of the multiobjective scheduling problem within the single machine context, where the problem is the sum of the three objectives total completion time, maximum tardiness and maximum late work. Late work criterion estimates the quality of a schedule based on durations of late parts of jobs. Local search algorithms descent method (DM), simulated annealing (SA) and genetic algorithm (GA) are implemented. Based on results of computational experiments, conclusions are formulated on the efficiency of the local search algorithms. | ||
| Keywords | ||
| Local search; multiobjective scheduling; late work criterion; genetic algoritmh | ||
|
Statistics Article View: 141 PDF Download: 44 |
||