科研之友
微信
新浪微博
Facebook
分享链接
摘要
The round robin tournament scheduling problem widely exists in the computer science and communication area. In this paper, we propose a novel round robin tournament scheduling algorithm under arbitrary entrants by the means of divide and conquer approach. First, we transform the original non-2k entrant tournament scheduling problem to its equivalent problem with even entrants, by which we can tackle the intersection term of the different element problems during the division and combination procedure. Then we show that there exists a solution to the arbitrary entrant round robin scheduling problem and propose a scheduling algorithm correspondingly. Numerical example is proposed to demonstrate the effectiveness of the algorithm.
