Some Algorithms Used in Parallel Machine Scheduling
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 computationa...
Main Authors: | Adel Alhajjar, Hussam Abid Ali Mohammed, Kareema Abed Al-Kadim |
---|---|
Format: | Article |
Language: | English |
Published: |
College of Education for Pure Sciences
2023-06-01
|
Series: | Wasit Journal for Pure Sciences |
Online Access: | https://wjps.uowasit.edu.iq/index.php/wjps/article/view/158 |
Similar Items
-
Some theorems of minimizing makespan and range of lateness of flow shop machines
by: Nouri Adel Hashem, et al.
Published: (2024-01-01) -
IDENTICAL PARALLEL MACHINES SCHEDULING USING GENETIC ALGORITHM
by: Aseel J Haleel
Published: (2018-08-01) -
Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources
by: Abed, Munther Hameed, et al.
Published: (2022) -
A hybrid algorithm for unrelated parallel machines scheduling
by: Mohsen Shafiei Nikabadi, et al.
Published: (2016-09-01) -
An Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling
by: Chou, Mabel, et al.
Published: (2003)