Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Solving the University Class Scheduling Problem Using Advanced ILP Techniques
 

Summary: Solving the University Class Scheduling Problem
Using Advanced ILP Techniques
Ahmed Wasfy and Fadi A. Aloul
Department of Computer Engineering, American University of Sharjah (AUS), UAE
{b00016690, faloul}@aus.edu
Abstract -- The University Class Scheduling Problem
(UCSP) is concerned with assigning a number of courses to
classrooms taking into consideration constraints like
classroom capacities and university regulations. The
problem also attempts to optimize the performance criteria
and distribute the courses fairly to classrooms depending
on the ratio of classroom capacities to course enrollments.
The problem is a classical scheduling problem and
considered to be NP-complete. It has received some
research during the past few years given its wide use in
colleges and universities. Several formulations and
algorithms have been proposed to solve scheduling
problems, most of which are based on local search
techniques. In this paper, we propose a complete approach
using integer linear programming (ILP) to solve the

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering