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)

[img]
Preview
Text
107585.pdf - Accepted Version

427kB

Abstract

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
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Macdonald, Dr Craig and Miller, Dr Alice and Mccreesh, Dr Ciaran and Prosser, Dr Patrick
Authors: Macdonald, C., McCreesh, C., Miller, A., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
ISSN:0302-9743
ISBN:9783319232188
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