Scheduling CCRR tournaments

Abstract: In this paper, we construct CCRRS, complete coupling round robin schedules, for n teams each consisting of two pairs. The motivation for these schedules is a problem in scheduling bridge tournaments. We construct for n a positive integer, , with the possible exceptions of . For n odd, we show that a can be constructed using a house with a special property. For n even, a can be constructed from a Howell design, , with a special property called Property P. We use a combination of direct and recursive constructions to construct with Property P. In order to apply our main recursive construction, we need group divisible designs with odd group sizes and odd block sizes. One of our main results is the existence of these group divisible designs. [Copyright &y& Elsevier]