Final Examination Scheduling 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. Imbeded 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. CACM August, 1964 Broder, S. CA640817 JB March 9, 1978 6:33 PM 1013 5 1013 1013 5 1013 1013 5 1013 1609 5 1013 2052 5 1013 1008 6 1013 1013 6 1013 1013 6 1013 1504 6 1013 1540 6 1013