A Table-filling Scheduling Algorithm for the round Robin Calendar Problem with Arbitrary Competitors

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… (More)

Topics

8 Figures and Tables

Slides referencing similar topics