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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akbari, S., Fana, H.-R.: Some relations among term rank, clique number and list chromatic number of a graph. Discrete Mathematics 306, 3078–3082 (2006)
Alt, H., Blum, N., Mehlhorn, K., Paul, M.: Computing a maximum cardinality matching in a bipartite graph in time \(o(n^{1.5} \sqrt{m/\log n})\). Information Processing Letters 37, 237–240 (1991)
Burke, E.K., de Werra, D., Kingston, J.: Applications to timetabling. In: Handbook of Graph Theory, ch. 5.6, Chapman and Hall/CRC Press, London (2004)
Burke, E.K., Jackson, K.S., Kingston, J.H., Weare, R.F.: Automated timetabling: The state of the art. The Computer Journal 40, 565–571 (1997)
Cook, W.D., Golany, B., Penn, M., Raviv, T.: Creating a consensus ranking of proposals from reviewers’ partial ordinal rankings. Computers and Operations Research 34, 954–965 (2007)
Friden, C., Hertz, A., de Werra, D.: STABULUS: A technique for finding stable sets in large graphs with tabu search. Computing 42, 35–44 (1989)
Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19, 214–230 (1993)
Healy, P., Nikolov, N.S.: How to layer a directed acyclic graph. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 16–30. Springer, Heidelberg (2002)
KratochvÃl, J., Tuza, Z.: Algorithmic complexity of list colorings. Discrete Applied Mathematics 50, 297–302 (1994)
Méndez-DÃaz, I., Zabala, P.: A branch-and-cut algorithm for graph coloring. Discrete Applied Mathematics 154, 826–847 (2006)
Tuza, Z.: Graph colorings with local constraints. Discussiones Mathematicae, Graph Theory 17, 161–228 (1997)
Vizing, V.G.: Coloring the vertices of a graph in prescribed colors (in Russian). Metody Diskretnogo Analiza v Teorii Kodov i Schem 29, 3–10 (1976)
Wood, D.C.: A technique for coloring a graph applicable to large-scale timetabling problems. The Computer Journal 12, 317–322 (1969)
Zeitlhofer, T., Wess, B.: List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures. Signal Processing 83, 1411–1425 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Healy, P. (2007). Scheduling Research Grant Proposal Evaluation Meetings and the Range Colouring Problem. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-77345-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77344-3
Online ISBN: 978-3-540-77345-0
eBook Packages: Computer ScienceComputer Science (R0)