SATA: A Web Based Scheduling Support System

Developing a university course schedule is difficult. This is due to the limitations in the resources available. The process is made even harder with different faculties or departments having different ways of stating their schedule requirements. The person in charge of taking the schedule requirements and turning them into a proper course schedule is not only burden with the task of allocating the appropriate classes and time to lecturers and students, they also need to understand the schedule requirements. Therefore a scheduling support system named SATA is developed to assist ICRESS in the course scheduling process. SATA has been put to use for several semesters and the results have been encouraging. It won a bronze medal in the 2008 Invention, Innovation and Design competition (IID-08) and has been submitted to be patented in October 2008

Authors:

• Rajeswari Raju
• Saiful Nizam Warris
• Hazlifah Mohd Rusli

Keywords:

• Course Scheduling
• Scheduling Tool Aid.

References:

[1] Cambazard, H., F. Demazeau, N. Jussien, and P. David, "Interactively
Solving School Timetabling Problems Using Extensions of Constraint
Programming". Practice and Theory of Automated Timetabling V.
LNCS, Springer-Verlag, 190-207, 2004.
[2] Md. Golam Yeasin, and Ahamad Tajudin Khader, "Local Search
Algorithms for Examination Timetabling", National Conference on
Programming Sciences (Atur-05), Kuala Lumpur, 1 December 2005.
[3] Alan D. Greenberg, "The Business Case for Enterprise Conference
Scheduling", for Wainhouse Research, March 2003. Retrieved
December 16 2003, H.323 Forum, from http://www.h323forum.org
[4] Hany Alashwal and Saaai Deris , "Dynamic Timetabling Using
Reactive Constraint Agents", Technology Journal, 46(D), Faculty of
Computer Science and Information Systems, Universiti Teknologi
Malaysia, Skudai, Johor, Malaysia, 45-60, Jun 2007.
[5] Tim, B. C. and J. H. Kingston, "The Complexity of Timetable
Construction Problems", Proceedings of the 1st International
Conference on Practice and Theory of Automated Timetabling
(PATAT), LNCS 1153. Springer-Verlag. 283-295, 1995.
[6] Miner, S., S. Elmohamed, and H. W. Yau, "Optimizing Timetabling
Solutions Using Graph Coloring" NPAC REU Program, NPAC.
Syracuse University. Syracuse, NY, 1995.
[7] Dimopoulou, M. and P. Miliotis, "Theory and Methodology
Implementation of a University Course and Examination Timetabling
System", European Journal of Operational Research, 130: 202-213,
2001.
[8] Melício, F., P. Caldeira, and A. Rosa, "Solving the Timetabling
Problem with Simulated Annealing", Proc. First Int. Conf. on
Enterprise Information Systems, ICEIS- 99 - Set├║bal, 272-279, 1999.
[9] Schaerf, A, " Tabu Search Techniques for Large High-school
Timetabling Problems", Proceedings of the Fourteenth National
Conference on Artificial Intelligence, Portland, Oregon, 363-368, 1996.
[10] Colorni, A., M. Dorigo, and V. Maniezzo, "Genetic Algorithms: A New
Approach to the Time Table Problem", NATO-ASI School on
Combinatorial Optimization, Ankara, Turkey, 1990.
[11] Azevedo, F. and P. Barahona, "Timetabling in Constraint Logic
Programming", Proceedings of 2nd World Congress on Expert Systems,
Estoril, Portugal, 1994.