• Login
    View Item 
    •   USU-IR Home
    • Faculty of Mathematics and Natural Sciences
    • Department of Mathematics
    • Undergraduate Theses
    • View Item
    •   USU-IR Home
    • Faculty of Mathematics and Natural Sciences
    • Department of Mathematics
    • Undergraduate Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Analisis Sistem Antrian dan Simulasi Pelayanan di Kantor BPJS Kesehatan Kota Medan dengan Menggunakan Metode Monte Carlo

    View/Open
    Fulltext (3.109Mb)
    Date
    2018
    Author
    Zebua, Justin Ventalius
    Advisor(s)
    Harahap, Agus Salim
    Metadata
    Show full item record
    Abstract
    In the study at the BPJS Health Office in Medan City, the queues were long enough to do research and there were participants queuing longer. Queue registration system is a queuing system consisting of counters. The purpose of this thesis research is to provide an overview of the queue model, determine the size of effectiveness and look for optimal solutions. The data analyzed are data on busy days on Monday, May 7, 2018, Friday, May 11, 2018, and Monday, May 14, 2018. Data collection is done in two methods, namely interviews and observations. Data on arrivals and services obtained are then grouped per 10 minutes. Furthermore, the examination of the Poisson and exponential distribution tests, determines the queue model and calculates the measure of effectiveness. The size of the queue effectiveness in the registration section can be calculated using the model (M / M / 1) :( GD / ∞ / ∞). Queuing system optimization is done in two ways, adding server and Monte Carlo simulation. The registration queue system will be optimal if added by 1 (one) server. If optimization uses Monte Carlo simulation, the queuing system capacity must be limited to achieve optimal results. And the average participant queuing around 5,515 minutes.
     
    Pada penelitian di Kantor BPJS Kesehatan Kota Medan memiliki antrian yang cukup panjang sehingga di lakukan penelitian dan terdapat peserta mengantri lebih lama. Sistem antrian bagian pendaftaran merupakan sistem antrian yang terdiri dari Loket. Tujuan dari penelitian skripsi ini yaitu memberikan gambaran model antrian, menentukan ukuran keefektifan dan mencari solusi optimal. Data yang dianalisis yaitu data hari sibuk pada hari Senin, 07 Mei 2018, Jumat, 11 Mei 2018, dan Senin, 14 Mei 2018. Pengambilan data dilakukan dengan dua metode yaitu wawancara dan observasi. Data kedatangan dan pelayanan yang diperoleh kemudian dikelompokkan per 10 menit. Selanjutnya pemeriksaan uji distribusi Poisson dan eksponensial, menentukan model antrian dan menghitung ukuran keefektifan. Ukuran keefektifan antrian pada bagian pendaftaran dapat dihitung menggunakan model (M/M/1):(GD/∞/∞). Optimasi sistem antrian dilakukan dengan dua cara yaitu menambah server dan simulasi Monte Carlo. Sistem antrian bagian pendaftaran akan optimal jika ditambah 1 (satu) server. Apabila optimasi menggunakan simulasi Monte Carlo, maka kapasitas sistem antrian harus dibatasi sampai mencapai hasil optimal. Dan menghasilkan rata-rata peserta mengantri sekitar 5,515 menit.

    URI
    http://repositori.usu.ac.id/handle/123456789/11918
    Collections
    • Undergraduate Theses [1412]

    Repositori Institusi Universitas Sumatera Utara (RI-USU)
    Universitas Sumatera Utara | Perpustakaan | Resource Guide | Katalog Perpustakaan
    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of USU-IRCommunities & CollectionsBy Issue DateTitlesAuthorsAdvisorsKeywordsTypesBy Submit DateThis CollectionBy Issue DateTitlesAuthorsAdvisorsKeywordsTypesBy Submit Date

    My Account

    LoginRegister

    Repositori Institusi Universitas Sumatera Utara (RI-USU)
    Universitas Sumatera Utara | Perpustakaan | Resource Guide | Katalog Perpustakaan
    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV