Mandasari, Rena Adelia (2016) COURSE SCHEDULING AT SMP MARIA MEDIATRIX USING GENETIC ALGORITHM. Other thesis, Fakultas Ilmu Komputer UNIKA Soegijapranata.
|
Text (COVER)
11.02.0049 Rena Adelia Mandasari COVER.pdf Download (4MB) | Preview |
|
Text (BAB I)
11.02.0049 Rena Adelia Mandasari BAB I.pdf Restricted to Registered users only Download (4MB) |
||
Text (BAB II)
11.02.0049 Rena Adelia Mandasari BAB II.pdf Restricted to Registered users only Download (4MB) |
||
Text (BAB III)
11.02.0049 Rena Adelia Mandasari BAB III.pdf Restricted to Registered users only Download (4MB) |
||
Text (BAB IV)
11.02.0049 Rena Adelia Mandasari BAB IV.pdf Restricted to Registered users only Download (4MB) |
||
Text (BAB V)
11.02.0049 Rena Adelia Mandasari BAB V.pdf Restricted to Registered users only Download (4MB) |
||
Text (BAB VI)
11.02.0049 Rena Adelia Mandasari BAB VI.pdf Restricted to Registered users only Download (4MB) |
||
|
Text (DAFTAR PUSTAKA)
11.02.0049 Rena Adelia Mandasari DAFTAR PUSTAKA.pdf Download (4MB) | Preview |
Abstract
Scheduling is a process of organizing an implementation schedule which informs a number of teachers, subjects, classroom, as well as teaching and learning time. In general, subjects scheduling is done manually, by looking whichever column is still empty, then put a timetable on that column. There are several factors that must be considered in making a good timetable that should not be any teaching schedule that collided with another class teaching schedule, distribution of learning schedule can be uneven each day for every class, a limited number of teachers, and aspects of the subjects taught. It requires considerable time and precision in order to avoid clashes in the making the schedule. This project is about generating course schedules. This project uses genetic algorithms and programming language Java. Genetic algorithms is suitable to provide one of search to find the optimization of a problem. The process of genetic algorithm begins by forming a population, then the population will pass the fitness checks, crossover and mutation. The results of this process will produce a schedule of subjects automatically. Expected by the this project can help resolve course scheduling in school with obtained the best combination for couples subjects and teachers overall, there is not a clash of schedules, and minimize the time for drafting schedule.
Item Type: | Thesis (Other) |
---|---|
Subjects: | 000 Computer Science, Information and General Works > 004 Data processing & computer science |
Divisions: | Faculty of Computer Science > Department of Informatics Engineering |
Depositing User: | Mr Ign. Setya Dwiana |
Date Deposited: | 31 May 2016 06:25 |
Last Modified: | 18 Nov 2022 03:00 |
URI: | http://repository.unika.ac.id/id/eprint/9710 |
Actions (login required)
View Item |