TY - JOUR ID - TI - Using Heuristic and Branch and Bound Methods to Solve a Multi-Criteria Machine Scheduling Problem AU - Aseel Aboud Jawad* AU - Faez Hassan Ali AU - Wafaa Sayyid Hasanain PY - 2020 VL - 61 IS - 8 SP - 2058 EP - 2069 JO - Iraqi Journal of Science المجلة العراقية للعلوم SN - 00672904 23121637 AB - In this paper, we investigate some methods to solve one of the multi-criteriamachine scheduling problems. The discussed problem is the total completion timeand the total earliness jobs To solve this problem, some heuristicmethods are proposed which provided good results. The Branch and Bound (BAB)method is applied with new suggested upper and lower bounds to solve thediscussed problem, which produced exact results for in a reasonable time.

ER -