Scheduling research grant proposal evaluation meetings and the range colouring problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationPractice and Theory of Automated Timetabling VI - 6th International Conference, PATAT 2006, Revised Selected Papers
PublisherSpringer Verlag
Pages119-131
Number of pages13
ISBN (Print)3540773444, 9783540773443
Publication statusPublished - 2006
Event6th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2006 - BRNO, Czech Republic
Duration: 30 Aug 20061 Sep 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3867 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2006
Country/TerritoryCzech Republic
CityBRNO
Period30/08/061/09/06

Fingerprint

Dive into the research topics of 'Scheduling research grant proposal evaluation meetings and the range colouring problem'. Together they form a unique fingerprint.

Cite this