Model Program Integer Untuk Penjadwalan Kegiatan Pengajaran Di SMA

Abstract

Timetabling is part of a general scheduling problem. It is a decision making process with the intention of optimizing an objective. Since a school is also a certain business entity, where the optimal management of usually scarce resources involves very important and necessary objectives, a school inevitably will have many scheduling problems in its operations, so as to minimize unnecessary conflicts in the proper and efficient use of its scarce resources. This thesis presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time satisfying a set of 16 constraints of various types known as high school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters reffering to teachers preferences.