Maulidati, Zuli (2018) Optimasi Penjadwalan Staf Rumah Sakit Dengan Menggunakan Algoritma Tabu Search Based Hyper-Heuristics (Studi Kasus: Rumah Sakit Ibu Dan Anak Kendangsari). Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
5214100701-Undergraduate_Thesis.pdf - Accepted Version Download (3MB) | Preview |
Abstract
Penjadwalan staf rumah sakit atau dikenal sebagai staff healthcare rostering merupakan permasalahan kompleks yang harus dihadapi setiap rumah sakit. Rumah sakit harus mempertimbangkan banyak aspek seperti jumlah perawat, pembagian shift, cost, kesempatan libur atau cuti dan constraint yang lain. Karena banyak pertimbangan tersebut, penjadwalan secara manual akan menjadi sangat sulit dan tidak bisa memberikan solusi yang optimal. Maka perlu adanya suatu model matematis untuk memudahkan permasalahan penjadwalan dengan menemukan solusi yang paling optimal. Permasalahan tersebut lebih dikenal dengan istilah nurse rostering problem (NRP). Secara umum pemodelan nurse rostering atau heathcare staff rostering harus memperhatikan batasan-batasan objek sehinga dapat menghasilkan hasil yang optimal. Masalah lain dari penjadwalan staf merupakan masalah keadilan antar staf yang bertugas, bagaimana pembagian alokasi libur, waktu kerja, atau tempat tugas menjadi dimensi yang perlu dipertimbangkan. Banyak Penelitian menyebutkan bahwa indeks kepuasan suatu perawat atau staf dalam bekerja dipengaruhi oleh tingkat keadilan dalam pembagian jadwal. Untuk menyelesiakan permasalahan tersebut, pada penelitian ini akan dilakukan penjadwalan dengan menggunakan algoritma tabu search hyperheuristic. Algoritma Tabu Search hyper-heuristic akan digunakan memberikan solusi terhadap masukan permasalahan dengan cara menghasilkan heuristik baru dengan menggunakan heuristic yang sudah ada. Hasil optimasi penjadwalan dengan algoritma tabu search hyper heuristics pada Penelitian ini dapat diterima. Semua hard constraint pada setiap unit dapat terpenuhi dan soft contrsaint yaitu nilai jains fairness pada masing-masing unit setelah optimasi dibandingkan hasil jadwal otomatis meningkat mendekati nilai keadilan total yaitu satu. Nilai JFI pada unit Farmasi meningkat sebesar 47%, unit Nicu & Ruang Bayi meningkat sebesar 48%, unit IGD meningkat sebesar 20%, unit SIM & RM meningkat sebesar 2%, unit Gizi & Café meningkat sebesar 23% dan Ruang Operasi meningkat sebesar 2%.
========================================================================================
Scheduling labor hospital or known as staff healthcare
rostering is the
complex problems that must be faced by each
hospital. Hospitals must consider many aspects such as the
number of nurses, the division of shifts, the cost, the chance of
a holiday or leave of absence and other
constraints. Because a lot of these considerati
ons, the scheduling manually will be very
difficult and can not give the optimal solution. It is necessary
the existence of a mathematical model to facilitate the
scheduling problems with finding the most optimal solution. The
problem is known with the ter
m nurse rostering problem (NRP).
In general, the modeling of the nurse rostering or hea
l
thcare
staff rostering should pay attention to the boundaries of the
object so that it can produce optimal results. Another problem
of staff scheduling is a matter of j
ustice between the staff on
duty, how the division of the allocation of holidays, working
time, or place of duty be the dimensions that need to be
considered. Many research mention that the satisfaction a nurse
or staff in the work influenced by the level
of fairness in the
division of the schedule. To resolve these problems, this
research will be done scheduling using tabu search algorithm
hyperheuristic. Algorithm Tabu Search hyper
-
heuristic will be
used to provide solutions to the input problems with how
to
generate a new heuristic using the heuristic that already exists.
viii
The results of the optimization of the scheduling with algorithm
tabu search hyper heuristics on the research can be accepted.
All hard constraints on each unit can be met and soft contr
saint
i.e. the value of the jains fairness on each unit after optimization
compared to the results of the schedule of automatic increases
approaching the value of justice, a total that one. The value of
JFI on the Pharmaceutical unit increased by 47%, Nicu
, &
Baby Room increased by 48%, the unit of the
Emergency
room
increased by 20%, SIM & RM units increased by 2%, unit of
Nutrition & Café increased by 23% and the Operating Room
increased by 2%.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Additional Information: | RSSI 658.53 Mau o-1 3100018074270 |
| Uncontrolled Keywords: | penjadwalan staf rumah sakit; manajemen sains; framework hyper-heuristic; algoritma tabu search; tabu search hyper-heuristic; jain fairness index; staff scheduling hospital; management science. |
| Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD69.T54 Time management. Scheduling Q Science > QA Mathematics > QA76.9 Computer algorithms. Virtual Reality. Computer simulation. |
| Divisions: | Faculty of Information and Communication Technology > Information Systems > 57201-(S1) Undergraduate Thesis |
| Depositing User: | Zuli Maulidati |
| Date Deposited: | 09 Feb 2018 03:00 |
| Last Modified: | 08 Jun 2020 03:03 |
| URI: | http://repository.its.ac.id/id/eprint/49496 |
Actions (login required)
 |
View Item |