Claim Missing Document
Check
Articles

Found 4 Documents
Search

Evaluation of Container Yard Locations Using Discrete Simulation Method Simarmata, Roberta; Sinulingga, Sukaria; Sembiring, Meilita Tryana
Jurnal Sistem Teknik Industri Vol. 26 No. 2 (2024): JSTI Volume 26 Number 2 July 2024
Publisher : TALENTA Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jsti.v26i2.16203

Abstract

The loading and unloading process are activity of unloading goods from ships with cranes and then being brought and arranged in temporary warehouses. PT Prima Termina Petikemas is a subsidiary of Pelindo which is engaged in shipping container loading and unloading services. For customer satisfaction, one of the indicators of the company is the truck round time (TRT) which is 33 minutes. Currently, the external truck round time (TRT) for delivery is 43.62 minutes with waiting time by 16.32 minutes and truck round time (TRT) receiving is 37.72 minutes with waiting time by 9.75 minutes. The discrete event simulation method aims to evaluate the determination of effective alternative container yard locations to anticipate truck round time (TRT). For all improvement scenarios carried out, the selected scenario for delivery using 4 blocks and 6 units of Automated Rubber Gantry Tyred (1 unit reach stacker) and the percentage of each block load is 20%. This can reduce the truck round time (TRT) 27.37 minutes with the waiting time is to 8.93 minutes. For receiving activity using 5 blocks and 6 units of Automated Rubber Gantry Tyred (ARTG) and the percentage of each block load is 20%. The waiting time become 9.92 minutes and this reduces the truck round time (TRT) by 33.67 minutes.
Analisis Antrean SPBU dengan Model M/M/c dan Simulasi Arena untuk Optimalisasi (Studi Kasus: SPBU NOMOR 14.201.125, MEDAN) simarmata, roberta; Purba, Johana Sihol Marito; Alia Dwi Septia
Jurnal Manajemen Rekayasa dan Inovasi Bisnis Vol. 4 No. 1 (2025): AGUSTUS 2025
Publisher : LPPM-ITEBA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62375/jmrib.v4i1.694

Abstract

This study analyzes the queuing system at the Gatot Subroto SPBU using the M/M/c model and Arena simulation to identify bottlenecks and optimize service. Arrival and service time data for motorcycles (Beta distribution) and cars (Weibull distribution) were modeled using Create, Hold, Decide, Process, and Dispose modules. M/M/c calculations (C = 2) showed high alignment for motorcycles (ρ = 0.0885, Wq = 0.02998 minutes) but less accuracy for cars (Wq = 0.1361 minutes) due to non-exponential distributions. Arena simulation revealed bottlenecks at POM 2 (Wq = 0.1202 minutes) and POM 4 (Wq = 0.3642 minutes) caused by uneven vehicle distribution, clustered arrivals, prolonged car service times, and FCFS discipline. A load balancing solution with 4 Decide modules and 10 replications increased pump utilization (POM 1: 60%, POM 2: 29%, POM 3: 61%, POM 4: 25%), reduced car service time (Ws decreased by 0.147 minutes), and lowered car queue length (Lq reduced by 0.0017), though motorcycle waiting time slightly increased (0.0255 minutes). Practical solutions include manual load balancing, pump flexibility, vehicle flow optimization, and supportive technology. The study demonstrates that load balancing effectively mitigates bottlenecks, but motorcycle service requires further improvement.
Analysis of Gas Station Queue System; Case Study Gas Station 13.201.101 on Jalan Jamin Ginting, Medan Baru District, Medan City Purba, Johana; Simarmata, Roberta; Marbinoto, Mayono Suko
Journal Governance Bureaucratic Review Vol. 2 No. 1 (2025): April, 2025
Publisher : Center for Maritime Policy Governance Studies (CMPGS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31629/jgbr.v2i1.7434

Abstract

Public Fuel Filling Stations (SPBU) are essential facilities that support transportation by ensuring the availability of fuel for motorized vehicles. However, long queues, particularly during peak hours, often cause traffic congestion, wasted time, and reduced customer satisfaction. These inefficiencies are generally linked to limited service capacity and uneven workload distribution among fuel pumps. This study aims to analyze the queuing system at Gas Station 13.201.101, Jalan Jamin Ginting, Medan, using the M/M/s queuing model and simulation with Arena software. Data were collected through direct observation of vehicle arrivals and service times for motorcycles and cars. Statistical tests, including chi-square and Kolmogorov-Smirnov, were applied to determine the best fit for inter-arrival and service time distributions, which followed exponential and beta distributions, respectively. The results indicate that motorcycles had an average inter-arrival time of 3.8 minutes and a service time of 3.3 minutes, while cars averaged 5.5 minutes between arrivals with 5.9 minutes of service. The theoretical M/M/s analysis showed relatively efficient performance, with less than one minute of waiting time and pump utilization ranging between 32% and 70%. In contrast, Arena simulation reflected real operational conditions more accurately, showing no waiting lines but revealing uneven distribution of workload among pumps, with some exceeding 70% utilization while others remained low. These findings highlight that while the system is generally efficient, improvements in vehicle routing and pump allocation are necessary. Recommendations include optimizing station layout, operator training, and adopting automated distribution systems to enhance efficiency and customer satisfaction.
Optimasi Penjadwalan Job Shop dengan Metode Algoritma Greedy Irwan, Hery; Abd Rahman, MD. Nizam; Ebrahim, Zuhriah binti; Simarmata, Roberta
PROFISIENSI : Jurnal Program Studi Teknik Industri Vol 8, No 2 (2020): PROFISIENSI DESEMBER 2020
Publisher : University of Riau Kepulauan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (550.683 KB) | DOI: 10.33373/profis.v8i2.2810

Abstract

Persoalan penjadwalan timbul apabila beberapa pekerjaan akan dikerjakan secara bersamaan, sedangkan sumber yang dimiliki terbatas. Input dari suatu penjadwalan mencakup jenis dan banyaknya part yang akan diproduksi, urutan proses dan ketergantungan antar operasi, waktu proses untuk masing-masing operasi, serta fasilitas yang dibutuhkan oleh setiap operasi. Sedangkan output dari penjadawalan meliputi dispatch list, yaitu daftar yang menyatakan urutan pemrosesan part serta waktu mulai dan selesai dari pemrosesan part. Algoritma Greedy merupakan salah satu metode untuk mengoptimalkan penjadwalan dengan tujuan minimasi make span.