Volume 13 Number 11 (Nov. 2018)
Home > Archive > 2018 > Volume 13 Number 11 (Nov. 2018) >
JCP 2018 Vol.13(11): 1309-1315 ISSN: 1796-203X
doi: 10.17706/jcp.13.11.1309-1315

Tuples: A New Scheduling Algorithm

Afaf Abdelkader Abdelhafiz
Dept. of Mathematics, Computer Science Division, Faculty of Science, Al-Azhar University, Cairo, Egypt.
Abstract—Scheduling is the process of allocating tasks to resources in order to optimize an objective function. Researchers developed many algorithms to schedule tasks on their resources such as max-min, Enhanced max-min, Improved algorithm 1 on max-min, MASA, e-MASA, ACTA and HASA scheduling algorithms. These algorithms aim to minimize the makespan of the resulting schedule. This paper proposes an algorithm which improves the time complexity required for the discussed problem. The analysis shows that the proposed algorithm has less time complexity than the above algorithms.

Index Terms—Tuples algorithm, scheduling, scheduling algorithms, max-min algorithm, min-min algorithm, enhanced max-min scheduling algorithm, MASA, e-MASA, ACTA and HASA algorithm.

[PDF]

Cite: Afaf Abdelkader Abdelhafiz, "Tuples: A New Scheduling Algorithm," Journal of Computers vol. 13, no. 11, pp. 1309-1315, 2018.

General Information

ISSN: 1796-203X
Frequency: Monthly (2006-2014); Bimonthly (Since 2015)
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Sep 13, 2018 News!

    Vol 13, No 10 has been published with online version   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Feb 22, 2019 News!

    Vol 14, No 2 has been published with online version 8 papers are published in this issue after peer review   [Click]

  • Jan 04, 2019 News!

    Vol 14, No 1 has been published with online version   [Click]

  • Nov 20, 2018 News!

    Vol 13, No 12 has been published with online version 10 papers are published in this issue after peer review

  • Read more>>