Algorithm implementation and analysis for the Great Explorations matcher and scheduler

Our Capstone group’s clients are tasked every other year with curating matches by hand that lead to high student satisfaction with their workshop event. As this workshop event has expanded from 50 attendees in 1984 to over 400 in 2019, the need for a more efficient approach has become necessary. I took the lead role in my Capstone group in designing an algorithm that could match attendees with workshops to maximize satisfaction and efficiency. This paper outlines the problem in detail, the difficulty of such a problem, the approach taken to solving it, as well as some areas where the algorithm could be improved. The source code for this project can be found at https://github.com/WhitmanCSCapstone/ge-scheduling