- 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
Approximation Solutions For Multicriteria Scheduling Problems | ||
| Al-Rafidain University College For Sciences | ||
| Article 1, Volume 0, Issue 34, 2017, Pages 161-179 | ||
| Author | ||
| Adawiyah A. Mahmood Al-Nuaimy | ||
| Abstract | ||
| This paper presents local search algorithms for finding approximation solutions of the multicriteria scheduling problems within the single machine context, where the first problem is the sum of maximum tardiness and maximum late work and the second problem is the sum of total late work 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; genetic algorithm; late work criterion; multicriteria scheduling | ||
|
Statistics Article View: 170 PDF Download: 119 |
||