Local search algorithms for multiobjective scheduling problem
Other Title(s)
خوارزميات بحث محلية لمسألة جدولة متعددة الأهداف
Author
al-Nuaymi, Adawiyah Ali Mahmud
Source
Journal of al-Rafidain University College
Issue
Vol. 2015, Issue 36 (31 Dec. 2015), pp.201-217, 17 p.
Publisher
al-Rafidain University College
Publication Date
2015-12-31
Country of Publication
Iraq
No. of Pages
17
Main Subjects
Natural & Life Sciences (Multidisciplinary)
Abstract EN
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.
American Psychological Association (APA)
al-Nuaymi, Adawiyah Ali Mahmud. 2015. Local search algorithms for multiobjective scheduling problem. Journal of al-Rafidain University College،Vol. 2015, no. 36, pp.201-217.
https://search.emarefa.net/detail/BIM-825216
Modern Language Association (MLA)
al-Nuaymi, Adawiyah Ali Mahmud. Local search algorithms for multiobjective scheduling problem. Journal of al-Rafidain University College No. 36 (2015), pp.201-217.
https://search.emarefa.net/detail/BIM-825216
American Medical Association (AMA)
al-Nuaymi, Adawiyah Ali Mahmud. Local search algorithms for multiobjective scheduling problem. Journal of al-Rafidain University College. 2015. Vol. 2015, no. 36, pp.201-217.
https://search.emarefa.net/detail/BIM-825216
Data Type
Journal Articles
Language
English
Notes
Record ID
BIM-825216