Comparative Performance Analysis of Scheduling Algorithms for Timetable Optimization

This paper analyzes and compares three algorithmic approaches to timetable generation optimized for application within the Engineering of Polymeric and Composite Products master's program. Administrative digitalization within Romanian higher education requires advanced solutions for scheduling academic activities that meet both institutional requirements and faculty preferences. Automatic timetable generation is a complex optimization problem, studied for over three decades, and characterized by a high diversity of constraints that cannot be efficiently addressed by a single algorithm. Performance evaluation was conducted through a multicriteria analysis based on the following criteria: execution time, solution quality, scalability, flexibility, implementation complexity, and efficiency.