Queuing Model to determine optimum service counters based on arrivals, service pattern and max waiting time agreed.

Queuing Model to plan a cutomer service facility based on arrival, service pattern and waiting time.

Description
The purpose of this model is to determine the number of servers required to meet the service level of maximum waiting time. This is based on the arrival rate (inter arrival time between customers) and the inter customer service time.


Based on the optimum number of servers the capital cost and the variable cost (e.g., manpower) is estimated which results in per customer cost incurred over a period (annually). The cost per customer can be used to decide on user charges.


The start time and the duration in a day is dynamic and is changeable to provide desired output. The service level of maximum waiting time (in the queue + service time) is dynamic and can be changed to get different results.



A discrete probability distribution or pattern of the arrival time between successive customer arrivals (inter-arrival times) and a similar customers probability distribution or pattern for the service times between successive customer served (inter-service time) has been built in the model. These distributions are the source of arrival and service data in the model.


This model can be used in a customer service environment like health centers, banks, Government service, rail ticket counters, post offices etc. to plan number of servers (counters)

This Best Practice includes
One Excel Sheet with multiple tabs.

Sumit Barua, CFA (ICFAI), PMP offers you this Best Practice for free!

download for free

Add to bookmarks

Discuss

Further information

This model can be used in a customer service environment like health centers, banks, Government service counters, rail ticket counters, post offices etc. to plan number of servers (counters) so that the customer waiting time doesn’t exceed a certain agreed service level.

Keep the arrivals and services randomly selected by the model.


0.0 / 5 (0 votes)

please wait...