Constructing sailing match race schedules: round-robin pairing lists

Macdonald, C. , McCreesh, C., Miller, A. and Prosser, P. (2015) Constructing sailing match race schedules: round-robin pairing lists. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 671-686. ISBN 9783319232188 (doi: 10.1007/978-3-319-23219-5_46)

107585.pdf - Accepted Version



We present a constraint programming solution to the problem of generating round-robin schedules for sailing match races. Our schedules satisfy the criteria published by the International Sailing Federation (ISAF) governing body for match race pairing lists. We show that some published ISAF schedules are in fact illegal, and present corresponding legal instances and schedules that have not previously been published. Our schedules can be downloaded as blanks, then populated with actual competitors and used in match racing competitions.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Macdonald, Professor Craig and Miller, Professor Alice and Prosser, Dr Patrick and Mccreesh, Dr Ciaran
Authors: Macdonald, C., McCreesh, C., Miller, A., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2015 Springer International Publishing
First Published:First published in Lecture Notes in Computer Science 9255:671-686
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record