Schedules and Waitlists and Integer Programs, Oh My!

Student class schedules often involve significant scheduling conflicts and can be challenging to resolve. Three scheduling problems common to students, advisors, and deans at universities include building a schedule, changing schedules for multiple students due to a course cancelation, and finding seats for students on waitlists for multiple courses. This paper presents binary integer programs to solve each, building in complexity. [ABSTRACT FROM AUTHOR]