Exact and Near Pareto Optimal Solutions for Total Completion Time and Total Late Work Problem

Faez Hassan Ali; Rasha Jalal Mitlif; Wadhah Abdulleh Hussein

doi:10.24996/ijs.2023.64.7.29

Authors

Faez Hassan Ali Mustansiryah University, College of Science, Mathematics Dept., Baghdad, Iraq
Rasha Jalal Mitlif Branch of Mathematics and Computer Applications, Department of Applied Sciences, University of Technology, Baghdad, Iraq https://orcid.org/0000-0001-5033-8753
Wadhah Abdulleh Hussein Mathematics department, College of Science, University of Diyala, Iraq

DOI:

https://doi.org/10.24996/ijs.2023.64.7.29%20%20

Keywords:

Bi-criteria machine scheduling problems, Complete enumeration method, completion time, Late work times

Abstract

In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.