Published: 2024-07-01

Optimalisasi Aplikasi Pengendalian Skripsi Menggunakan Algoritma Dynamic Priority Scheduling dan Sequential Search

DOI: 10.35870/jtik.v8i3.2219

Issue Cover
Article Metrics
Share:

Abstract

Thesis registration in the academic environment often faces priority and time management problems, therefore an effective and responsive approach is needed. This study suggests optimizing the Dynamic Priority Scheduling and Sequential Search algorithms to improve the performance of thesis control applications. Dynamic characteristics of students and service requests regulate submission priorities and a sequential search algorithm improves the search for thesis-related information in the database. This research discusses the ideas of both algorithms and how they can improve system efficiency by integrating them.

Keywords

Dynamic Priority Scheduling; Sequential Search; Thesis Management

Peer Review Process

This article has undergone a double-blind peer review process to ensure quality and impartiality.

Indexing Information

Discover where this journal is indexed at our indexing page.

Open Science Badges

This journal supports transparency in research and encourages authors to meet criteria for Open Science Badges.

Most read articles by the same author(s)

<< < 1 2