Abstract

Preparation of courses at every university is done by hand. This method has limitations that often cause collisions schedule. In lectures and lab scheduling frequent collision against the faculty member teaching schedule, collisions on the class schedule and student, college collision course with lab time, the allocation of the use of the rooms were not optimal. Heuristic method of genetic algorithm based on the mechanism of natural selection; it is a process of biological evolution. Genetic algorithms are used to obtain optimal schedule that consists of the initialization process of the population, fitness evaluation, selection, crossover, and mutation. Data used include the teaching of data, the data subjects, the room data and time data retrieved from the database of the Faculty of Computer Science, Universitas Pembangunan Panca Budi. The data in advance through the stages of the process of genetic algorithms to get optimal results The results of this study in the form of a schedule of courses has been optimized so that no error occurred and gaps.

References

• M. U. Siregar, “A New Approach to CPU Scheduling Algorithm: Genetic Round Robin,” International Journal of Computer Applications, vol. 47, no. 19, pp. 18-25, 2012.
• Y. Li dan Y. Chen, “A Genetic Algorithm for Job-Shop Scheduling,” Journal of Software, vol. 5, no. 3, pp. 269-273, 2010.
• A. P. U. Siahaan, “Adjustable Knapsack in Travelling Salesman Problem,” International Journal of Science & Technoledge, vol. 4, no. 9, 2016.
• A. P. U. Siahaan, “Comparison Analysis of CPU Scheduling FCFS, SJF and Round Robin,” International Journal of Engineering Development and Research, vol. 4, no. 3, pp. 124-132, 20 November 2016.
• U. Aickelin dan K. A. Dowsland, “An Indirect Genetic Algorithm for a Nurse Scheduling Problem,” Computers & Operations Research, vol. 31, no. 5, pp. 761-778, 2004.
• M. Gupta dan S. Gupta, “Optimized Processor Scheduling Algorithms using Genetic Algorithm Approach,” International Journal of Advanced Research in Computer and Communication Engineering, vol. 2, no. 6, pp. 2415-2417, 2013.
• F. A. Omara dan M. M. Arafa, “Genetic Algorithms for Task Scheduling Problem,” Journal of Parallel and Distributed Computing, vol. 70, no. 1, pp. 13-22, 2010.
• H. Z. Jia, A. Y. C. Nee, J. Y. H. Fuh dan Y. F. Zhang, “A Modified Genetic Algorithm for Distributed Scheduling Problems,” Journal of Intelligent Manufacturing, vol. 14, no. 3, p. 351, 2003.