An investigation of the course-section assignment problem

Authors:
Zeki Bayram
Affiliations:
Computer Engineering Department, Eastern Mediterranean University, Famagusta, T.R.N. Cyprus
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 3
Cited 0

A Comparison of Annealing Techniques for Academic Course Scheduling

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Tabu Search Techniques for Examination Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Tabu search techniques for large high-school timetabling problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define the problem formally, and then present an algorithm that systematically enumerates solutions for it. The algorithm uses backtracking to perform a depth-first search of the implicit search space defined by the problem, pruning the search space when possible. We derive a mathematical formula for the algorithm’s average-case time complexity using a probabilistic approach, and also give a brief overview of its implementation in a WEB application.