The multiphase course timetabling problem

This paper introduces the multiphase course timetabling problem and presents mathematical formulations effective solution algorithms to solve it in a real case study. Consider pool of lessons number students who are required take subset these graduate. Each lesson consists predetermined consecutive sequence phases with possibly different resource requirements duration. Students must be present certain lesson. Similarly, resources that allocated depending on their roles. The objective is maximize weighted sum student-lesson allocations subject some capacity, availability prerequisite constraints. formulated as an integer linear program called session-index formulation. formulation then extended by introducing various side constraints capture business pilot training program. An enhanced branch-and-check algorithm proposed more efficiently. Large instances solved utilizing fix-and-optimize matheuristic. Results computational study set real-world demonstrate efficacy exact matheuristic algorithms. Due novelty complexity problem, methodology its instances, implementation realization contributions within decision support system, this work was recognized semi-finalist INFORMS Franz Edelman Award (2021).