USING INTEGER LINEAR PROGRAMMING FOR DISCRETE PROBLEM OPTIMIZATION

We present an application of integer programming that generates optimal examination timetables. The model is based on common assignment problem constraints together with more advanced logical constraints and penalty-based relaxations. In order to minimize the number of constraints we identify dense timetables where the main objective is elimination of clashes and sparse timetables where we spread the exams as evenly as possible. We also mention the possibility of using Petri and related nets to solve this problem.