ANALISIS SISTEM ANTRIAN M/M/1 PADA KASIR TOKO SAGA MENGGUNAKAN APLIKASI QM FOR WINDOWS

Authors

  • Gregorius Anzelino Wijaya Prodi Teknik Informatika, Universitas Sepuluh Nopember Papua
  • Carolina Cetrin Yunike Imbiri Prodi Teknik Informatika, Universitas Sepuluh Nopember Papua
  • Melki Kayame Prodi Teknik Informatika, Universitas Sepuluh Nopember Papua
  • Mikaelda Regina Yagoyamu Prodi Teknik Informatika, Universitas Sepuluh Nopember Papua
  • Live Tong Prodi Teknik Informatika, Universitas Sepuluh Nopember Papua
  • Heru Sutejo Prodi Teknik Informatika, Universitas Sepuluh Nopember Papua

Keywords:

Queueing System, M/M/1, QM for Windows, Retail Store, Operational Cost

Abstract

This study aims to analyze the performance of the cashier queue system at Toko Saga using the M/M/1 queuing model and QM for Windows software. Assuming customer arrivals follow a Poisson distribution and service times are exponentially distributed, the M/M/1 model is applied to calculate system performance parameters and total operational costs. Based on observations, the average customer arrival rate is 7 customers per hour, while one cashier can serve 8 customers per hour. The simulation results show a system utilization rate of 88%, with an average of 6 customers waiting in line and an average queue time of approximately 52.5 minutes. The total operational cost per hour is recorded at Rp75,658, which includes cashier wages and customer waiting costs. The probability distribution indicates that the system most frequently operates with fewer than 10 customers, and the chance of exceeding 15 customers is low. Therefore, the current cashier system is considered efficient, although additional strategies such as cashier shifts or self-service systems are recommended to ensure continued performance and customer satisfaction.

References

Avrachenkov, K., & Nain, P. (2007). On the limiting distribution of the M/M/1 queue length process conditioned on non-empty queue. Operations Research Letters, 219–

https://doi.org/10.1016/j.orl.2006.05.002

Eschenfeldt, P., Gross, B., & Pippinger, N. (2011). Analysis of an M/M/1 queue using fixed order of search for arrivals and service. arXiv preprint.

https://arxiv.org/abs/1108.5356

He, Q.-M., & Alfa, A. S. (2005). The M/M/1 queue with two alternating service rates. Queueing Systems, 1-19.

https://doi.org/10.1007/s11134-005-4443-0

Kim, J., & Kim, B. (2008). Transient analysis of M/M/1 queue with breakdowns and repairs. Applied Mathematical Modelling, 1985–1994.

https://doi.org/10.1016/j.apm.2007.06.012

Li, Q., & Tian, N. (2003). Analysis of the M/M/1 queue with server vacation and breakdowns. Queueing Systems, 359–377.

https://doi.org/10.1023/A:1027356220073

Palomo, S., & Pender, J. (2023). The maximum overlap time in the M/M/1 queue. arXiv preprint.

https://arxiv.org/abs/2311.04387

Wang, F., & Wu, X.-Y. (2017). Queueing analysis of M/M/1 systems in retail checkout optimization. Journal of Operations Research and Applications, 45-56.

https://arxiv.org/abs/1704.01709

Wang, Y. (2005). Performance analysis of M/M/1 queue with working vacations. Applied Mathematics and Computation, 103–114.

https://doi.org/10.1016/j.amc.2004.11.008

Downloads

Published

2025-06-05

Issue

Section

Articles