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

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.

Downloads

Download data is not yet available.

Downloads

Published

2020-08-28

Issue

Section

Mathematics

How to Cite

Using Heuristic and Branch and Bound Methods to Solve a Multi-Criteria Machine Scheduling Problem. (2020). Iraqi Journal of Science, 61(8), 2055-2069. https://doi.org/10.24996/ijs.2020.61.8.21

Similar Articles

1-10 of 997

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)

1 2 > >>