A Monte Carlo Algorithm for Assigning Students to Classes

A technique of random choice is illustrated
by application to the problem of assigning students 
to a fixed schedule of courses.  Using the technique
it is possible to reduce or eliminate difficulties 
that result when a popular section is filled and closed
before all students requesting and requiring 
it have been scheduled.  The effectiveness of automatic
scheduling is retained without loss of the students 
privilege of picking favorite instructors.

CACM May, 1966

Macon, N.
Walker, E. E.

CA660503 JB March 3, 1978  10:14 AM

1434	5	1434
1434	5	1434
1434	5	1434
1540	5	1434
2209	5	1434
1434	6	1434
1434	6	1434
1540	6	1434