Alocação de disciplinas e professores da UFC-Quixadá utilizando Prolog

Abstract

Scheduling problems, which are typically NP-Complete problem, have been the subject of so many researchs over the years. The University Course Timetabling Problem (UCTTP), which is also an NP-Complete problem, has the objective of finding a method capable of allocating courses, teachers, classrooms, laboratories and other university resources in predefined timeslots while satisfying a set of constraints. In reason to the complexity of the problem, a method capable of finding an optimal solution in polynomial time is unknown. This work aims to develop a method of allocation, using logic programming, which receives the data of courses, teachers, preferences, among others, and provides as output a viable solution of the course timetabling problem for a given semester of UFC-Quixadá.