Solving Course Timetable Problem by using Integer Linear Programming (Case Study IE Department of ITS)

Fakher Shwan Rafeek, Nurhadi Siswanto

Abstract


Making IE department of ITS course timetable by determine the hard and soft constraints then develop an integer programming (ILP) model method to solve this NP-complete problem of Timetabling for solving Hard constraints Assignment problem and to solve the Soft constraints use Penalty Algorithm. Use LINGO software for solving suggested mathematical model to get the final results. Then do numerical analyzes for that results. Finally it achieves the goal for solving the Course Timetable. And get feasible solution of timetable as well as it gets the best required objective what it can get from the case study which is 356 events and it reduces the time of getting one timetable to be just one hour after it was at least 2 weeks.

Keywords


Apply ILP in LINGO software; Assignment Problem; Course Timetable Problem; Integer Linear Programming (ILP; Penalty Algorithm

Full Text:

PDF

References


Árton P. Dorneles, i.C.B.d.A.a.L.S.B., A fix-and-optimize heuristic for the high school timetabling problem. Computers & Operations Research, 2014. 52.

Thongsanit, K., Solving the Course - Classroom Assignment Problem for a University. SILPAKORN UNIVERSITY SCIENCE AND TECHNOLOGY JOURNAL, 2013.

Edmund K. Burke, J.M.c., Andrew J. Parkes, Hana Rudová, Decomposition, reformulation, and diving in university course timetabling. Computers & Operations Research, 2010. 37.

Yuri KOCHETOV, P.K., Mikhail PASCHENKO, FORMULATION SPACE SEARCH APPROACH FOR THE TEACHER/CLASS TIMETABLING PROBLEM. Yugoslav Journal of Operations Research, 2008. 18.

Patrick De Causmaecker, P.D.a.G.V.B., Evaluation of the University Course Timetabling Problem with the Linear Numberings Method, 2008.

Antony E. Phillips, H.W., Matthias Ehrgott and David M. Ryan, Integerprogramming methods for large-scale practical classroom assignment problems. Computers & Operations Research, 2014.

Patrick De Causmaecker, P.D.a.G.V.B., A decomposed metaheuristic approach for a real-world university timetabling problem. European Journal of Operational Research, 2009. 195.




DOI: http://dx.doi.org/10.12962/j23546026.y2015i1.1080

Refbacks

  • There are currently no refbacks.


View my Stat: Click Here

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.