APPLICATION OF NON-PREEMPTIVE PRIORITY SCHEDULING METHOD FOR WORK ORDER SCHEDULING SYSTEM

Authors

  • Suratun Suratun Ibn Khaldun University
  • Novita Br Ginting Ibn Khaldun University https://orcid.org/0000-0001-6643-4248
  • Zulkarnaen Noor Syarif Ibn Khaldun University
  • Ryan Abdul Gofur Ibn Khaldun University

DOI:

https://doi.org/10.33480/jitk.v10i3.5610

Keywords:

allocation, non-preemptive scheduling, priority scheduling, scheduling, work orders

Abstract

Work order allocation is one of the problems experienced by PT Indomobil Trada Nasional. Companies need tools to make it easier to allocate work orders effectively, namely an optimal work order scheduling system. Work order allocation data for the last three months was 3,817, with 15 technicians. This work order exceeds the company's target, namely to have a difference of 1.2 work orders per technician daily. These work orders have a priority order in their processing. The work order scheduling method used in this research is the non-preemptive priority scheduling method. The non-preemptive priority scheduling method is used because it can determine which work orders are in the queue and ready to be allocated according to the priority order without disturbing work orders that are being worked on when new work orders arrive. The work order scheduling system that was built provides adequate scheduling time and produces a smaller average waiting time, namely 12.97 minutes.   The average waiting time in the scheduling system without priority non-preemptive scheduling is 52.18, and the difference in average waiting time for the 34 existing work orders is 39.12 minutes. Applying the non-preemptive priority scheduling method helps companies allocate work orders optimally.

Downloads

Download data is not yet available.

References

P. I. W. TRADA, “PT Indomobil Trada Nasional, Profil Perusahaan,” 2024. https://www.indomobilnissan.com/. [Accessed: January 1, 2024 ].

M. I. Afrianto, F. Fauziah, and Y. F. Wijaya, “Kombinasi Algoritma Priority Scheduling dan Earliest Due Date untuk Sistem Penjadwalan Slitting Produk Berbasis Web,” TEKNOKOM, vol. 7, no. 1, pp. 180–186, Feb. 2024, doi: 10.31943/teknokom.v7i1.176.

R. C. Soegiyarto1 and D. Fatrianto Suyatno2, “Rancang Bangun Sistem Informasi Penjadwalan Menggunakan Metode Round Robin Berbasis Website (Studi Kasus : Ardymax Wedding Service),” JEISBI, vol. 02, no. 03, pp. 71-78, 2021, [Online]. Available: https://ejournal.unesa.ac.id/index.php/JEISBI/article/view/41721.

S. Fadli, M. Ashari, and K. Imtihan, “SISTEM PENJADWALAN EVENT ORGANIZER DENGAN METODE ROUND ROBIN (RR)”, misi, vol. 3, no. 2, pp. 100–107, Jul. 2020, [Online]. Available: http://e-journal.stmiklombok.ac.id/index.php/misi.

R. Setyawati and A. B. Maulachela, “Penerapan Algoritma Dynamic Priority Scheduling pada Antrian Pencucian Mobil,” JTIM : Jurnal Teknologi Informasi dan Multimedia, vol. 2, no. 1, pp. 29–35, May 2020, doi: 10.35746/jtim.v2i1.85.

R. S. S. 1 Raxmonova Munisaxon Rashodovna1, “Analysis of scheduling algorithms in operating systems,” in Proceedings of the 15th International Scientific and Practical Conference «Scientific Horizon in the Context of Social Crises», vol. 198, no. April, 2024, pp. 25–34.

B. Sun, T. Kloda, S. A. Garcia, G. Gracioli, and M. Caccamo, “Minimizing cache usage with fixed-priority and earliest deadline first scheduling,” Real-Time Systems, vol. 60, no. 4, pp. 625–664, Jun. 2024, doi: 10.1007/s11241-024-09423-7.

M. Dani Chairudin, N. Br. Ginting, and H. Fajri, “Information System for Selection of Production Line for Plastic Item Injection Machine Number A36 Using Priority Scheduling Method,” INTENSIF: Jurnal Ilmiah Penelitian dan Penerapan Teknologi Sistem Informasi, vol. 4, no. 2, pp. 232–246, Aug. 2020, doi: 10.29407/intensif.v4i2.14321.

