Main Article Content
The department of Computer Science belong to Science Faculty of Navaminda Kasatriyadhiraj Royal Air Force Academy (NKRAFA) has a main mission to improve students in both theoretical and practical skills. For each enrolled subject, the computer science students have laboratory for practicing. Therefore, special instructors are needed for supporting the students in each subject. The problem of selecting a set of appropriate special instructor and scheduling a right person in a right timeslot are challenging. Since the problem is large, complex and consumed time when solved by manual. Even there are many techniques have been proposed such as Tabu search, Genetic Algorithm, Constraint Based Approach. This research proposes a combined technique between Constraint Based Approach, Cluster method and Earliest Deadline First for timetabling special instructor problem. The implemented system works like a web-based application. Case study of the department of Computer Science, Navaminda Kasatriyadhiraj Royal Air Force Academy (NKRAFA)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
- Content and information in articles published in NKRAFA Journal of Science and Technology are comment and responsibility of authors of articles directly. Journal editorial do no need to agree or share any responsibility.
- NKRAFA Journal of Science and Technology Articles holds the copyright of the content, pictures, images etc. which published in it. If any person or agency require to reuse all or some part of articles, the permission must be obtained from the NKRAFA Journal of Science and Technology.
E. Yu and K. Sung. (2002). A genetic algorithm for a university weekly courses timetabling problem. International Federation of Operational Research Societies. (IFORS): 703-717.
ภูมินันท์ บัวงาม. (2019). ระบบ แก้ไข ปัญหา ไอ พี ทีวี อัตโนมัติ โดย ใช้ วิธี การ ให้ เหตุผล ด้วย ฐาน กรณี. วารสารวิทยาศาสตร์และเทคโนโลยีนายเรืออากาศ. 15, 99-111.
E. K. Burke, J. P. Newall, and R. F. Weare. (1998). A Simple Heuristically Guided Search for the Time-table Problem. International ICSC Symposium on Engineering of Intelligent Systems (EIS’98): 574-579.
J. Singh, B. Patra and S. Singh. (2011). An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System. International Journal of Advanced Computer Science and Applications (IJACSA):31-37.
T. Müller. (2005). Constraint-based Timetabling. Ph.D. thesis, Charles University.
C. Valouxis and E. Housos. (2003). Computers & Operations Research: 1555-1572.
B. Hussin, A. Basari, A. Shibghatullah and S. Asmai. (2011). Open Systems (ICOS): 133-138.
H. Mousa and A. Elsisi. (2013). Computer Engineering & Systems (ICCES): 167-171.
A. Nogareda and D. Camacho. (2015). Constraint-based model design for Timetabling problems in secondary schools. Innovations in Intelligent Systems and Applications (INISTA): 1-6.