Penjadwalan Jaga Dokter IGD Menggunakan Integer Linear Programming: Studi Kasus RSI Siti Hajar Sidoarjo

Fuadi, Fairuz (2026) Penjadwalan Jaga Dokter IGD Menggunakan Integer Linear Programming: Studi Kasus RSI Siti Hajar Sidoarjo. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 5025221315-Undergraduate_Thesis.pdf Restricted to Repository staff only Download (2MB) | Request a copy

Abstract

Penyusunan jadwal jaga dokter Instalasi Gawat Darurat (IGD) perlu memperhatikan ketersediaan dokter secara berkelanjutan, kebutuhan jumlah dokter pada setiap shift, request dokter, aturan setelah shift malam, dan pemerataan beban kerja. Pada studi kasus RSI Siti Hajar Sidoarjo, proses penjadwalan melibatkan 15 dokter, tiga shift kerja, dan periode 30 hari, sehingga diperlukan pendekatan yang dapat merepresentasikan aturan penjadwalan secara sistematis dan menghasilkan jadwal yang dapat dievaluasi.
Penelitian ini menggunakan input berupa data penjadwalan dokter IGD yang mencakup daftar dokter, durasi shift, kebutuhan dokter per shift, request dokter, dan target jam kerja bulanan. Proses penjadwalan dilakukan dengan pendekatan Integer Linear Programming (ILP), yaitu merepresentasikan keputusan penugasan dokter dalam bentuk variabel biner pada kombinasi dokter, shift, dan hari. Model diselesaikan menggunakan PuLP dan CBC Solver dengan hard constraint untuk aturan wajib serta soft constraint berbasis penalti untuk request dokter, kebutuhan shift, pola jadwal, dan pemerataan jam kerja. Output penelitian berupa jadwal jaga dokter IGD dalam file Excel yang dilengkapi status solver, jumlah pelanggaran constraint, objective breakdown, dan total jam dokter. Uji coba dilakukan dengan variasi jumlah dokter dan variasi time limit, sedangkan konfigurasi final menggunakan 15 dokter dan time limit 360 detik. Pada konfigurasi final, solver menghasilkan status Optimal dalam 20,48 detik dengan objective value 201,50. Aturan wajib yang terpenuhi mencakup larangan shift Pagi atau Sore setelah shift Malam, batas maksimal dua shift Malam berturut-turut, dan kebutuhan dua sampai tiga dokter pada shift Malam setiap hari. Kebutuhan shift Pagi dan Sore terpenuhi pada seluruh hari, 141 dari 147 request regular dan seluruh 24 request Cuti terpenuhi, sedangkan satu penalti pola jadwal masih ditemukan. Total jam dokter berada pada rentang 169,5 sampai 170,5 jam. Hasil ini menunjukkan bahwa model mampu menghasilkan jadwal yang memenuhi aturan wajib, mengakomodasi sebagian besar request dokter, dan menjaga pemerataan jam kerja sesuai target.
==================================================================================================================================
Emergency Department physician scheduling must consider continuous physician availability, staffing requirements for each shift, physician requests, post-night-shift rules, and workload balance. In the case study at RSI Siti Hajar Sidoarjo, the scheduling process involves 15 physicians, three work shifts, and a 30-day period, requiring an approach that can systematically represent scheduling rules and produce an evaluable roster. This study uses Emergency Department physician rostering data as input, including the physician list, shift durations, staffing requirements, physician requests, and monthly working- hour targets. The scheduling process is formulated using an Integer Linear Programming (ILP) approach, where physician assignment decisions are represented as binary variables over physician, shift, and day combinations. The model is solved using PuLP and CBC Solver, with hard constraints for mandatory rules and penalty-based soft constraints for physician requests, shift staffing, schedule patterns, and workload balance. The output is an Excel-based physician duty schedule containing solver status, constraint violation counts, objective breakdown, and physician working hours. The evaluation was conducted through variations in the number of physicians and solver time limits, while the final configuration used 15 physicians and a 360-second time limit. In the final configuration, the solver returned an Optimal status in 20.48 seconds with an objective value of 201.50. The satisfied mandatory rules include prohibiting morning or evening shifts after a night shift, limiting consecutive night shifts to two, and assigning two to three physicians to each night shift. Morning and evening staffing requirements were met on all days, 141 of 147 regular requests and all 24 leave requests were fulfilled, while one schedule-pattern penalty remained. The counted working hours ranged from 169.5 to 170.5 hours per physician. These xvi results show that the model can produce a schedule that satisfies mandatory rules, accommodates most physician requests, and maintains workload balance according to the specified target.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	CBC Solver, Instalasi Gawat Darurat, Integer Linear Programming, pemerataan beban kerja, penjadwalan dokter, CBC Solver, Emergency Department, Integer Linear Programming, Physician Rostering, Workload Balancing.
Subjects:	T Technology > T Technology (General) > T57.6 Operations research--Mathematics. Goal programming T Technology > T Technology (General) > T57.74 Linear programming T Technology > T Technology (General) > T58.62 Decision support systems
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User:	Fairuz Fuadi
Date Deposited:	30 Jul 2026 03:25
Last Modified:	30 Jul 2026 03:25
URI:	http://repository.its.ac.id/id/eprint/139586

Actions (login required)

View Item