SOLVING MAKEUP COURSE TIMETABLING PROBLEM (MCTP) WITH MATHEMATICAL MODELLING: A REAL CASE APPLICATION


Ucar U. U. , İŞLEYEN S. K.

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, cilt.31, sa.2, ss.331-346, 2016 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 31 Konu: 2
  • Basım Tarihi: 2016
  • Dergi Adı: JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY
  • Sayfa Sayıları: ss.331-346

Özet

Several courses in university cannot be performed due to various reasons such as symposium, technical tour, academic mission of teaching staff in education period. The unrealized courses must makeup in subsequent weeks to complete the specified curriculum of education in academic calendar. This situation leads to a new timetabling problem different from Classic Course Timetabling Problem and it is named as Makeup Course Timetabling Problem. In this study, a new mathematical model is proposed to solve the stated problem and the model is applied on the Industrial Engineering Department of the Gazi University. Several test problem instances are obtained by identifying various makeup course scenarios in the existing timetabling and these instances are solved by using the proposed mathematical model. As a result, the schedules which the courses assigning the appropriate weeks, days, hours and classrooms are obtained.