The heuristic and metahuristic methods to minimize the total completion and total tardiness jobs times problem
نویسندگان
1 Department of Mathematics, Faculty of Science, Mustansiriyah University, Baghdad, IRAQ
2 Mathematics Department, College of Science, University of Diyala, Iraq
doi
10.22075/ijnaa.2022.6548چکیده
In this paper, we found some methods for solving one of the bicriteria machine scheduling problems (BMSP). Our discussed problem is represented by the total completion and the total tardiness jobs times $(1//(\sum C_j,\sum T_j))$ simultaneously. In order to solve the suggested BMSP, some new heuristic and metaheuristic methods are proposed which are produced good results. The results of the new suggested methods are compared with the exact method; like the complete enumeration method (CEM) and Branch and Bound (BAB) method, then compared results of the heuristics with each other's to obtain to the most efficient method.
