5th Asia Pacific Conference on Industrial Engineering and Operations Management

Utilizing Multiple Server Queuing System of Barbershop Service Firm in Bagong Silang Caloocan City

0 Paper Citations
1 Views
1 Downloads
Track: Undergraduate Student Paper Competition
Abstract

Queueing theory is an essential and fair way to handle customer flow when resources are scarce when studying lines creation, functioning, and reasons. Not implementing a queueing system to manage excess capacity can have negative consequences. This study aims to optimize the queue management system at the Barbershop by addressing issues such as prolonged wait times and lineups due to increased afternoon customer arrivals, leading to worker fatigue and extended operating hours. The goal is to have a comprehensive analysis of Barbershop's queueing system, focusing on waiting times, queue lengths, and service rates using kendall notation and queueing theory formulas and perform using MATLAB software. The results show that the barbershop's current utilization rate is 88.33%, exceeding working hours. The probability of no customers in the queue is 12.43%, and the total capacity is 7%. The expected number of customers in the queue and queuing system is 1.3631 and 2.9141, respectively. The expected waiting time is 38 minutes in the system and 18 minutes in the queue. The proposed queuing theory reduces this to 55.56%. The proposed queueing system at the barbershop significantly improves service performance, reducing waiting times and potential customer departures, compared to the current system with only two customers. Future research should involve more observations, data collection, and continuous improvement using modern approaches and alternative methodologies.

Keywords: Barbershop, Operations Research, Queue, Queueing Management, Queueing Theory.

Published in: 5th Asia Pacific Conference on Industrial Engineering and Operations Management, Tokyo, Japan

Publisher: IEOM Society International
Date of Conference: September 10-12, 2024

ISBN: 979-8-3507-1729-7
ISSN/E-ISSN: 2169-8767