TY - JOUR
ID - 5786
TI - Search method for solving multicriteria scheduling problem
JO - International Journal of Nonlinear Analysis and Applications
JA - IJNAA
LA - en
SN - 2008-6822
AU - Adel Abbas, Doha
AD - Department of Mathematics, College of Science, University of Al-Mustansiriyah, Bagdad, Iraq
Y1 - 2022
PY - 2022
VL - 13
IS - 1
SP - 1709
EP - 1720
KW - Descent Method(DM)
KW - Genetic Algorithm(GA)
KW - Maximum tardiness
KW - multi-objective optimization
KW - Simulated annealing ((SA))
KW - Total Number of Late job
KW - Total Tardiness
DO - 10.22075/ijnaa.2022.5786
N2 - Our research includes studying the case $ 1 // F(\sum U_i ,\sum Ti ,T_{max})$ minimized the cost of a three-criteria objective function on a single machine for scheduling n jobs. and divided this into several partial problems and found simple algorithms to find the solutions to these partial problems and compare them with the optimal solutions. This research focused on one of these partial problems to find minimize a function of sum cost of $ (\sum U_i) $ sum number of late job and $ (\sum Ti) $ sum Tardiness and $ (T_{max} ) $ the Maximum Tardiness for n job on the single machine, which is NP-hard problem, first found optimal solutions for it by two methods of Complete Enumeration technique(CEM) and Branch and Bounded ((BAB)). Then use some Local search methods(Descent technique(DM), Simulated Annealing (SA) and Genetic Algorithm (GA)), Develop algorithm called ((A)) to find a solution close to the optimal solution. Finally, compare these methods with each other.
UR - https://ijnaa.semnan.ac.ir/article_5786.html
L1 - https://ijnaa.semnan.ac.ir/article_5786_6b58843bdbe7fdc6b9c3bff708f64fce.pdf
ER -