In this paper, a heuristic algorithm for constructing school timetables is described. The algorithm is based on an exact method that applies to a family of particular timetable problems. The procedure has been used to construct timetables for Swiss schools having about 50 classes, 80 teachers, and 35 weekly periods. Less than five percent of…

Variable Modular Scheduling Via Computer, a scheduling program which focuses on allocating a school's resources according to the school's overall purposes, is designed to allow schools to adapt organizational patterns to whatever teaching and learning patterns they define as necessary in meeting their educational goals. The system's rationale,…

NEW TECHNIQUES IN SCHEDULING PERMIT MORE EFFICIENT USE OF TIME FOR SCHOOL ADMINISTRATORS, GREATER FLEXIBILITY IN PROGRAMING, AND PROVIDES A SEEDBED FOR INNOVATION. THE STANFORD SCHOOL SCHEDULING SYSTEM (S-4) IS A SET OF PROGRAMS THAT AUTOMATES THE SCHEDULING PROCESS. THE FIRST OF THE FOUR PROGRAMS, CTTA, (CARD TO TAPE AND AUDIT), DIRECTS THE…

This document shows how computer technology can aid educators in meeting demands for improved class scheduling and more efficient use of transportation resources. The first section surveys literature on operational systems that provide individualized scheduling for students, varied class structures, and maximum use of space and staff skills.…

The present study devised a computerized assignment-by-preference algorithm for a ninth-grade exploratory curriculum. The problem addressed was one of maximally mapping all students into 8 of 12 vocational programs in terms of their preferences for studying each of the programs and the assignment restrictions established by the school. To minimize…

Describes measures taken at Ohio State University to reduce the closed-course problem including computer assisted scheduling (CAS), departmental adjustments, and class hour redistribution. (Author/PG)

This experiment in using computer-assisted curriculum planning in two British secondary schools tested the practicability of using computers not only in the annual compilation of school timetables but, more radically, in the characterization of constraints that "knock-on" from one year's timetable to the next. The Oxford School…

Describes a scheduling algorithm that continuously recomputes the conflict potential between courses and uses this information when it selects the next section to be scheduled and the meeting times at which the section is scheduled. (Author)

The desirability of using computer scheduling to assign students to classes (lectures, seminars, and practicums) for courses requested, and the possibility of integrating the scheduling onto the enrollment process, are discussed. (MSE)