Final examination scheduling

Authors:
Sol Broder
Affiliations:
State Univ. of New York, Stony Brook
Venue:
Communications of the ACM
Year:
1964

Citing 0
Cited 7

Scheduling to reduce conflict in meetings

Communications of the ACM
Scheduling university course examinations by computer

Communications of the ACM
An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables

Computers and Operations Research
A survey of search methodologies and automated system development for examination timetabling

Journal of Scheduling
A multi-objective evolutionary algorithm for examination timetabling

Journal of Scheduling
Examination timetabling using late acceptance hyper-heuristics

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Semantic components for timetabling

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling

Quantified Score

Hi-index	48.25

Visualization

Abstract

A method for scheduling final examinations to yield a minimal number of student conflicts is described. The “minimization” is achieved by repetitively evaluating a nonlinear set of equations. Imbedded in the process is a random or Monte Carlo selection of assignments. As in such heuristic techniques, the solution may not be optimum and many solutions may be found which yield locally minimal results. Computer programs are described and empirical results given.