A table-filling scheduling algorithm for the round robin calendar problem with arbitrary competitors. | [Journal of Theoretical and Applied Information Technology • 2012]

Author(s):

1. Jianyong Li: School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, 450002, China

2. Daoying Huang: School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, 450002, China

3. Anlin Zhang: School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, 450002, China

4. Bing Han: Software Professional 2009 Grade, School of Software At BIT, Beijing, 100081, China

Abstract:

A novel table-filling schedule algorithm is proposed for the round robin calendar problem with arbitrary competitors. Among schedules calendar, the number of rows is the ID of each competitor and elements of the schedule correspond to a certain round serial number of some two competitors. Competition schedule can be completed by the algorithm when the number of competitors is even. If the number of competitors is odd, the schedule will be filled through three steps, even transforming, table filling and even eliminating. It is proved that time and space complexity of the algorithm are allO(n2).

Page(s): 456-461

DOI: DOI not available

Published: Journal: Journal of Theoretical and Applied Information Technology, Volume: 45, Issue: 2, Year: 2012

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views