Bank Queuing Optimization Based on Markov Process

Abstract

Queuing optimization is a troubling problem in the field of operations research and it is difficult to solve completely due to the complexity and uncertainty of the queuing environment. Among them, bank queuing optimization is the most widespread and representative in the queuing theory. This article focuses on using customer arrival and service of cashiers to establish birth-death process and its transfer rate matrix. By introducing service intensity and customer satisfaction index, it is concluded that the optimal number of open cashiers in different time period can be calculated and predicted.