Logic Formulation and Evaluation of Academic Constraints
About this article
Abstract
University curriculum scheduling is a prominent research issue of resources optimization. The problem consists of constraints, composite event variables and their placement domains. This research work introduces a novel set of evaluation heuristics those sharply scan out the dataset with respect to hard or soft constraints and consequently assign penalties to conflicting events. The research approach is examined over a number of diverse benchmark dataset where complexity increases with subject to their number of events, constraints and curriculums. Furthermore, each dataset is classified over six complexity scales where each scale is differentiated set of constraints. The prime advantages are revealed from the research work to acquire accurate status of constraints violations with respect to various datasets and complexity scales which leads to obtain optimal solution in short span of time and using less computational resources.
References
[1] Aftab Ahmed, Bukhari, A. H. S. &Ismaili, I. A. (2011a). A Compartive Study On Three Hyper-Heuristic Approaches For Solving Benchmark Scheduling Problems Sindh University Research Journal (Science Series) 43(2): 161-168.
[2] Aftab Ahmed &Li, Z. (2010).A Biphasic Approach for University Timetabling Problem. In The 2nd International Conference on Computer Engineering and Technology (ICCET 2010), Vol. 1, 192-197 Chengdu, Sichuan, China.
[3] Aftab Ahmed, Zhoujun Li &Bukhari, A. H. S. (2011b).Triphasic solving approach for scheduling problem. In Seventh International Conference on Natural Computation (ICNC), 2011 2358 - 2363 Shanghai, China IEEE.
[4] Alex Bonutti, Fabio De Cesco, Luca Di Gaspero &Schaerf, A. (2010). Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results Annals of Operations Research 179.
[5] G. M. White &J. Zhang (1998).Generating Complete University Timetables by Combining Tabu Search with Constraint Logic. In The Practice and Theory of Automated Timetableing PATAT 1997, 187-198: Springer-Verlag.
View more references (4)
[6] Ghaemi, S., Vakili, M. T. &Aghagolzadeh, A. (2007).Using a genetic algorithm optimizer tool to solve University timetable scheduling problem. In ISSPA 07: IEEE.
[7] M. Adriaen, P. De Causmaecker &Berghe, G. V. (2003).Decentralised course timetabling in a large hierarchical organisation. In Proceedings of 1st Multidisciplinary International Conference on Scheduling: Practice and Theory, MISTA 2003, 60-66 Nottingham.
[8] M.W. Carter &Laporte, G. (1998).Recent developments in practical course timetabling. In Second International Conference on the Practice and Theory of Automated Timetabling (PATAT II), 3-19 (Eds E.K. Burke and M. Carter). Canada.
[9] W. Legierski (2002).Constraint-based reasoning for timetabling. In AI-METH 2002Gliwice, Poland.