Muhammad Tayyab

Comparative Benchmarking of Constraint Satisfaction Heuristics and Genetic Algorithms for Multi-Criteria Timetable Optimization

Academic timetabling represents an NP-hard combinatorial search problem characterized by a highly constrained decision space. Satisfying strict hard constraints such as room capacity limitations, instructor overlap, and temporal conflicts—while simultaneously optimizing soft pref...