International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 172 - Issue 8 |
Published: Aug 2017 |
Authors: Afaf Abd Elkader Abd Elhafiz |
![]() |
Afaf Abd Elkader Abd Elhafiz . ACTA: Average of Completion Times Algorithm. International Journal of Computer Applications. 172, 8 (Aug 2017), 18-22. DOI=10.5120/ijca2017915193
@article{ 10.5120/ijca2017915193, author = { Afaf Abd Elkader Abd Elhafiz }, title = { ACTA: Average of Completion Times Algorithm }, journal = { International Journal of Computer Applications }, year = { 2017 }, volume = { 172 }, number = { 8 }, pages = { 18-22 }, doi = { 10.5120/ijca2017915193 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2017 %A Afaf Abd Elkader Abd Elhafiz %T ACTA: Average of Completion Times Algorithm%T %J International Journal of Computer Applications %V 172 %N 8 %P 18-22 %R 10.5120/ijca2017915193 %I Foundation of Computer Science (FCS), NY, USA
Scheduling is the process of allocating tasks to resources with the aim of optimizing some objective functions. Many algorithms are developed to schedule tasks on their resources. Some of these algorithms are max-min, Enhanced max-min, Improved algorithm 1 on max-min, MASA and e-MASA scheduling algorithms. This paper proposes an algorithm ACTA (Average of Completion Times Algorithm) to improve the makespan produced by these algorithms. The results show that the makespan produced by ACTA is smaller than those produced by the above algorithms.