@inproceedings{ba0dfb778bcf4c7489965749270fcba0,
title = "Scheduling research grant proposal evaluation meetings and the range colouring problem",
abstract = "In many funding agencies a model is adopted whereby a fixed panel of evaluators evaluate the set of applications. This is then followed by a general meeting where each proposal is discussed by those evaluators assigned to it with a view to agreeing on a consensus score for that proposal. It is not uncommon for some evaluators to be unavailable for the entire duration of the meeting; constraints of this nature, and others, complicate the search for a solution and take it outside the realm of the classical graph colouring problem. In this paper we (a) report on a system developed to ensure the smooth running of such meetings and (b) compare two different ILP formulations of a sub-problem at its core, the list-colouring problem.",
author = "Patrick Healy",
year = "2006",
language = "English",
isbn = "3540773444",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "119--131",
booktitle = "Practice and Theory of Automated Timetabling VI - 6th International Conference, PATAT 2006, Revised Selected Papers",
note = "6th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2006 ; Conference date: 30-08-2006 Through 01-09-2006",
}