Application of Queuing Theory to Analyse an ATM Queuing System

2022 ◽  
pp. 888-892
Author(s):  
Kolentino N. Mpeta ◽  
Otsile R. Selaotswe
Keyword(s):  
Queuing Theory ◽  
Queuing System

scholarly journals Performance Modelling of Health-care Service Delivery in Adekunle Ajasin University, Akungba-Akoko, Nigeria Using Queuing Theory

2020 ◽  
pp. 119-127
Author(s):  
Orimoloye Segun Michael
Keyword(s):  
Health Care ◽  
Service Delivery ◽  
Queuing Theory ◽  
Health Care Service ◽  
Health Centre ◽  
Arrival Rate ◽  
Queuing System ◽  
Service Rate ◽  
Suitable Model ◽  
The Mean

The queuing theory is the mathematical approach to the analysis of waiting lines in any setting where arrivals rate of the subject is faster than the system can handle. It is applicable to the health care setting where the systems have excess capacity to accommodate random variation. Therefore, the purpose of this study was to determine the waiting, arrival and service times of patients at AAUA Health- setting and to model a suitable queuing system by using simulation technique to validate the model. This study was conducted at AAUA Health- Centre Akungba Akoko. It employed analytical and simulation methods to develop a suitable model. The collection of waiting time for this study was based on the arrival rate and service rate of patients at the Outpatient Centre. The data was calculated and analyzed using Microsoft Excel. Based on the analyzed data, the queuing system of the patient current situation was modelled and simulated using the PYTHON software. The result obtained from the simulation model showed that the mean arrival rate of patients on Friday week1 was lesser than the mean service rate of patients (i.e. 5.33> 5.625 (λ > µ). What this means is that the waiting line would be formed which would increase indefinitely; the service facility would always be busy. The analysis of the entire system of the AAUA health centre showed that queue length increases when the system is very busy. This work therefore evaluated and predicted the system performance of AAUA Health-Centre in terms of service delivery and propose solutions on needed resources to improve the quality of service offered to the patients visiting this health centre.

The Application of Computer Simulation Technology in the Queuing System Optimization

2014 ◽  
Vol 556-562 ◽  
pp. 3849-3851
Author(s):  
Rong Hua Tan
Keyword(s):  
Computer Simulation ◽  
Queuing Theory ◽  
Optimization Problem ◽  
Classical Model ◽  
Discrete Event ◽  
System Optimization ◽  
Discrete Event System ◽  
Queuing System ◽  
Event System ◽  
Definition Of

The optimization Problem of queuing system is an important research subject in the queuing system.There are two ways to solve this problem:one is the traditional theoretical analysis, the other is the application of computer simulation. This thesis introduces the queuing theory and the simulation technique of discrete event system, including fundamental conceptions, methods, performance index and classical model of queuing system, as well as the definition of simulation and the procedure of the simulation of discrete event system. And procedure and parameters set of general modeling methods are analyzed.

scholarly journals Effective school cooperative-mart queuing system

2017 ◽  
Vol 13 (4-1) ◽  
pp. 412-415
Author(s):  
Ahmad Ridhuan Hamdan ◽  
Ruzana Ishak ◽  
Mohd Fais Usop
Keyword(s):  
Queuing Theory ◽  
Service Level ◽  
Queuing System ◽  
Queuing Model ◽  
Effective School ◽  
Service Centre ◽  
Large Numbers ◽  
Female Data ◽  
Waiting Line ◽  
Number Of Customers

Queuing Theory is a branch of knowledge in operation research that concerning the analysis of queues when a customer arrives at a service centre and shall queue in a line to get some service. The theory pays attention to how organizations can serve a large number of customers who demand a quality services and a queue of customers waiting to be served. Eventually, the store owners have to attend to large numbers of customers at a time have attempted to measure and manage queues to reduce the customer procession time. Besides, to increase sales and profit, productivity and operation efficiency, satisfaction levels and customer loyalty in using the service provided. In line to the situation, this study is to determine the effectiveness of the waiting line using Queuing Theory at cooperative-mart. Until today, no research conducted about school cooperatives-mart to observe and solve the massive inflow of customers at lines at a given time especially during lunch hour. The purposes of this study are to determine the customer congestion at the payment counter and to propose the effective queuing system at Cooperative-mart. Waiting and services times of customers at cooperative-mart is studied in three times period that to be considered as peak hours in two types of counter which are for male and female.  Data collection was observed by using queuing theory and the M/M/1/∞/∞ queuing model has been implemented.  The results show that for optimum service level, the counter must be changed from one to two counters each side.  The summary and finding of the study shall be used as guideline for the management of cooperative-mart in deciding improvement of its operation. 

scholarly journals Spectral expansion method for analysis of a system with shifted Erlang and hyper-Erlang distributions

2021 ◽  
Vol 24 (2) ◽  
pp. 55-61
Author(s):  
Veniamin N. Tarasov ◽  
Nadezhda F. Bakhareva
Keyword(s):  
Waiting Time ◽  
Queuing Theory ◽  
Expansion Method ◽  
Spectral Expansion ◽  
Queuing System ◽  
Erlang Distribution ◽  
Modern Theory ◽  
Calculation Formula ◽  
Average Waiting Time ◽  
Erlang Distributions

In this paper, we obtained a spectral expansion of the solution to the Lindley integral equation for a queuing system with a shifted Erlang input flow of customers and a hyper-Erlang distribution of the service time. On its basis, a calculation formula is derived for the average waiting time in the queue for this system in a closed form. As you know, all other characteristics of the queuing system are derivatives of the average waiting time. The resulting calculation formula complements and expands the well-known unfinished formula for the average waiting time in queue in queuing theory for G/G/1 systems. In the theory of queuing, studies of private systems of the G/G/1 type are relevant due to the fact that they are actively used in the modern theory of teletraffic, as well as in the design and modeling of various data transmission systems.

ANALISIS MODEL ANTRIAN DAN SIMULASI PADA BANK BNI 46 CABANG - UNIVERSITAS KUNINGAN

2018 ◽  
Vol 4 (1) ◽  
Author(s):  
Daswa . ◽  
Mohamad Riyadi
Keyword(s):  
Queuing Theory ◽  
Idle Time ◽  
Queuing System ◽  
Level Of Service ◽  
Time Service ◽  
Study Behavior ◽  
Pattern Distribution ◽  
Queue Model ◽  
Service Pattern ◽  
Arrival Pattern

Abstrak�Studi untuk mempelajari perilaku elemen antrian (waktu tunggu nasabah, waktu pelayanan, waktu menganggur teller dan sebagainya) dalam suatu sistem dapat ditinjau dengan teori antrian. Elemen antrian, terutama waktu pelayanan saat transaksi, dapat dijadikan tinjauan dalam meningkatkan kepuasan nasabah. Kecenderungan kesibukan aktivitas pelayanan di bank adalah merata setiap harinya. Kondisi ini berbeda dengan Bank BNI 46 Cabang Universitas Kuningan yang mempunyai antrian yang sangat panjang pada waktu menjelang UAS. Model antrian bank tersebut dianalisis dengan mempertimbangkan distribusi pola kedatangan, distribusi pola pelayanan dan jumlah teller menggunakan �fit test. Hasil uji ini menunjukkan pola kedatangan berdistribusi Poisson dan pola pelayanan berdistribusi eksponensial. Dan karena jumlah teller adalah 1, maka mengikuti notasi Kendall, model antrian bank adalah M/M/1. Simulasi pelayanan transaksi pada bank dilakukan untuk melihat kecenderungan perilaku elemen antrian. Simulasi menunjukkan semakin besar tingkat pelayanan, semakin besar peluang waktu menganggur teller. Akan tetapi, semakin besar tingkat pelayanan, banyak nasabah dalam antrian dan dalam sistem antrian akan semakin sedikit. Demikian juga dengan waktu rata-rata nasabah dalam antrian dan dalam sistem antrian.Kata Kunci: Model Antrian, Perilaku Elemen Antrian, Simulasi.�Abstract�A research to study behavior of queue elements (customer waiting time, service time, idle time teller and so on) in a system can be reviewed with queuing theory. The queue element, especially the transaction time, can be used as a review to improve customer satisfaction. The tendency of busy activity in bank service is evenly distributed every day. This condition is different from BNI 46 Bank branch Kuningan University which has a very long queue at the time before final examination. The bank queue model is analyzed by considering the distribution of arrival pattern, service pattern distribution and number of teller using fit test. The results of this test show the pattern of arrival of Poisson distributed and exponential distribution service pattern. And since the number of tellers is 1, then following Kendall notation, the bank queue model is M / M / 1. Simulation of transaction service at bank is done to see tendency of queue element behavior. Simulations show the greater the level of service, the greater the chance of idle time teller will be. However, the greater the level of service, the more customers in the queue and in the queuing system will be less. Likewise, the average time the customer is in the queue and in the queuing system.�Keywords: Queue Model, Behavior of Element Queue, Simulation.

Equipment Optimization Method of Electric Vehicle Fast Charging Station Based on Queuing Theory

2013 ◽  
Vol 291-294 ◽  
pp. 872-877 ◽  
Author(s):  
Guo Bing Qiu ◽  
Wen Xia Liu ◽  
Jian Hua Zhang
Keyword(s):  
Electric Vehicles ◽  
Queuing Theory ◽  
Service System ◽  
Optimization Method ◽  
Queuing System ◽  
System Model ◽  
Simulation Tool ◽  
Charging Station ◽  
Fast Charging ◽  
Fast Charging Station

As an important infrastructure of electric vehicles (EVs), EV fast charging station is of great significance in the popularization and development of EVs. Through the analysis of the characteristics of EV’s arriving time and charging duration in fast charging station, the stochastic service system was introduced and the queuing system model based on queuing theory was established. By calculating the indexes of the queuing system model, the desire model was used to optimize the number of EV chargers, which could save customers’ waiting time and reduce the investment of charging station. Finally, an example was simulated and calculated with MATLAB used as a simulation tool to verify the effectiveness of this approach.

scholarly journals Planning Model of Optimal Parking Area Capacity

2012 ◽  
Vol 22 (6) ◽  
pp. 449-457 ◽  
Author(s):  
Robert Maršanić ◽  
Zdenka Zenzerović ◽  
Edna Mrnjavac
Keyword(s):  
Decision Making ◽  
Key Words ◽  
Queuing Theory ◽  
Optimal Number ◽  
Queuing System ◽  
Basic Factor ◽  
Planning Model ◽  
Business Decision ◽  
The City

The demand for parking services is not a constant one, but rather varies from minimum to maximum. The range between the maximum and minimum demands and the dynamics of changes are the basic factor influencing the required size of the parking area capacity and the respective financial effects. The objective of this paper is to demonstrate that the queuing theory can be implemented in defining the optimal number of serving places (ramps) and the required capacity (number of parking spaces) in controlled access parking areas and that the established model can serve in business decision-making in respect to planning and development of the parking area capacity. The presented model has been verified in the example of the “Delta” parking area in the City of Rijeka but this model is particularly valuable as it can be implemented in any controlled access parking areas, i.e., parking areas with toll-bars under current or any other changed future conditions. KEY WORDS: planning of parking area capacities, optimal parking area capacity, queuing theory, parking area as a queuing system

scholarly journals Analysis of a k-Stage Bulk Service Queuing System with Accessible Batches for Service

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 559
Author(s):  
Achyutha Krishnamoorthy ◽  
Anu Nuthan Joshua ◽  
Vladimir Vishnevsky
Keyword(s):  
Queuing Theory ◽  
Queuing System ◽  
Batch Size ◽  
Arrival Process ◽  
Service Process ◽  
Service Rate ◽  
Single Server ◽  
Service Time Distribution ◽  
Waiting Room ◽  
Bulk Service

In most of the service systems considered so far in queuing theory, no fresh customer is admitted to a batch undergoing service when the number in the batch is less than a threshold. However, a few researchers considered the case of customers accessing ongoing service batch, irrespective of how long service was provided to that batch. A queuing system with a different kind of accessibility that relates to a real situation is studied in the paper. Consider a single server queuing system in which the service process comprises of k stages. Customers can enter the system for service from a node at the beginning of any of these stages (provided the pre-determined maximum service batch size is not reached) but cannot leave the system after completion of service in any of the intermediate stages. The customer arrivals to the first node occur according to a Markovian Arrival Process (MAP). An infinite waiting room is provided at this node. At all other nodes, with finite waiting rooms (waiting capacity cj,2≤j≤k), customer arrivals occur according to distinct Poisson processes with rates λj,2≤j≤k. The service is provided according to a general bulk service rule, i.e., the service process is initiated only if at least a customers are present in the queue at node 1 and the maximum service batch size is b. Customers can join for service from any of the subsequent nodes, provided the number undergoing service is less than b. The service time distribution in each phase is exponential with service rate μjm, which depends on the service stage j,1≤j≤k, and the size of the batch m,a≤m≤b. The behavior of the system in steady-state is analyzed and some important system characteristics are derived. A numerical example is presented to illustrate the applicability of the results obtained.

scholarly journals Providing a New Strategy for Reducing the Queue Congestion in the Refah Chain Store of Zahedan, Analyzing and Simulating of the Queuing System by Using Minitab and Arena Software

2017 ◽  
Vol 1 (1) ◽  
pp. 35-41
Author(s):  
Ali Sadatmandzadeh ◽  
Sepideh Hosseinidoost
Keyword(s):  
Customer Service ◽  
Queuing Theory ◽  
Waiting Times ◽  
Statistical Technique ◽  
Queuing System ◽  
Chain Store ◽  
Arrival Times ◽  
Queue System ◽  
Chain Stores ◽  
New Strategy

Queuing theory is important as a statistical technique for solving problems, analyzing systems, and reducing the adverse effects of waiting. The present research has been done to solve the problem of overcrowding congestion during the distribution of subsidy goods in the Refah chain stores. The purpose of the research is to analyze the queuing system and provide a solution to overcome the crowds in the Refah stores. In this research, a way of providing customer service was reviewed, then customer arrival times, waiting times in queues and customer service were measured. The type of time distribution was followed by Minitab software. Then, the Arena software and the obtained distributions used to simulate the queue system of the store. And the simulation results were used to analyze the queuing system. The results showed that during the distribution of subsidy goods, to fix the queue congestion, 40% of customers should beat the 2nd fund and the rest should equally be divided between the 5th and 6th funds. The implementation of the run-queue system, before the customer enters the funds, is the innovation of this research.

scholarly journals ANALYSIS OF COMMUTER LINE TICKET PURCHASE QUEUING SYSTEM IN BOGOR STATION

2017 ◽  
Vol 2 (02) ◽  
pp. 35
Author(s):  
Resista Vikaliana
Keyword(s):  
Queuing Theory ◽  
Service Use ◽  
Single Channel ◽  
Performance Measure ◽  
Queuing System ◽  
Queuing Model ◽  
The One ◽  
Multi Phase ◽  
Ticket Purchase ◽  
First In First Out

Queue is a situation that happen to people, goods, and components that need to wait to get a service. The good quality of service will satisfy the customers and decrease the queue line. Queue often happens in a station especially in weekdays. A long queue line happens in the station is one of the problems that need to be solved. Instead of manual ticket purchasing that served by the operator, today PT KAI Commuter Line also serve ticket purchasing using THB machine. The purpose of this study is to compare the performance of queuing model that happen in Bogor station locket and to determine if the queuing model is efficient by comparing the service standard, between the manual and the one that used THB machine. The method used in this research was descriptive method by using queuing theory calculation. The model of locket queuing using THB machine in Bogor Station is Multi Channel-Multi Phase, in ticket purchasing using THB machine. Besides, in the operator locket service, the queuing model is Single Channel-Single Phase. Both s ticket purchasing service use First In First Out (FIFO) disciple. The maximum amount of the queue line and the source of customers’ arrival are infinite. Based on the value of system performance can be concluded that queuing system and the service given already great and effective (based on the performance measure and probability or passengers’’ chances), passengers who are waiting to buy tickets, either manual or using machine less than 1, or assumed 1 person. From the observation, the use of THB machine decrease the queue line, but need to be socialized because passengers does not know how to use THB machine to buy ticket independently.Keywords: queue, queuing model, commuter line ticket purchasing, Bogor station

Sign in / Sign up

Export Citation Format

Share Document