A Zero-One Integer Programming Approch to the Assignments of Lectures to Courses

Assignments of lectures to courses is one of the problems in education management (or planning) especially in higher institutions such as universities or colleges. This paper investigates the feasibility of determining an optimal assignment of lectures to courses under various conditions using an operation research method. Beginning with the classic general almost "free entry" or "unrestricted" pure transportation model of linear programming, the problem is extended to include posibilities such as course-sharing and time-tabling clashing. This leads to the formulation of a revised zero-one integer programming model. The results of some empirical tests are also reported.