Solving the Course - Classroom Assignment Problem for a University
Article Sidebar
Keywords:
classroom timetable integer linear programming
Main Article Content
Abstract
A large number of courses and the different classroom capacities with difference in study periods make the assignment between classrooms and courses complicated. The scheduler always takes long time to solve the problem. The purpose of the study is to develop mathematical model and design methods to solve the problem. The assignment problem uses the information from the Faculty of Engineering and Industrial Technology at Silpakorn University in the first semester, 2012. Excel’s Premium Solver is applied in this study. It was found that Excel’s Premium Solver can solve this classroom allocation problem with the process time in seconds. The total cost was reduced 27,920 baht / semester.
Downloads
Download data is not yet available.
Article Details
How to Cite
Thongsanit, K. (2014). Solving the Course - Classroom Assignment Problem for a University. Science, Engineering and Health Studies, 8(1), 46–52. https://doi.org/10.14456/sustj.2014.3
Section
Research Articles
References
Daskakaki, S., Birbas, T., and Housos, E. (2004). An integer programming formulation for a case study in university time tabling. European Journal of Operational Research, 153: 117-135.
Gunawan, A., Ng, K. M., and Poh, K. L. (2007). Solving the Teacher Assignment-Course Scheduling Problem by a Hybrid Algorithm. World Academy of Science, Engineering and Technology, 33: 259-264.
Oladokun, V. O. and Badmus, S. O. (2008). An Integer Linear Programming Model of a University Course Timetabling Problem. The Pacific Journal of Science and Technology, 9: 426-431.
Ragsdale, C. T. (2004). Spreadsheet Modeling and Decision Analysis: A Practical Introduction to Management Science, 4th ed., Thomson Southwestern, Ohio.
Sarin, S. C., Wang, Y., and Varadarajan, A. (2010). A university-timetabling problem and its solution using Benders’ partitioning -a case study. Journal of Scheduling, 13: 131-141.
Taha H. A. (2003). Operations Research: An Introduction, Prentice Hall, New Jersey.
Gunawan, A., Ng, K. M., and Poh, K. L. (2007). Solving the Teacher Assignment-Course Scheduling Problem by a Hybrid Algorithm. World Academy of Science, Engineering and Technology, 33: 259-264.
Oladokun, V. O. and Badmus, S. O. (2008). An Integer Linear Programming Model of a University Course Timetabling Problem. The Pacific Journal of Science and Technology, 9: 426-431.
Ragsdale, C. T. (2004). Spreadsheet Modeling and Decision Analysis: A Practical Introduction to Management Science, 4th ed., Thomson Southwestern, Ohio.
Sarin, S. C., Wang, Y., and Varadarajan, A. (2010). A university-timetabling problem and its solution using Benders’ partitioning -a case study. Journal of Scheduling, 13: 131-141.
Taha H. A. (2003). Operations Research: An Introduction, Prentice Hall, New Jersey.