Abstract
The examination timetabling problem is widely studied and a major activity for academic institutions. In real world cases, an increasing number of student enrolments, variety of courses throw in the growing challenge in the research with a wider range of constraints. Many optimization problems are concerned with the best feasible solution with minimum execution time of algorithms. The aim of this paper is to propose rough sets methods to investigate the Carter datasets. Two rough sets (RS) approaches are used for the data analysis. Firstly, the discretization process (DP) returns a partition of the value sets into intervals. Secondly the rough sets Boolean reasoning (RSBR) achieves the best decision table on the large data instances. The rough sets classified datasets are experimented with an examination scheduler. The improvements of the solutions on Car-s-91 and Car-f-91 datasets are reported.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burke, E.K., Elliman, D.G., Ford, P.H., Weare, R.F.: Examination Timetabling in British Universities. In: Burke, E., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 76–90. Springer, Heidelberg (1996)
Burke, E.K., Elliman, D.G., Weare, R.F.: A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 605–610. Morgan Kaufmann, San Francisco (1995)
Burke, E.K., Bykov, Y., Newall, J., Petrovic, S.: A Time-predefined Local Search Approach to Exam Timetabling Problems. IIE Transactions on Operations Engineering, 509–528 (2004)
Caramia, M., DellOlmo, P., Italiano, G.F.: New Algorithms for Examination Timetabling. In: Naher, S., Wagner, D. (eds.) WAE 2000. LNCS, vol. 1982, pp. 230–241. Springer, Heidelberg (2001)
Carter, M.W., Laporte, G., Lee, S.Y.: Examination Timetabling: Algorithmic Strategies and Applications. Journal of the Operational Research Society, 373–383 (1996)
Joshua, J.: The Perception of Interaction on the University Examination Timetabling Problem. In: McCollum, B., Burke, E., George, W. (eds.) Practice and Theory of Automated Timetabling, ISBN 08-538-9973-3
Al-Betar, M.: A Combination of Metaheuristic Components based on Harmony Search for The Uncapacitated Examination Timetabling. In: McCollum, B., Burke, E., George, W. (eds.) Practice and Theory of Automated Timetabling, ISBN 08-538-9973-3 for Annals of Operational Research
Boizumault, P., Delon, Y., Peridy, L.: Constraint Logic Programming for Examination Timetabling. The Journal of Logic Programming 26(2), 217–233 (1996)
Brailsford, S.C., Potts, C.N., Smith, B.M.: Constraint Satisfaction Problems: Algorithms and Applications. European Journal of Operational Research 119, 557–581 (1999)
Burke, E.K., de Werra, D., Kingston, J.: Applications in Timetabling. In: Yellen, J., Gross, J.L. (eds.) Handbook of Graph Theory, pp. 445–474. Chapman Hall, CRC Press (2003)
Burke, E.K., Newall, J.P.: Solving Examination Timetabling Problems through Adaption of Heuristic Orderings. Annals of Operations Research 129, 107–134 (2004)
Burke, E.K., Petrovic, S.: Recent Research Directions in Automated Timetabling. European Journal of Operational Research 140, 266–280 (2002)
Pawlak, Z., Grzymala-Busse, J., Slowinski, R., Ziarko, W.: Rough Sets Communications of the ACM 38(11), 89–95 (1995)
lzakVarious, D.: Approaches to Reasoning with Frequency-Based Decision Reducts: A Survey. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Sets in Soft Computing and Knowledge Discovery: New Developments. Physica, Heidelberg (2000)
Pal, S.K., Polkowski, L., Skowron, A.: Rough-Neuro Computing: Techniques for Computing with Words. Springer, Berlin (2004)
Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G., Lee, S.Y.: A Survey of Search Methodologies and Automated System Development for Examination Timetabling. Journal of Scheduling 12(1), 55–89 (2009), doi:10.1007/s10951-008-0077-5
McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A., Di Gaspero, L., Qu, R., Burke, E.: Setting The Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS Journal on Computing 22(1), 120–130 (2010)
Carter, M.W.: A Survey of Practical Applications of Examination Timetabling Algorithms. Operation Research 34(2), 193–202 (1986)
Pawlak, Z.: Rough Sets Theoretical Aspect of Reasoning about Data. Kluwer Academic, Boston (1991)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Carter, M.W., Laporte, G., Lee, S.Y.: Examination Timetabling: Algorithmic Strategies and Applications. Journal of the Operational Research Society 47, 373–383 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
J., J.T., Khader, A.T., Belaton, B. (2011). A Practical Rough Sets Analysis in Real-World Examination Timetabling Problem Instances. In: Venugopal, K.R., Patnaik, L.M. (eds) Computer Networks and Intelligent Computing. ICIP 2011. Communications in Computer and Information Science, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22786-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-22786-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22785-1
Online ISBN: 978-3-642-22786-8
eBook Packages: Computer ScienceComputer Science (R0)