Scheduling research grant proposal evaluation meetings and the range colouring problem

Authors:
Patrick Healy
Affiliations:
CS Department, University of Limerick, Limerick, Ireland
Venue:
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Year:
2006

Citing 7
Cited 0

Stabulus: a technique for finding stable sets in large graphs with tabu search

Computing
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn

Information Processing Letters
Algorithmic complexity of list colorings

Discrete Applied Mathematics
A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering
How to Layer a Directed Acyclic Graph

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures

Signal Processing - From signal processing theory to implementation
A Branch-and-Cut algorithm for graph coloring

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

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.