Timetabling is an NP-Hard problem that searches for periodic scheduling of events that must
meet a set of hard and soft constraints. Because of the difficulty in finding an exact solution …