Abstract: Systems and methods for scheduling students in class sections via a Student Information System using student load impact prediction are disclosed herein. Determining load impact includes identifying singletons, including natural and forced singletons, and determining students affected by these identified singletons. A student having one or several singletons can be selected and his highest priority natural singleton can be selected. The scheduling solution can be generated including that highest ranked singleton. After the scheduling solution has been generated, the student can be evaluated to determine if the scheduling solution created other singletons. These other singletons can be addressed in similar fashion by updating the scheduling solution.

Abstract: 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.