Optimization
YuppaU generates an optimized solution that meets the needs of students, instructors, and Department Chairs. Student satisfaction will increase as course availability mirrors course demand.
Flexibility
YuppaU gives its users flexibility to enter as many options for each class as they wish. Department schedulers do not need to specify the instructor, room, or meeting time for each class. Students have greatly increased flexibility when they enroll for their classes.
Contradiction Tool
YuppaU will not override hard constraints to make the schedule “fit.” Instead, a contraction tool will warn the user that a conflict between hard constraint exists. The tool will highlight and show users the conflict, and the cause of it, so preferred changes can be made to resolve the contradiction.
Preferences
YuppaU incorporates preferences of both the Department Chairs and instructors. Instructors directly enter their preferences, freeing Chairs of having to collect preferences. Chairs additionally can make any instructor’s preferences a hard constraint.
Customization
YuppaU customizes each schedule to the unique demands of the entire department, from the students to the instructors and Department Chairs. YuppaU will ensure that needs are met and wants are maximized.
Efficiency
YuppaU maximizes the efficiency of the University by making it run more seamlessly. Department Chairs and staff will no longer have to expend valuable time and effort solving this problem.
Constraints
YuppaU allows Department Chairs to enter as many hard constraints, or restrictions, as they wish. Chairs may mandate specific options in the schedule that they deem essential.
Prerequisite Tool
To further address student needs, YuppaU has a prerequisite tool that allows Department Schedulers to enter course prerequisite information. This helps to prevent scheduling complementary courses at the same time, maximizing course options for students.
Modifications
YuppaU gives users the ability to modify an existing solution if student demand changes, and then ask the program if those modifications are allowed without violating any constraints. This will produce a new solution that is as close as possible to the previous solution.
