Graham Kendall
Various Images

Professor Graham Kendall

Professor Graham Kendall is the Provost and CEO of The University of Nottingham Malaysia Campus (UNMC). He is also a Pro-Vice Chancellor of the University of Nottingham.

He is a Director of MyResearch Sdn Bhd, Crops for the Future Sdn Bhd. and Nottingham Green Technologies Sdn Bhd. He is a Fellow of the British Computer Society (FBCS) and a Fellow of the Operational Research Society (FORS).

He has published over 230 peer reviewed papers. He is an Associate Editor of 10 journals and the Editor-in-Chief of the IEEE Transactions of Computational Intelligence and AI in Games.

News

I have published a number of papers on Cutting and Packing
http://bit.ly/dQPw7T
Can ants play chess? Yes they can!
http://bit.ly/1yW3UhX

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

3D Bin Packing, help Santa and share $10,000

Publication(s)

Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling
http://bit.ly/h17mwh
Towards the 'Decathlon 'Challenge' of search heuristics
http://bit.ly/edfHGs
Studying the Effect that a Linear Transformation has on the Time-Series Prediction Ability of an Evolutionary Neural Network
http://bit.ly/eyLaq2
Evaluation of Two Dimensional Bin Packing Problem using the No Fit Polygon
http://bit.ly/dIcplc

Graham Kendall: Details of Requested Publication


Citation

Kahar, M.N. M. and Kendall, G Universiti Malaysia Pahang examination timetabling problem: scheduling invigilators. Journal of the Operational Research Society, 65 (2): 214-226, 2014.

ISSN: 0160-5682


Abstract

This paper presents a real-world examination timetabling problem from Universiti Malaysia Pahang (UMP), Malaysia. The problem involves assigning invigilators to examination rooms. This problem has received less attention than the examination timetabling problem from the research community partly because no data sets are available in the literature. In modelling, and solving, this problem we assume that there is already an examination timetable in place (this was the subject of our previous work) and the task is to assign invigilators to that timetable. The contributions of this paper are to formally define the invigilator scheduling problem and to present a constructive algorithm that is able to produce good quality solutions that are superior to the solutions produced when using the university’s current software. We also include additional constraints taking into account the comments made by the invigilators, which the current system fails to capture. The model we present, we believe, accurately reflects the real-world problem, capturing various aspects of the problem that have not been presented before in the scientific literature. Moreover, the proposed approach adheres to all hard constraints, which the university’s current system fails to do.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1057/jors.2012.6 You can link directly to the original paper, via the doi, from here

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information


Journal Rankings


ISI Web of Knowledge Journal Citation Reports

The Web of Knowledge Journal Citation Reports (often known as ISI Impact Factors) help measure how often an article is cited. You can get an introduction to Journal Citation Reports here. Below I have provided the ISI impact factor for the jourrnal in which this article was published. For complete information I have shown the ISI ranking over a number of years, with the latest ranking highlighted.

2014 (0.953), 2013 (0.911), 2012 (0.989), 2011 (0.971), 2010 (1.102), 2009 (1.009), 2008 (0.839), 2007 (0.784), 2006 (0.597), 2005 (0.603), 2004 (0.515), 2003 (0.416), 2002 (0.493), 2001 (0.438), 2000 (0.648)

URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@ARTICLE{kk2014, author = {M.N. Mohmad Kahar and G. Kendall},
title = {Universiti Malaysia Pahang examination timetabling problem: scheduling invigilators},
journal = {Journal of the Operational Research Society},
year = {2014},
volume = {65},
pages = {214--226},
number = {2},
note = {ISSN: 0160-5682},
abstract = {This paper presents a real-world examination timetabling problem from Universiti Malaysia Pahang (UMP), Malaysia. The problem involves assigning invigilators to examination rooms. This problem has received less attention than the examination timetabling problem from the research community partly because no data sets are available in the literature. In modelling, and solving, this problem we assume that there is already an examination timetable in place (this was the subject of our previous work) and the task is to assign invigilators to that timetable. The contributions of this paper are to formally define the invigilator scheduling problem and to present a constructive algorithm that is able to produce good quality solutions that are superior to the solutions produced when using the university’s current software. We also include additional constraints taking into account the comments made by the invigilators, which the current system fails to capture. The model we present, we believe, accurately reflects the real-world problem, capturing various aspects of the problem that have not been presented before in the scientific literature. Moreover, the proposed approach adheres to all hard constraints, which the university’s current system fails to do.},
doi = {10.1057/jors.2012.6},
issn = {0160-5682},
owner = {Graham},
timestamp = {2013.08.03},
webpdf = {http://www.graham-kendall.com/papers/kk2014.pdf} }