Claim Missing Document
Check
Articles

Found 2 Documents
Search

PENERAPAN DYNAMIC PROGRAMMING PADA PENJADWALAN PENERBANGAN UNTUK MINIMASI DELAY Ariel Sudarsono; Raphael Lee; Yohannes Yohannes
Syntax : Journal of Software Engineering, Computer Science and Information Technology Vol 7, No 1 (2026): Juni 2026
Publisher : Universitas Dharmawangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46576/syntax.v7i1.8911

Abstract

Abstrak— Keterlambatan penerbangan komersial menjadi tantangan besar dalam manajemen operasional bandara yang berdampak pada efisiensi sistem. Penelitian ini bertujuan mengoptimalkan penjadwalan penerbangan untuk meminimalkan total delay menggunakan algoritma Dynamic Programming. Eksperimen dilakukan menggunakan dataset maskapai penerbangan dari Kaggle dengan membatasi ruang lingkup pada 15.000 baris data pertama dan kapasitas waktu operasional harian sebesar 1.440 menit. Parameter weight ditentukan berdasarkan durasi terbang, sedangkan value dibentuk menggunakan fungsi penalti keterlambatan. Tahap post-processing diterapkan dengan aturan celah waktu minimum 20 menit untuk mengeliminasi konflik rute. Hasil penelitian menunjukkan algoritma berhasil menyusun kombinasi jadwal final berisi 16 penerbangan optimal. Penerapan metode ini terbukti efektif menekan total keterlambatan menjadi 107,0 menit dengan rata-rata delay sebesar 6,68 menit per penerbangan.Kata Kunci—Dynamic Programming, Keterlambatan Penerbangan, Optimasi Jadwal, Post-processing. AbstractCommercial flight delays present a major challenge in airport operational management, impacting system efficiency. This study aims to optimize flight scheduling to minimize total delays using Dynamic Programming. Experiments were conducted using an airline dataset from Kaggle, limiting the scope to the first 15,000 data rows with a daily operational time capacity of 1,440 minutes. The weight parameter was determined based on flight duration, while the value was formulated using a delay penalty function. A post-processing stage applied a minimum 20-minute time gap rule to eliminate route conflicts. The results show that the algorithm successfully generated a final schedule combination of 16 optimal flights. This approach effectively reduced the total delay to 107,0 minutes, achieving an average delay of only 6,68 minutes per flight.Keywords— Dynamic Programming, Flight Delays, Post-processing, Schedule Optimization.
Perancangan dan Pembangunan Aplikasi Mobile Manajemen Stok Material Proyek untuk CV Lingga Ariel Sudarsono; Raphael Lee; Novan Wijaya
MDP Student Conference Vol 5 No 2 (2026): The 5th MDP Student Conference 2026
Publisher : Universitas Multi Data Palembang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35957/mdp-sc.v5i2.14519

Abstract

Amidst rapid digital development, the need for an efficient material management system has become increasingly important. This study aims to design and develop a mobile application for managing project material stock at CV Lingga. The previously used paper-based manual recording system caused various issues, including data inaccuracies, delays in information delivery, and difficulties in monitoring stock in real time. The development method applied in this study is the Waterfall model, which consists of requirements analysis, system design, implementation, and testing stages. The developed application provides project management features, recording of incoming and outgoing materials, and weekly report generation. The implementation of the system is proven to improve data accuracy, accelerate administrative processes, and facilitate centralized, real-time material stock monitoring.