Using Heuristic and Branch and Bound Methods to Solve a Multi-Criteria Machine Scheduling Problem

Aseel Aboud  Jawad; Faez Hassan  Ali; Wafaa Sayyid  Hasanain

doi:10.24996/ijs.2020.61.8.21

Authors

Aseel Aboud Jawad Mustansiryah University, College of Science, Mathematics Department, Baghdad, Iraq
Faez Hassan Ali Mustansiryah University, College of Science, Mathematics Department, Baghdad, Iraq
Wafaa Sayyid Hasanain Mustansiryah University, College of Science, Mathematics Department, Baghdad, Iraq

DOI:

https://doi.org/10.24996/ijs.2020.61.8.21

Keywords:

Machine Scheduling problem, completion time, earliness, Branch and Bound

Abstract

In this paper, we investigate some methods to solve one of the multi-criteria machine scheduling problems. The discussed problem is the total completion time and the total earliness jobs To solve this problem, some heuristic methods are proposed which provided good results. The Branch and Bound (BAB) method is applied with new suggested upper and lower bounds to solve the discussed problem, which produced exact results for in a reasonable time.