Some Algorithms Used in Parallel Machine Scheduling

Authors

  • Adel Alhajjar Unvirsity of Kufa
  • Hussam Abid Ali Mohammed
  • Kareema Abed Al-Kadim

DOI:

https://doi.org/10.31185/wjps.158

Abstract

The paper discusses the challenge of organizing the execution of separate tasks on machines that are otherwise similar. The goal is a lower number of Makes. We create, examine, and evaluate several local search techniques, including the (BAB) , (GA) and   (TS) algorithms. Based on past computational experience, we know that these local search algorithms can efficiently complete up to 2,000 tasks.

References

Downloads

Published

2023-06-29

Issue

Vol. 2 No. 2 (2023)

Section

Mathematics

License

Copyright (c) 2023 Adel Alhajjar, Hussam Abid Ali Mohammed

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Alhajjar, A., Abid Ali Mohammed, H., & Kareema Abed Al-Kadim. (2023). Some Algorithms Used in Parallel Machine Scheduling. Wasit Journal for Pure Sciences, 2(2). https://doi.org/10.31185/wjps.158