Abstract
University Class Scheduling Problem (UCSP) is an inevitable task every university must go through prior to the commencement of a semester. The problem studied in this paper is decomposed into two stages - lab scheduling and theoretical class scheduling. This novel technique of decomposition of the problem not only allowed maximum number of free variables to stricter constraints found in lab scheduling, but also reduced the overall computational cost and combinatorial complexity. The mathematical model for the problem is formulated via Binary Integer Linear Programming (BILP) structure using data collected from the department considered in the study. Part of the contribution of this work also includes develo** ways to recognize only the true variables while formulating the model. The model is then optimized using the simplex method with the objectives to optimize classroom utilization and faculty preferences while fulfilling additional constraints. Furthermore, the proposed method is compared to the traditional technique in which the model is optimized in a single stage with both true variables recognized and not recognized.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdelhalim EA, El Khayat GA (2016) A utilization-based genetic algorithm for solving the university timetabling problem (uga). Alexandria Engineering Journal 55(2):1395–1409. https://doi.org/10.1016/j.aej.2016.02.017
Aizam NAH, Uvaraja V (2015) Generic model for timetabling problems by integer linear programming approach. World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering 9(12):668–675. https://doi.org/10.5281/zenodo.1110215
Badoni RP, Gupta D, Mishra P (2014) A new hybrid algorithm for university course timetabling problem using events based on grou**s of students. Comput Ind Eng 78:12–25. https://doi.org/10.1016/j.cie.2014.09.020
Burke EK, Meisels A, Petrovic S, Qu R (2004) A graph-based hyper heuristic for timetabling problems. Computer science technical report no. NOTTCS-TR-2004-9, University of Nottingham. https://doi.org/10.1016/j.ejor.2005.08.012
Carter MW, Laporte G, Lee SY (1996) Examination timetabling: algorithmic strategies and applications. J Oper Res Soc 47(3):373–383. https://doi.org/10.1057/jors.1996.37
Chen RM, Shih HF (2013) Solving university course timetabling problems using constriction particle swarm optimization with local search. Algorithms 6(2):227–244. https://doi.org/10.3390/a6020227
Dantzig GB (1951a) Application of the simplex method to a transportation problem. Activity analysis and production and allocation. Koopmans, T.C., Ed., John Wiley and Sons, New York, 359-373
Dantzig GB (1951b) A proof of the equivalence of the programming problem and the game problem. Activity analysis of production and allocation, no 13:330–338
Dantzig GB (1963) Linear programming and extensions. Princeton landmarks in mathematics and physics
De Causmaecker P, Berghe GV (2012) Towards a reference model for timetabling and rostering. Ann Oper Res 194(1):167–176. https://doi.org/10.1007/s10479-010-0721-2
El-Sherbiny MM, Zeineldin RA, El-Dhshan AM (2015) Genetic algorithm for solving course timetable problems. International Journal of Computer Applications 124(10). https://doi.org/10.5120/ijca2015905408
Hertz A (1991) Tabu search for large scale timetabling problems. Eur J Oper Res 54(1):39–47. https://doi.org/10.1016/0377-2217(91)90321-L
Juang YS, Lin SS, Kao HP (2007) An adaptive scheduling system with genetic algorithms for arranging employee training programs. Expert Syst Appl 33(3):642–651. https://doi.org/10.1016/j.eswa.2006.06.010
Landa Silva JD (2003) Metaheuristic and multiobjective approaches for space allocation. Ph.D. dissertation, University of Nottingham
Mooney EL, Rardin RL, Parmenter W (1996) Large-scale classroom scheduling. IIE Trans 28(5):369–378. https://doi.org/10.1080/07408179608966284
Murray K, Müller T, Rudová H (2006) Modeling and solution of a complex university course timetabling problem. International conference on the practice and theory of automated timetabling. Springer, pp. 189–209. https://doi.org/10.1007/978-3-540-77345-0_13
Nanda A, Pai MP, and Gole A (2012) An algorithm to automatically generate schedule for school lectures using a heuristic approach. International journal of machine learning and computing, vol. 2, no. 4, p. 492. https://doi.org/10.7763/IJMLC.2012.V2.174
Sandström V (2012) Scheduling of teaching resources and classes using mixed integer linear programming. Aalto University, School of Science
Socha K, Samples M, Manfrin M (2003) Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. Workshops on applications of evolutionary computation. Springer, pp. 334–345. https://doi.org/10.1007/3-540-36605-9_31
Szabó Z, Kovács M (2003) On interior-point methods and simplex method in linear programming. An St Univ Ovidius Constanta 11(2):155–162
Thongsanit K (2014) Solving the course-classroom assignment problem for a university. Silpakorn University Science and Technology Journal 8(1):46–52. https://doi.org/10.14456/sustj.2014.3
Ülker Ö, Landa-Silva D (2010) A 0/1 integer programming model for the office space allocation problem. Electron Notes Discrete Math 36:575–582. https://doi.org/10.1016/j.endm.2010.05.073
Wasfy A and Aloul F (2007) Solving the university class scheduling problem using advanced ilp techniques. IEEE GCC Conference
Wormald R, Guimond C (2012) Creating a more efficient course schedule at wpi using linear optimization. Major Qualifying Rep, Worcester Polytechnic Institute, Worcester
Yazdani M, Naderi B, Zeinali E (2017) Algorithms for university course scheduling problems. Tehnicki Vjesnik-Technical Gazette 24:241–247. https://doi.org/10.17559/tv-20130918133247
Zhai Y, Sun S, Wang J, Guo S (2010) A heuristic algorithm for large-scale job shop scheduling based on operation decomposition using bottleneck machine. Management and service science (MASS), 2010 international conference on. IEEE, pp. 1–4. https://doi.org/10.1109/ICMSS.2010.5576038
Acknowledgements
We would like to thank Center for Research & Training (CRT), Uttara University, for funding this work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Samiuddin, J., Haq, M.A. A novel two-stage optimization scheme for solving university class scheduling problem using binary integer linear programming. Oper Manag Res 12, 173–181 (2019). https://doi.org/10.1007/s12063-019-00146-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12063-019-00146-8