An enterprise system component based on graph colouring for exam timetabling-Reference-Cited by-同舟云学术

An enterprise system component based on graph colouring for exam timetabling

Published:2007-09-01 Issue:3 Volume:1 Page:255-270
ISSN:1750-6166
Container-title:Transforming Government: People, Process and Policy
language:en
Short-container-title:

Author:

Dammak Abdelaziz,Elloumi Abdelkarim,Kamoun Hichem

Abstract

PurposeThis paper aims to consider the exam timetabling of the re‐sit session in the Faculty of Economics and Management Sciences of Sfax. The objective is to find a timetable which minimizes the number of timeslots for exams required by the enrolled students.Design/methodology/approachTwo heuristic procedures based on graph colouring are developed and tested on real data to solve the exam timetabling problem at the faculty.FindingsThese heuristics were tested on a simple example which shows the out‐performance of the second heuristic compared with the first one. When tested with the real data of the faculty, exam size heuristic provides a timetable with a shorter timeframe; however, the timetable obtained from the second heuristic is of better quality.Originality/valueThe main contribution of this paper is to create an automated exam timetabling that helps the faculty to manage its own enterprise system.

Publisher

Emerald

Subject

Information Systems and Management,Computer Science Applications,Public Administration

Reference41 articles.

1. Appleby, J.S., Blake, D.V. and Newman, E.A. (1961), “Techniques for producing school timetables on computer and their application to other scheduling problems”, The Computer Journal, Vol. 3 No. 4, pp. 237‐45.

2. Arnold, V. (2006), “Behavioral research opportunities: understanding the impact of enterprise systems”, International Journal of Accounting Information Systems, Vol. 7, pp. 7‐17.

3. Burke, E.K. and Newall, J.P. (2002), “Enhancing timetable solutions with local search methods”, in Burke, E.K. and De Causmeaker, P. (Eds), Proceedings of the Fourth International Conference on the Practice and Theory of Automated Timetabling, Belgium, pp. 195‐206.

4. Burke, E.K. and Newall, J.P. (2004), “Solving examination timetabling problems through adaptation of heuristic orderings”, Annals of Operations Research, Vol. 129, pp. 107‐34.

5. Burke, E.K. and Petrovic, S. (2002), “Recent research directions in automated timetabling”, European Journal of Operational Research, Vol. 140, pp. 266‐80.