IMPLEMENTASI ALGORITMA DYNAMIC PRIORITY SCHEDULLING SISTEM PENJADWALAN ANTRIAN PRIORITAS
DI MAZZNET BERBASIS WEB

Veronica Vernandez1, Ismail Abdurrozzaq Zulkarnain2, Arin Yuli Astuti3
1,2,3 Teknik Informatika, Universitas Muhammadiyah Ponorogo, Indonesia
alamat, telp/fax
email: 1veronicavndz19@gmail.com, 2 3arinyuliti@gmail.com

Abstract

In this era, service delivery in the service industry is often criticized by many people, especially regarding uncontrolled queues. Queuing is an activity commonly found in the surrounding environment. One of the factors causing queues is the demand for services exceeding the capacity of service facilities, resulting in users who arrive at the facility not being able to receive services immediately due to service congestion. MazzNet is one of the internet service providers. Their internet services include wifi connection registration, wifi installation, and wifi billing. Located in Ponorogo, East Java, the problem faced by this place is related to scheduling customer queues. However, this method is less effective because scheduling is done by processing the first reports that come in without considering the level of priority that needs to be addressed first. To solve this problem, the author proposes a solution by developing a Priority-Based Scheduling system using a Web-Based Dynamic Priority Scheduling Algorithm. The Dynamic Priority Scheduling Algorithm is used to manage queue scheduling by prioritizing processes with the highest priority. This system will display information about customer queue scheduling, such as customer identity, address, or issues faced.