M. T. D. Putra, H. Hidayat, N. Septian, and T. Afriani, “Analisis Perbandingan Algoritma Penjadwalan CPU First Come First Serve (FCFS) Dan Round Robin,” Building of Informatics, Technology and Science (BITS), vol. 3, no. 3, pp. 207–212, Dec. 2021, doi: 10.47065/bits.v3i3.1047.

E. Orrù, “The European PNR Directive as an instance of pre-emptive, risk-based algorithmic security and its implications for the regulatory framework1,” Information Polity, vol. 27, no. 2, pp. 131–146, Jul. 2022, doi: 10.3233/ip-211531.

M. Kandpal, N. Keshari, A. S. Yadav, M. Yadav, and R. K. Barik, “Modelling of blockchain based queuing theory implementing preemptive and non-preemptive algorithms,” International Journal of System Assurance Engineering and Management, vol. 15, no. 6, pp. 2554–2570, Mar. 2024, doi: 10.1007/s13198-024-02276-0.

S. Sundari, M. Y. Syahputra, and R. Rismayanti, “Penerapan algoritma Shortest Job First ( SJF) dan Priority Scheduling (PS) Pada Maintanance Mesin ATM,” Algoritma: Jurnal Ilmu Komputer dan Informatika, vol. 7, no. 1, Apr. 2023, doi: 10.30829/algoritma.v7i1.15377.

A. Shioura, V. A. Strusevich, and N. V. Shakhlevich, “Preemptive scheduling of parallel jobs of two sizes with controllable processing times,” Journal of Scheduling, vol. 27, no. 2, pp. 203–224, Apr. 2023, doi: 10.1007/s10951-023-00782-w.

E. E. Surbakti, N. Rizky, I. Z. Pane, and F. Khouwira, “Efficient Order Management: Design and Implementation of a System using Scheduling Algorithms and Expert Validation,” Ultimatics : Jurnal Teknik Informatika, vol. 15, no. 2, p. 115, 2023, doi: https://doi.org/10.31937/ti.v15i2.3489.

D. Fan and B. Liang, Online Non-preemptive Multi-Resource Scheduling for Weighted Completion Time on Multiple Machines, vol. 1, no. 1. Association for Computing Machinery, 2024.

M. C. Pognon, A. Quintero, and S. Pierre, “Adaptive Priority Scheduling of Internet of Things Data for Disaster Management in Smart Cities,” IEEE Access, vol. 12, pp. 83285–83298, 2024, doi: 10.1109/ACCESS.2024.3407672.

M. I. Abdillah and M. D. Irawan, “Implementation of the First Come First Served Algorithm in the Futsal Field Booking Application using Extreme Programming,” ZERO: Jurnal Sains, Matematika dan Terapan, vol. 7, no. 2, p. 182, Dec. 2023, doi: 10.30829/zero.v7i2.19163.

A. A. Rohmah and D. Gunawan, “Implementasi Algoritma Priority Scheduling Sistem Informasi Pelayanan Administrasi Kependudukan Desa,” Jurnal Informatika: Jurnal Pengembangan IT, vol. 8, no. 3, pp. 181–187, Sep. 2023, doi: 10.30591/jpit.v8i3.4891.

M. N. Nababan, W. Purba, and E. Indra, “The Tuition Payment Queuing System Uses Android-Based First in First Out (FIFO) Algorithm,” IOP Conference Series: Earth and Environmental Science, vol. 748, no. 1, p. 012038, Apr. 2021, doi: 10.1088/1755-1315/748/1/012038.

N. B. Ginting, Y. Afrianto, and S. Suratun, “Design of a Web-Based Lecture Scheduling Information System During Pandemic Covid-19 (Case Study: Faculty of Engineering and Science, Ibn Khaldun University),” Jurnal Online Informatika, vol. 6, no. 2, pp. 172–181, Dec. 2021, doi: 10.15575/join.v6i2.727.

Downloads

Published

2025-02-26

How to Cite

[1]
S. Suratun, N. B. Ginting, Z. N. . Syarif, and R. A. . Gofur, “APPLICATION OF NON-PREEMPTIVE PRIORITY SCHEDULING METHOD FOR WORK ORDER SCHEDULING SYSTEM”, jitk, vol. 10, no. 3, pp. 698–709, Feb. 2025.

Issue

Vol. 10 No. 3 (2025): JITK Issue February 2025

Section

Articles

License

Copyright (c) 2025 Suratun Suratun, Novita Br Ginting, Zulkarnaen Noor Syarif, Ryan Abdul Gofur

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.