Desenvolvimento de um aplicativo para o Problema da Programação de Horários (PPH) em instituições de ensino por meio de uma aplicação web utilizando Timetabling

Abstract

Scheduling problems (PPHs) have been widely studied because of their practical and theoretic importance. Most variations of the problem belong to a class known as NP-Complete. In general, it is the allocation of human and material resources in space and time takes aim at optimizing a set of defined objectives. An example would be the scheduling of University courses satisfactory to faculty as well as the academic performance of the students. In recent years the formulations of timetabling PPHs proposed by the International Timetabling Competition (ITC) have been widely used, with a remarkable predominance in methods based on local searches along with other approaches that have been recently proposed. This work aims to propose algorithms to address the issue of post-acceptance scheduling created by ITC focusing maily on heuristics based on mathematical programming. Among the models of mixed intiger linear programming we use to address this problem, is the model based on Asymmetric Representation Formulation which addresses the issue of graph coloration. Addressing the application of Local Branching heuristic structure by proposing a solution of generating columns as a way to visualize the models, because the complexity of such models is a challenge for development of mixed integer linear programming that is currently available. As discussed in this paper the techniques applied in timetabling is an NPComplete computational complexity, but is even with adjustments, the best solution for us to generate schedules, and in particular this is discoursed, the schedule of institutions of education.