- 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
Multi-Objective Variable Neighborhood Search Algorithms | ||
| journal of kerbala university | ||
| Article 1, Volume 11, Issue 4, 2015, Pages 1-17 PDF (0 K) | ||
| Authors | ||
| Tariq Salih Abdul-Razaq; Hussam Abid Ali Mohammed | ||
| Abstract | ||
| The Multi-Objective Single Machine Scheduling (MOSMS) Problem is one of the most representative problems in the scheduling area. In this paper, we compare five multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the MOSMS problem. In this problem, we consider minimizing the total completion times and minimizing the sum of maximum earliness/tardiness. We introduce two intensification procedures to improve a Multi-Objective Variable Neighborhood Search (MOVNS) algorithms proposed in the literature. The performance of the algorithms is tested on a set of instances of the problem. The computational results show that the proposed algorithms outperform the original MOVNS algorithms in terms of efficiency solutions. | ||
| Keywords | ||
| Scheduling; Single machine; Maximum earliness; Completion times; Efficient solution; Variable neighborhood search algorithms | ||
|
Statistics Article View: 158 PDF Download: 57 |
||