Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT

Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. The flows of GA are using selection, crossover and mutation operators applied to populations of chromosomes. This paper reports the techniques using GA in scheduling. Class timetabli...

Full description

Saved in:
Bibliographic Details
Main Author: Abdullah, Amran
Format: Thesis
Language:eng
Published: 2006
Subjects:
Online Access:https://etd.uum.edu.my/1901/1/AMRAN_B._ABDULLAH_-_COMPUTER_LAB_TIMETABLING_USING_GENETIC_ALGORITHM_CASE_STUDY_-_UNIT_ICT.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uum-etd.1901
record_format uketd_dc
institution Universiti Utara Malaysia
collection UUM ETD
language eng
topic QA71-90 Instruments and machines
spellingShingle QA71-90 Instruments and machines
Abdullah, Amran
Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
description Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. The flows of GA are using selection, crossover and mutation operators applied to populations of chromosomes. This paper reports the techniques using GA in scheduling. Class timetabling problem is one of the applications in scheduling. Basically, it will look into matters such as putting students into certain time slot. These aspects are important for lab session to avoid clash and no students can sit more than one lab session in a same time slot. The other constraint is the student workload should be arranged less than three session in a row. The computer lab timetabling problem at Unit ICT, Fakulti Teknologi Maklumat, Universiti Utara Malaysia is introduced and the prototype has been developed using Java language. The prototype suggested several feasible solutions to the user.
format Thesis
qualification_name masters
qualification_level Master's degree
author Abdullah, Amran
author_facet Abdullah, Amran
author_sort Abdullah, Amran
title Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
title_short Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
title_full Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
title_fullStr Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
title_full_unstemmed Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
title_sort computer lab timetabling using genetic algorithm case study - unit ict
granting_institution Universiti Utara Malaysia
granting_department Faculty of Information Technology
publishDate 2006
url https://etd.uum.edu.my/1901/1/AMRAN_B._ABDULLAH_-_COMPUTER_LAB_TIMETABLING_USING_GENETIC_ALGORITHM_CASE_STUDY_-_UNIT_ICT.pdf
_version_ 1747827228577628160
spelling my-uum-etd.19012013-07-24T12:13:38Z Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT 2006 Abdullah, Amran Faculty of Information Technology Faculty of Information Technology QA71-90 Instruments and machines Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. The flows of GA are using selection, crossover and mutation operators applied to populations of chromosomes. This paper reports the techniques using GA in scheduling. Class timetabling problem is one of the applications in scheduling. Basically, it will look into matters such as putting students into certain time slot. These aspects are important for lab session to avoid clash and no students can sit more than one lab session in a same time slot. The other constraint is the student workload should be arranged less than three session in a row. The computer lab timetabling problem at Unit ICT, Fakulti Teknologi Maklumat, Universiti Utara Malaysia is introduced and the prototype has been developed using Java language. The prototype suggested several feasible solutions to the user. 2006 Thesis https://etd.uum.edu.my/1901/ https://etd.uum.edu.my/1901/1/AMRAN_B._ABDULLAH_-_COMPUTER_LAB_TIMETABLING_USING_GENETIC_ALGORITHM_CASE_STUDY_-_UNIT_ICT.pdf application/pdf eng validuser masters masters Universiti Utara Malaysia Abdennadher, S. & Marte, M. (2000). University Course Timetabling Using Constraint Handling Rules. Retrieved January, 2005, from http://www.pms.informatik.uni-muenchen.de/mitarbeiter/marte/publications/Abdennadher-Marte-JAAI-2000.pdf. Baggio, G. Wainer, J. & Ellis, C. (2004). Applying Scheduling Techniques To Minimize The Number Of Late Jobs In Work-flow Systems. SAC ’04, March 14-17, 2004, Nicosia, Cyprus. 2004 ACM Symposium on Applied Computing, pp. 1396-1403. Brown, D. E. & Scherer, W. T. (1995). Intelligent Scheduling Systems. Kluwer Academic Publishers, 101 Philip Drive, Assinippi Park, Norwell, Massachusetts 02061, USA, ISBN 0-7923-9515-8. Burke, E. K. & Newall, J. P. (2002). Enhancing Timetable Solutions With Local Search. PA TAT2002 Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling. Retrieved February, 2005, from http://ingenieunkahosl.be/vakgroep/IT/Patat2002/ExaminationTT/newall.pdf. Carter, M. W. (2000). A Comprehensive Course Timetabling And Student Scheduling System at the University of Waterloo. PATAT 2000 Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling. Retrieved February, 2006, from http://www.mie.utoronto.ca/staff/profiles/carter.html. Erben, W. & Song, P. Y. (2003). A Hybrid Grouping Genetic Algorithm For Examination Timetabling. Department of Computer Science, FH Konstanz University of Applied Science, Konstanz, Germany. Retrieved December, 2005, from www.asap.cs.nott.ac.uk/patat/patat04/487.pdf. Fang, H. L. (1992). Investigating Genetic Algorithms for Scheduling. Unpublished Thesis: MSc. University of Edinburgh. Filho, G. R. & Lorena, L. A. N. (2000). A Constructive Evolutionary Approach To School Timetabling. Retrieved December, 2005, from www.lac.inpe.br/~marcos/arsig2/CGA-timet-EVOCOP.pdf. Galiasso, P. & Wainwright, R. L. (2001). A Hybrid Genetic Algorithm For The Point To Multipoint Routing Problem With Single Split Paths. Mathematical and Computer Sciences Department, The University of Tulsa, USA. SAC 2001, Las Vegas, NV 2001 ACM PP 327-332. Ghani, T. A. Khader, A. T. & Budiarto, R. (2004). Optimizing Examination Timetabling using A Hybrid Evolution Strategies. 2rd International Conference on Autonomous Robots and Agents, December 13-15, 2004 Palmerston North, New Zealand. Ghazali, N. H. & Ramli, R. (2004). Past Solutions Of Driver Scheduling And A Promising Path Via Genetic Algorithm. Seminar Kebangsaan Sains Pemutusan 2004, pp. 385-392. Grajcar, M. (2000). Conditional Scheduling for Embedded Systems Using Genetic List Scheduling. University of Passau. ISSS 2000, Madrid Spain. IEEE 2000, pp. 123-128. Gy’ori, S. Petres, Z. & Varkonyi-Koczy, A. R. (2001). Genetic Algorithms in Timetabling. A New Approach. MFT Periodika 2001-07. Hungarian Society of IFSA, Hungary, 2001. Retrieved February, 2006, from http://www.mft.hL1/hallg/200l07.pdf. Helm, T. M. Painter, S. W. & Oakes, W. R. (2002). A Comparison Of Three Optimization Methods For Scheduling Maintenance Of High Cost, Long-Lived Capital Assets. Proceedings of the 2002 Winter Simulation Conference, pp. 1880-1884. Lalescu, L. & Badica, C. (2003). Timetabling Experiments Using Genetic Algorithms. Timetabling Experiments Using Genetic Algorithms, prezentata la TAINN '03, Canakkale, Turcia, 2003. Retrieved February, 2006, from http://software.ucv.ro/Cercetare/Inginerie_ Software/inginerie_software.html Melicio, F. Caldeira, J. P & Ruso, A. (2004). Two Neighborhood Approaches To The Timetabling Problem. PATAT 2004 Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. Merlot, L. T. Boland, N. Hughes, B. D. & Stuckey, P. J. (2002). A Hybrid Algorithm For The Examination Timetabling Problem. PATAT2002 Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling. Michalewicz, Z. (1999). Genetic Algorithms + Data Structures = Evolution Programs; Third Revised and Extended Edition. New York, New York: Springer-Verlag. Mitchell, M. (1999). An Introduction to Genetic Algorithms, MIT Press, Cambridge, Massachusetts, London, England, ISBN 0-262-13316-4 (HB), 0-262-63l85-7 (PB). Mukherjee, S. N. (2001). Timetabling Using Cellular Genetic Algorithms With Adaptive Mutation Operators. Unpublished Thesis: Final year dissertation, University of York. Muller, T. (2002). Some Novel Approaches To Lecture Timetabling. Charles University, Faculty of Mathematics and Physics, Czech Republic. Retrieved April, 2006, from http://kti.mff.cuni.cz/~muller/lt02_na.pdf Nunamaker, Jr. J. F. Chen, M. & Purdin, T. D. M. (1991). System Development In Information Systems Research. Journal of Management Information Systems/Winter 1990-91, Vol. 7, No. 3, pp. 89-106. Ozcan, E. & Alkan, A. (2002). Timetabling Using A Steady State Genetic Algorithm. Yeditepe University, Department of Computer Engineering, Istanbul/Turkey. Retrieved March, 2006, from http://cse.yeditepe.edu.tr/~eozcan/researchlpapers/PATAT2002.pdf. Ozcan, E. & Alkan, A. (2003). Memetic Algorithms For Timetabling. Yeditepe University, Department of Computer Engineering, Istanbul/Turkey. Retrieved February, 2006, from http://cse.yeditepe.edu.tr/~eozcan/research/papers/CECO3.pdf Pinedo, M. (2002). Scheduling Theory, Algorithms, and Systems Second Edition, Prentice Hall, Upper Saddle River, New Jersey 07458, ISBN 0-13-028138-7. Rossi-Doria, O. & Paechter, B. (2004). A Memetic Algorithm For University Course Timetabling. School of Computing, Napier University, Edinburgh, Scotland. Retrieved February, 2006, from http://iridia.ulb.ac.be/~meta/newsite/downloads/co2004_dam.pdf. Rubio, R. G. & Munoz, D. P. (2004). A Timetable Production System Architecture For Courses And Exams. PATAT 2004 Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. Santos, H.G. Ochi, L. Z. & Souza, M. J. F. (2004). A Tabu Search Heuristic With Efficient Diversification Strategies For The Class/Teacher Timetabling Problem. PATAT 2004 Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. Sheibani, K. (2002). An Evolutionary Approach For The Examination Timetabling Problems. PATAT 2002 Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling. Wong, T. Cote, P. & Sabourin, R. (2004). A Hybrid MOEA For The Capacitance Exam Proximity Problem. IEEE Congress On Evolutionary Computation (CEC 2004), Portland Oregon, June 20-23, pp. 1495-1501, 2004. Yang, Y. & Petrovic, S. (2004). A Novel Similarity Measure For Heuristic Selection In Examination. PATAT 2004 Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. Yasin, A. Puteh, N. & Tahir, H. (2002). Examination Timetabling With Genetic Algorithms. Jurnal Tek. Maklumat & Sains Kuantitatif, UiTM, Jilid 4, Bil (1), pp. 11-24.