Proposing a Bi-objective Model Based on AHP Approach for a University Course Time Tabling Problem Considering Professors Satisfaction: A Case Study

Abstract
Recently, university courses time tabling problem has been attended as a main issue by most universities and educational departments. In this paper, a bi-objective model is proposed to formulate a university courses time tabling problem which aims to minimize the cost of assigning courses to professors and classes during time horizon and maximize professors' satisfaction through minimizing their total idle time, simultaneously. Furthermore, despite of previous similar works in this area in which predefined values are considered as the assignment' cost coefficients, in this paper, for the first time, an analytical hierarchy process (AHP) approach is used to calculate these coefficients which enables educational departments to attend various criteria in considering assignment cost coefficients. Finally, to evaluate the efficiency of the proposed model, a real case study in industrial engineering faculty of Bu-Ali Sina University is done.
Keywords

[1] Schaerf, A., (1999). A survey of automated timetabling. Artificial Intelligence Review, 13 (2), 87–127.
[2] Babaei, H., Karimpour, J., Hadidi, A., (2015). A Survey of Approaches for University Course Timetabling Problem. Computers & Industrial Engineering, 86, 43-59.
[3] Red, T. A., (2004). A Study of University Timetabling that Blends Graph Coloring with the Satisfaction of Various Essential and Preferential Conditions, Ph.D. Thesis, Rice University, Houston, Texas.
[4] Asmuni, H., (2008). Fuzzy Methodologies for Automated University Timetabling Solution Construction and Evaluation. Ph.D. Thesis, School of Computer Science University of Nottingham.
[5] Gotlib, C.C., (1963). The Construction of Class-Teacher Time-Tables. Proc. IFIP Congress, 62, 73-77.
[6] DeWerra, D., (1985). An Introduction to TimeTabling. European Journal of Operational Research, 19, 151-162.
[7] Hafizah, A.R., Zaidah, I., (2010). Bipartite Graph Edge Coloring Approach to Course Timetabling. IEEE, 229-234.
[8] Aubin, J., Ferland, J.A., (1989). A large scale timetabling problem. Computers and Operations Research, 16, 67-77.
[10] Lewis, M.R.R., (2006). Metaheuristics for University Course Timetabling. Ph.D. Thesis, Napier University.
[11] Obit, J.H., (2010). Developing Novel Meta-heuristic, Hyper-heuristic and Cooperative Search for Course Timetabling Problems. Ph.D. Thesis, School of Computer Science University of Nottingham.
[12] Amintoosi, M., Haddadnia, J., (2005). Fuzzy C-means Clustering Algorithm to Group Students in A Course into Smaller Sections. Springer-Verlag Berlin Heidelberg, 147–160.
[13] Golabpour, A., Mozdorani Shirazi, H., Farahi, A., Kootiani, M., Beige H., (2008). A fuzzy solution based on Memetic algorithms for timetabling. IEEE International Conference on MultiMedia and Information Technology, 108-110.
[14] Chaudhuri, A., Kajal, D., (2010). Fuzzy Genetic Heuristic for University Course TimeTable Problem. International Journalo of Advance in Soft Computing and Application., 2(1).
[15] Daskalaki, S., Birbas, T., (2005). Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research, 160 , 106–120.
[16] Daskalaki, S., Birbas T., Housos E., (2004). An integer programming formulation for a case study in university timetabling. European Journal of Operational Research, 153 , 117–135.
[17] Bakir, M. A., Aksop, C., (2008). A 0-1 integer programming approach to a university timetabling problem. Hacettepe Journal of Mathematics and Statistics, 37 (1), 41-55.
[18] Asgharpour, M. J., (1998). Multiple Criteria Decision Making. Tehran, Tehran University Press.
[19] Deb, K., (2001). Multi-Objective Optimization Using Evolutionary Algorithms. New York: Wiley.
[21] GAMS Development Corporation., (2013). General Algebraic Modeling System (GAMS). Washington DC, USA.