SISTEM PENJADWALAN KULIAH DENGAN MENGGUNAKAN ALGORITMA GENETIKA
Keywords:
Course Scheduling, Scheduling Algorithm, Genetic Algorithm, ConvergenAbstract
Course scheduling is process of placing courses into availabletime-and classroom slots. As number of course activities andrequirement needed increase, the solution to scheduling problembecome more complicated. In order to get a good course scheduling,there are some important components such as lecturer, subject, student,curriculum, classroom and time. The limitation of rooms and time isoften become a problem in making the course scheduling. The additionnumber of the students and the subjects due to the application of thenew curriculum, and the other activity in university give the effects theusing of times and rooms. Course scheduling systems which isadaptable in every. changing that happened. The course schedulingmust be able to overcome the limitation of each component such as thenumber of the lecturer, times and rooms. This research uses twomethods in making the course scheduling which are by using thescheduling algorithm and without using the scheduling algorithm.These two methods will be combined into the genetic algorithm inorder to get a course scheduling which can reduce the problem in theavailability of rooms and times. The research result shows withoutusing the schedule algorithm these are 2 faults appear in the timeschedule and the minimum number of room which used is 9 rooms andconverged in the 1271h generation. But, by using the schedule algorithmthe number of the fault is no longer appear, the using of the roombecomes 8 rooms and converget in the 851h generation. It is concludedthat making the course scheduling by combining the schedulealgorithm and genetic algorithm is a right method in reducing the time fault and minimizing the using of the room.References
Adamanti, J. (2002): Penyelesaian
Masalah Penjadwalan Mata Kuliah di
Fakultas MIP A Universitas Gadjah
Mada dengan Menggunakan
Algoritma Genetika. Departemen
Pendidikan Nasional, Universitas
Gadjah Mada: Skripsi.
Babu, A.S., Chockalingam, R., dan
Kavitha, S. (2010): A Hybrid Genetic
Algorithm Approach to a
Departmental Class Timetabling
Problem Using Efficient Data
Structures. International Journal of
Computer Applications (0975-
Vol. 1-No.17.
Beasley, D., Bull, D.R., dan Martin R.R.
(1993): An Overview of Genetic
Algortihm: Part 1, Fundamental.
University Computing, Inter-
University Committee on
Computing.
Beasley, D., Bull, D.R., dan Martin R.R.
(1993): An Overview of Genetic
Algortihm: Part 2, Research Topics.
University Computing 15(4) 170 -
UCISA.
Bierwirth, C., Mattfeld, D.C., dan
Kopler, H. On Permutation
Representation for Scheduling
Problems. University of Bremen,
Dept. of Economics, D-28334
Bremen, Germany.
Burke, E.K., Petrovic, S. (2002): Recent
Research Direction in Automated
Timetabling. European Journal of
Operational Research-EJOR, 140/2,
-280
Burke, E., Elliman, D., dan Weare, R. A
Genetic Algorithm Based University
Timetabling System. Department of
Computer Science, University of
Nottingham, University Park, NG7
RD.
Harik, G.R., Lobo, F.G., dan Goldberg,
D.E. (1999): The Compact-- Genetic
Algorithm. IEEE Transactions on
Evolutionary Computation, Vol. 3,
No.4.
Murugan, A.S.R., (2009): University
Timetabling using Genetic Algorithm.
Master Thesis, Computing
Engineering, Dalama University
Roda Vagen 3 S-781 88 Borlange
Sweden.
Syadid, M. (2008): Penjadwalan
Perkuliahan Menggunakan Algoritma
Genetika. Departemen Ilmu
Komputer, Fakultas MIP A. Institut
Pertanian Bogor: Skripsi.
Yamada, T., Nakano, R. (1997): Genetic
Algorithms for ]ob-Shop Scheduling
Problems. Proceedings of Modem
Heuristic for Decision Support, pp.
-81, UNICOM Seminar, London
Downloads
Published
Issue
Section
License
Copyright (c) 2018 Purwanto Simamora, Tulus ., Fakhruddin R Batubara

This work is licensed under a Creative Commons Attribution 4.0 International License.