No Detail Found!

A table-filling scheduling algorithm for the round robin calendar problem with arbitrary competitors.

Author(s)
Jianyong Li School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, 450002, China
Daoying Huang School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, 450002, China
Anlin Zhang School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, 450002, China
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).
Publication Details
Page(s) 456-461
DOI DOI not available
Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 45, Issue: 2, Year: 2012

Request the full text from PASTIC

More from Journal of Theoretical and Applied Information Technology
0

Citations

0

Downloads

37

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk