Mathematical Model for Optimization of University Courses timetabling applying the criteria of quality of instruction

Authors

1 Department of Industrial Engineering, Najafabad Branch, Islamic Azad University, Iran

2 Department of Industrial Engineering, Najafabad Branch, Islamic Azad University, Isfahan, Iran

3 Faculty of Entrepreneurship, University of Tehran,1439813141, Tehran, Iran

Abstract

Timetabling is one of the most difficult issues in the world; this is a combinatory optimization issue and it has been proven that it is a NP-Hard issue.
University Courses Timetabling is very important especially for the exams and courses. The manual solving of the Timetabling needs a broad domain of sources and time to create an applicable schedule with minimum interference in the curriculum and Professor's program is not easy. Different mathematical models and algorithms have been presented for this issue but each strategy considers different limitations according to its environment and factors. Timetabling is different for different university courses Timetabling. In this study a new multi objective mathematical model with new objective functions and new constrains has been presented for university courses timetabling.  The present study tries to consider most restrictions for a training center. Finally the validity of the proposed model has been surveyed by a small numerical example and its solving by LINGO11 software shows that this model can satisfy all goals and limitations.

Keywords


Abdullah, S. and Turabieh, H. (2012) ‘On the use of multi neighbourhood structures within a tabubased memetic approach to university timetabling problems’, Information Sciences, Vol. 191, No. 15, pp.146–168.

Borek, E, K. Marecek, J, J. Parkes, A. Rudova, H. (2010), "Decomposition, reformulation, and dividing in university course timetabling". Computer and operations research. Vol. 37, No. 3, pp.582-597.

Daskalaki, S. Birbas, T. Housos, E.(2004), "An Integer Programing Formulation For A Case Study In University Timetabling", European Journal of Operation Research , Vol. 153, No. 1, pp.117-135.

Gunawam,A. Kien Ming Ng. Kim LengPoh, (2012), "A hybridized LagrangiaRelaxiation and Simulated Annealing method for the course timetabling problem". Computer and operation research, Vol. 39, No. 12, pp. 3074-3088.

Hasanzadeh, M. Bashizadeh, R.(2012) " Optimization of weekly programing of university courses by use of local searches methods, Mohasebatenarm Journal, Vol,1. No. 1, pp, 24-31.

Kaviani,M. Shirouyehzad, H. Sajadi, S.M.(2013), "A mathematical model for niversity course timetabling problems by considering multi functions". Journal of Modelling in Operations Management, Vol. 3, No. 3/4, pp. 282-295.

Sabar, N.R., Ayob, M., Kendall, G. and Qu, R. (2012) ‘A honey-bee mating optimization algorithm for educational timetabling problems’, European Journal of Operational Research, Vol. 216, No. 3, pp.533–543.

Tong Sun, J. "Simulation Research on university timetabling problem based on new immune GA". © IEEE .

Zanjirifarahani, R. Haji yakhchali, s. (2004), " Integer Model for University course timetabling – a case study", Fourth International conference of industrial engineering, Tehran, 2004.