FORWARD-PRUNING DEPTH-FIRST RECURSION

摘要

Systems and methods for scheduling students in class sections via a Student Information System using forward-pruning depth-first recursion are disclosed herein. Enrollment requests are received and the constraints on these enrollment requests are determined. The enrollment requests are ranked form most to least constrained. The sections of courses identified in the enrollment request are used to create a schedule tree. The schedule tree is traversed to identify a solution. A score is generated for the solution and is compared to scores for one or several other schedule paths. If the score of one of the one or several schedule paths is lower than the score of the solution, then the schedule path is excluded from the schedule tree.

主权项

1. A method of generating a student schedule, the method comprising:
receiving a plurality of enrollment requests, wherein each of the enrollment requests is associated with a student and contains a request for enrollment in one or several courses or sections with an SIS; ordering the enrollment requests from most constrained to least constrained, wherein the degree of constraint of an enrolment request is identified by the number of different opportunities for enrollments to fulfill the enrollment request with the SIS; identifying a solution, wherein the solution comprises a schedule meeting the requirements of a complete schedule with the SIS; generating a first score for the solution, wherein the first score indicates the degree to which the solution achieves one or several desired outcomes with the SIS; identifying a schedule path with the SIS; generating a second score for the schedule path, wherein the second score indicates the degree to which the second score achieves one or several desired outcomes with the SIS; comparing the first score to the second score with the SIS; and identifying the schedule path as a lesser path if the second score is less than the first score with the SIS.