Complex University Timetabling Using Iterative Forward Search Algorithm and Great Deluge Algorithm
University timetabling is an issue that has received more attention in the field of operations research. Course scheduling is the process of arranging time slots and room for a class by paying attention to existing limitations. This problem is an NP-Hard problem, which means the computation time to...
Saved in:
Main Authors: | , |
---|---|
Format: | UMS Journal (OJS) |
Language: | eng |
Published: |
Department of Informatics, Universitas Muhammadiyah Surakarta, Indonesia
2021
|
Subjects: | |
Online Access: | https://journals.ums.ac.id/index.php/khif/article/view/12879 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|