Abstract

The Balanced Academic Curriculum Problem (BACP) is a constraint satisfaction problem classified as NP- Hard, this problem consists in the allocation of courses in the periods that are part of a curriculum such that the prerequisites are satisfied and the load of courses is balanced for the students. In this paper is presented the solution for a modified BACP where the loads may be the same or different for each one of the periods and is allowed to have some courses in a specific period. This problem is modeled as an integer programming problem and is proposed the use of evolutionary strategies for its solution because was not possible to find solutions for all the instances of this modified problem with formal methods.