Application of Genetic Algorithm to Optimize Lecture Scheduling Based on Lecturers’ Teaching Day Willingness
The scheduling of lectures is an important activity that is carried out every beginning of the semester. The process of making a lecture schedule in the Informatics Engineering Study Program of Universitas Catur Insan Cendekia Cirebon still uses office applications, so it takes a long time to comple...
Gespeichert in:
Veröffentlicht in: | Journal of physics. Conference series 2021-03, Vol.1842 (1), p.12007 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The scheduling of lectures is an important activity that is carried out every beginning of the semester. The process of making a lecture schedule in the Informatics Engineering Study Program of Universitas Catur Insan Cendekia Cirebon still uses office applications, so it takes a long time to complete. This is because certain criteria or conditions that make the scheduling of lectures complicated, such as the willingness of teaching days and courses for each lecturer to differ and the availability of parallel classes. The research methods used consist of several stages, namely data collection, analysis, and system design, as well as the implementation of software created. The method of data collection used is observation and library study. The method of analysis and design of the system used is Object-Oriented Analysis (OOA) using Unified Modelling Language (UML). Applications created using the PHP programming language with the Yii Framework and MySQL as databases, as well as applying genetic algorithms to solve scheduling problems. The result of this research is a lecture scheduling application used by BAAK Staff to create a lecture schedule in the Informatics Engineering Study Program. The application of this application can save time in the creation of lecture schedules. |
---|---|
ISSN: | 1742-6588 1742-6596 |
DOI: | 10.1088/1742-6596/1842/1/012007 |