A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM

BAKIR M. A., Aksop C.

HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS, cilt.37, sa.1, ss.41-55, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 37 Sayı: 1
  • Basım Tarihi: 2008
  • Dergi Adı: HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.41-55
  • Anahtar Kelimeler: Timetabling, Course scheduling, 0-1 integer programming, TABU SEARCH, ALGORITHM, MODEL
  • Gazi Üniversitesi Adresli: Evet

Özet

One of the major problems with course scheduling - a particular type of timetabling - is the difficulty that arises when trying to suitably co-ordinate lectures, students and classrooms according to a set of operational rules within a framework of certain constraints. The assignment of courses and lectures to periods and classrooms is an important administrative task that must be performed each term. The primary purpose of this paper is to solve an existing course scheduling problem. Organizing courses and lectures according to periods and availability of classrooms is a difficult course scheduling problem, which we are currently experiencing within the Department of Statistics at Gazi University. We have therefore formulated the problem as a 0-1 integer programming model. The aim of this model is to minimize the dissatisfaction of students and lecturers whilst at the same time implementing rules bounded by a set of constraints. The model produced has flexibility in terms of embracing new rules and/or criteria.