Slamet Handoko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Slamet Handoko has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Anton Satria Prabuwono
Department of Computing, Universiti Teknologi PETRONAS, Seri Iskandar, Perak, Malaysia
1 shared publication - Muhammad Irwan Yanwari
Department of Computer Science, Tokyo Metropolitan University, Tokyo, Japan
1 shared publication - Nurseno Bayu Aji
Department Of Electrical Engineering, Politeknik Negeri Semarang, Semarang, Indonesia
1 shared publication Tri Raharjo Yudantoro
1 shared publication- Wiktasari Wiktasari1 shared publication
Latest Publications
- Open Access
- 20 February 2023
- Published by Universitas Atma Jaya Yogyakarta in Indonesian Journal of Information Systems
- Vol. 5 (2) , 80-89
Priority Scheduling Implementation for Exam Schedule
Scheduling is a common problem that has been raised for a long time. Many algorithms have been created for this problem. Some algorithms offer flexibility in terms of constraints and complex operations. Because of that complexity, many algorithms will need huge computation resources and execution time. A platform like a web application has many restrictions such as execution time and computation resources. A complex algorithm is not suited for the web application platform. Priority scheduling is a scheduling algorithm based on a priority queue. Every schedule slot will produce a queue based on the constraints. Each constraint will have a different weight. Weight in queue represents their priority. This algorithm provides a light algorithm that only needs a few computations and execution times. The exam schedule is one of many problems in educational institutions. A web application is a popular platform that can be accessed from everywhere. Many educational institutions use web platforms as their main system platform. Web platforms have some restrictions such as execution time. Due to web platform restrictions, priority scheduling is a suitable algorithm for this platform. In this study, the author tries to implement a priority scheduling algorithm in scheduling cases with a website platform and shows that this algorithm solution can be an alternative for solving scheduling cases with low computational resources.
- 20 February 2023
- Published by Universitas Atma Jaya Yogyakarta in Indonesian Journal of Information Systems
- Vol. 5 (2) , 80-89
Open AccessPriority Scheduling Implementation for Exam Schedule
Scheduling is a common problem that has been raised for a long time. Many algorithms have been created for this problem. Some algorithms offer flexibility in terms of constraints and complex operations. Because of that complexity, many algorithms will need huge computation resources and execution time. A platform like a web application has many restrictions such as execution time and computation resources. A complex algorithm is not suited for the web application platform. Priority scheduling is a scheduling algorithm based on a priority queue. Every schedule slot will produce a queue based on the constraints. Each constraint will have a different weight. Weight in queue represents their priority. This algorithm provides a light algorithm that only needs a few computations and execution times. The exam schedule is one of many problems in educational institutions. A web application is a popular platform that can be accessed from everywhere. Many educational institutions use web platforms as their main system platform. Web platforms have some restrictions such as execution time. Due to web platform restrictions, priority scheduling is a suitable algorithm for this platform. In this study, the author tries to implement a priority scheduling algorithm in scheduling cases with a website platform and shows that this algorithm solution can be an alternative for solving scheduling cases with low computational resources.