Solving a practical examination timetabling problem

A case study

Masri Ayob, Ariff Md Ab Malik, Salwani Abdullah, Abdul Razak Hamdan, Graham Kendall, Rong Qu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabling problem at the University Kebangsaan, Malaysia. We utilise a new objective function that was proposed in our previous work to evaluate the quality of the timetable. The objective function considers both timeslots and days in assigning exams to timeslots, where higher priority is given to minimise students having consecutive exams on the same day. The objective also tries to spread exams throughout the examination period. This heuristic has the potential to be used for the benchmark examination datasets (e.g. the Carter datasets) as well as other real world problems. Computational results are presented.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages611-624
Number of pages14
Volume4707 LNCS
EditionPART 3
Publication statusPublished - 2007
EventInternational Conference on Computational Science and its Applications, ICCSA 2007 - Kuala Lumpur
Duration: 26 Aug 200729 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume4707 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Computational Science and its Applications, ICCSA 2007
CityKuala Lumpur
Period26/8/0729/8/07

Fingerprint

Timetabling
Heuristics
Saturation
Objective function
Benchmarking
Malaysia
Students
Computational Results
Consecutive
Benchmark
Minimise
Evaluate
Datasets

Keywords

  • Graph colouring
  • Heuristic
  • Timetabling

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Ayob, M., Ab Malik, A. M., Abdullah, S., Hamdan, A. R., Kendall, G., & Qu, R. (2007). Solving a practical examination timetabling problem: A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 3 ed., Vol. 4707 LNCS, pp. 611-624). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4707 LNCS, No. PART 3).

Solving a practical examination timetabling problem : A case study. / Ayob, Masri; Ab Malik, Ariff Md; Abdullah, Salwani; Hamdan, Abdul Razak; Kendall, Graham; Qu, Rong.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4707 LNCS PART 3. ed. 2007. p. 611-624 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4707 LNCS, No. PART 3).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ayob, M, Ab Malik, AM, Abdullah, S, Hamdan, AR, Kendall, G & Qu, R 2007, Solving a practical examination timetabling problem: A case study. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 3 edn, vol. 4707 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 4707 LNCS, pp. 611-624, International Conference on Computational Science and its Applications, ICCSA 2007, Kuala Lumpur, 26/8/07.
Ayob M, Ab Malik AM, Abdullah S, Hamdan AR, Kendall G, Qu R. Solving a practical examination timetabling problem: A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 3 ed. Vol. 4707 LNCS. 2007. p. 611-624. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).
Ayob, Masri ; Ab Malik, Ariff Md ; Abdullah, Salwani ; Hamdan, Abdul Razak ; Kendall, Graham ; Qu, Rong. / Solving a practical examination timetabling problem : A case study. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4707 LNCS PART 3. ed. 2007. pp. 611-624 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).
@inproceedings{9aafdbc9e001474cb53774968ac43be7,
title = "Solving a practical examination timetabling problem: A case study",
abstract = "This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabling problem at the University Kebangsaan, Malaysia. We utilise a new objective function that was proposed in our previous work to evaluate the quality of the timetable. The objective function considers both timeslots and days in assigning exams to timeslots, where higher priority is given to minimise students having consecutive exams on the same day. The objective also tries to spread exams throughout the examination period. This heuristic has the potential to be used for the benchmark examination datasets (e.g. the Carter datasets) as well as other real world problems. Computational results are presented.",
keywords = "Graph colouring, Heuristic, Timetabling",
author = "Masri Ayob and {Ab Malik}, {Ariff Md} and Salwani Abdullah and Hamdan, {Abdul Razak} and Graham Kendall and Rong Qu",
year = "2007",
language = "English",
isbn = "9783540744825",
volume = "4707 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 3",
pages = "611--624",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 3",

}

TY - GEN

T1 - Solving a practical examination timetabling problem

T2 - A case study

AU - Ayob, Masri

AU - Ab Malik, Ariff Md

AU - Abdullah, Salwani

AU - Hamdan, Abdul Razak

AU - Kendall, Graham

AU - Qu, Rong

PY - 2007

Y1 - 2007

N2 - This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabling problem at the University Kebangsaan, Malaysia. We utilise a new objective function that was proposed in our previous work to evaluate the quality of the timetable. The objective function considers both timeslots and days in assigning exams to timeslots, where higher priority is given to minimise students having consecutive exams on the same day. The objective also tries to spread exams throughout the examination period. This heuristic has the potential to be used for the benchmark examination datasets (e.g. the Carter datasets) as well as other real world problems. Computational results are presented.

AB - This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabling problem at the University Kebangsaan, Malaysia. We utilise a new objective function that was proposed in our previous work to evaluate the quality of the timetable. The objective function considers both timeslots and days in assigning exams to timeslots, where higher priority is given to minimise students having consecutive exams on the same day. The objective also tries to spread exams throughout the examination period. This heuristic has the potential to be used for the benchmark examination datasets (e.g. the Carter datasets) as well as other real world problems. Computational results are presented.

KW - Graph colouring

KW - Heuristic

KW - Timetabling

UR - http://www.scopus.com/inward/record.url?scp=38149141620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149141620&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540744825

VL - 4707 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 611

EP - 624

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -