Penjadwalan Mata Kuliah Menggunakan Algoritma Constraint Satisfaction (Studi Pada Direktorat Program Pascasarjana Universitas Muhammadiyah Malang)
| Main Author: | Fidiyanto, Akhsanul |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2019
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/52239/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/52239/2/BAB%20I.pdf http://eprints.umm.ac.id/52239/3/BAB%20II.pdf http://eprints.umm.ac.id/52239/4/BAB%20III.pdf http://eprints.umm.ac.id/52239/5/BAB%20IV.pdf http://eprints.umm.ac.id/52239/6/BAB%20V.pdf http://eprints.umm.ac.id/52239/7/POSTER%20TA.pdf http://eprints.umm.ac.id/52239/ |
Daftar Isi:
- In scheduling courses that occur at Directorate of Postgraduate Program University of Muhammadiyah Malang (DPPs-UMM), there is often a revision of course schedule when it has entered the active period of lecture. This happened due to several factors, including the presence of a lecturer who requested that the course schedule he could be able to adjust to his activity schedule or teaching schedule outside the DPPs-UMM. Classroom clashes between two classes will take place which are often caused by substitute classes. The process of printing a decree (SK) teaching lecturer is still made manually, so it is still necessary to map lecturer data with data on class schedules. To help meet the limitations in making a course schedule in order to avoid problems mentioned above, an algorithm is needed that can help with scheduling so that it can produce an efficient and optimal course schedule. The use of the Constraint Satisfaction method in this study is considered important and suitabel to meet the limitations contained in case of scheduling courses at DPPs-UMM. In addition, there are previous studies related to making a schedule that uses Constraint Satisfaction as a method to help resolve scheduling problems.