scholarly journals Queuing System Modeling for Supermarkets

2019 ◽  
Vol 9 (2S2) ◽  
pp. 591-597
Keyword(s):  
Average Length ◽  
System Modeling ◽  
Business Leaders ◽  
Queuing System ◽  
Supplementary Variable ◽  
Method Performance ◽  
Service Oriented ◽  
Day To Day Operations ◽  
Number Of Customers ◽  
Complex Computer

Supermarkets may not have the IT needs that service-oriented businesses do, but that does not mean they cannot use computers in their day-to-day operations. Many supermarkets are adopting complex computer systems that allow them to regulate many of their practices, providing business leaders with more information to make decisions with and making some processes automatic, saving supermarkets both time and money. For the complete satisfaction of the customers, in system modeling, various queuing system is followed by the super markets. In all those queuing system, various queuing issue have to be dealt with. Among those, on of the Queuing problem is inspected and it is considered as a Non Markovian Queuing issues. For the above portrayed Queuing problem, by the usage of supplementary variable method, performance measures like number of customers in the system, average length of the queue, waiting time of the customers in the system as well as in the queue are derived. In addition, idle time of the server and the time spent by the server for each service are determined. The model is well justified by means of a Numerical portrayal and a grow graphical examination is done toward the end to favour the model

A single server Markovian queuing system with limited buffer and reverse balking

2021 ◽  
Vol 12 (7) ◽  
pp. 1774-1784
Author(s):  
Girin Saikia ◽  
Amit Choudhury
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Mutual Fund ◽  
System Size ◽  
Queuing System ◽  
Single Server ◽  
Insurance Company ◽  
Number Of Customers ◽  
Steady State Probabilities

The phenomena are balking can be said to have been observed when a customer who has arrived into queuing system decides not to join it. Reverse balking is a particular type of balking wherein the probability that a customer will balk goes down as the system size goes up and vice versa. Such behavior can be observed in investment firms (insurance company, Mutual Fund Company, banks etc.). As the number of customers in the firm goes up, it creates trust among potential investors. Fewer customers would like to balk as the number of customers goes up. In this paper, we develop an M/M/1/k queuing system with reverse balking. The steady-state probabilities of the model are obtained and closed forms of expression of a number of performance measures are derived.

Performance Analysis of an M/G/1 Feedback Retrial Queue with Two Types of Service and Bernoulli Vacation

2016 ◽  
pp. 38-54
Author(s):  
Arivudainambi D ◽  
Gowsalya Mahalingam
Keyword(s):  
Retrial Queue ◽  
Single Server ◽  
Supplementary Variable ◽  
Number Of Customers ◽  
Bernoulli Schedule ◽  
Schedule Mechanism ◽  
Fcfs Discipline ◽  
Bernoulli Vacation

This chapter is concerned with the analysis of a single server retrial queue with two types of service, Bernoulli vacation and feedback. The server provides two types of service i.e., type 1 service with probability??1 and type 2 service with probability ??2. We assume that the arriving customer who finds the server busy upon arrival leaves the service area and are queued in the orbit in accordance with an FCFS discipline and repeats its request for service after some random time. After completion of type 1 or type 2 service the unsatisfied customer can feedback and joins the tail of the retrial queue with probability f or else may depart from the system with probability 1–f. Further the server takes vacation under Bernoulli schedule mechanism, i.e., after each service completion the server takes a vacation with probability q or with probability p waits to serve the next customer. For this queueing model, the steady state distributions of the server state and the number of customers in the orbit are obtained using supplementary variable technique. Finally the average number of customers in the system and average number of customers in the orbit are also obtained.

scholarly journals Analysis of M/M/1 Queuing System with Customer Reneging During Server Vacations Subject To Server Breakdown and Delayed Repair

2018 ◽  
Vol 7 (4.10) ◽  
pp. 552
Author(s):  
Ch. Swathi ◽  
V. Vasanta Kumar
Keyword(s):  
Steady State ◽  
Closed Form ◽  
Detailed Analysis ◽  
Performance Measures ◽  
Queuing System ◽  
Multiple Vacation ◽  
Delayed Repair ◽  
Server Breakdown ◽  
Number Of Customers ◽  
Steady State Probabilities

In this paper, we consider an M/M/1 queuing system with customer reneging for an unreliable sever. Customer reneging is assumed to occur due to the absence of the server during vacations.  Detailed analysis for both single and multiple vacation models during different states of the server such as busy, breakdown and delayed repair periods is presented. Steady state probabilities for single and multiple vacation policies are obtained. Closed form expressions for various performance measures such as average number of customers in the system, proportion of customers served and reneged per unit time during single and multiple vacations are obtained.   

Development of a Heuristics Model for Simplifying a Multi-Channel Queuing System

2011 ◽  
Vol 367 ◽  
pp. 647-652
Author(s):  
B. Kareem ◽  
A. A. Aderoba
Keyword(s):  
Waiting Time ◽  
Channel Model ◽  
Single Channel ◽  
Queuing System ◽  
Queuing Model ◽  
Average Waiting Time ◽  
Queuing Models ◽  
Significant Difference ◽  
Number Of Customers ◽  
Proportionality Principle

Queuing model has been discussed widely in literature. The structures of queuing systems are broadly divided into three namely; single, multi-channel, and mixed. Equations for solving these queuing problems vary in complexity. The most complex of them is the multi-channel queuing problem. A heuristically simplified equation based on relative comparison, using proportionality principle, of the measured effectiveness from the single and multi-channel models seems promising in solving this complex problem. In this study, six different queuing models were used from which five of them are single-channel systems while the balance is multi-channel. Equations for solving these models were identified based on their properties. Queuing models’ performance parameters were measured using relative proportionality principle from which complexity of multi-channel system was transformed to a simple linear relation of the form = . This showed that the performance obtained from single channel model has a linear relationship with corresponding to multi-channel, and is a factor which varies with the structure of queuing system. The model was tested with practical data collected on the arrival and departure of customers from a cocoa processing factory. The performances obtained based on average number of customers on line , average number of customers in the system , average waiting time in line and average waiting time in the system, under certain conditions showed no significant difference between using heuristics and analytical models.

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 On the optimal assignment of customers to parallel servers

1978 ◽  
Vol 15 (02) ◽  
pp. 406-413 ◽  
Author(s):  
Richard R. Weber
Keyword(s):  
Stochastic Process ◽  
Service Time ◽  
Hazard Rate ◽  
Random Variable ◽  
Queuing System ◽  
Optimal Assignment ◽  
Parallel Servers ◽  
Shortest Queue ◽  
Number Of Customers

We consider a queuing system with several identical servers, each with its own queue. Identical customers arrive according to some stochastic process and as each customer arrives it must be assigned to some server's queue. No jockeying amongst the queues is allowed. We are interested in assigning the arriving customers so as to maximize the number of customers which complete their service by a certain time. If each customer's service time is a random variable with a non-decreasing hazard rate then the strategy which does this is one which assigns each arrival to the shortest queue.

Queuing Scheme with Feedback Service and Discretionary Administration

2019 ◽  
Vol 9 (1S4) ◽  
pp. 706-710 ◽  
Keyword(s):  
Generating Function ◽  
Average Length ◽  
Probability Generating Function ◽  
Function Approach ◽  
Single Server ◽  
Queue Size ◽  
Supplementary Variable ◽  
Variable Technique ◽  
Supplementary Variable Technique ◽  
Central Organization

This article take a gander at a bunch area single server channel Queuing system, where the server gives two sorts of organizations viz., beginning one a central organization and the optional organization is permitted as a second organization. In case in need, the customer settle on the optional organization .We other than anticipate that after the execution of the second time of affiliation, if the structure is unfilled, the server takes a required get-away of general dissemination. Organization thwarts in the midst of principal organization at random. Additionally if the customer isn't satisfied with the primary central organization, an info advantage for the proportionate is given to make a worthy space for the customers in the system. For the above delineated covering issue, the supplementary variable technique and generating function approach are used to derive the probability generating function of the queue size and the average length of the queue.

scholarly journals On the optimal assignment of customers to parallel servers

1978 ◽  
Vol 15 (2) ◽  
pp. 406-413 ◽  
Author(s):  
Richard R. Weber
Keyword(s):  
Stochastic Process ◽  
Service Time ◽  
Hazard Rate ◽  
Random Variable ◽  
Queuing System ◽  
Optimal Assignment ◽  
Parallel Servers ◽  
Shortest Queue ◽  
Number Of Customers

We consider a queuing system with several identical servers, each with its own queue. Identical customers arrive according to some stochastic process and as each customer arrives it must be assigned to some server's queue. No jockeying amongst the queues is allowed. We are interested in assigning the arriving customers so as to maximize the number of customers which complete their service by a certain time. If each customer's service time is a random variable with a non-decreasing hazard rate then the strategy which does this is one which assigns each arrival to the shortest queue.

scholarly journals ANALISIS SISTEM ANTRIAN DAN HUBUNGANNYA DENGAN PELAYANAN KASSA PADA PT. CARREFOUR CITRA GARDEN MEDAN

2017 ◽  
pp. 79-103
Author(s):  
Peran Simanihuruk
Keyword(s):  
Service Time ◽  
Arrival Rate ◽  
Research Problem ◽  
Queuing System ◽  
Analysis Technique ◽  
Study Population ◽  
New Year’S Eve ◽  
Time Required ◽  
Number Of Customers ◽  
Standard Service

PT. Carrefour Citra Garden Medan engaged in the retail market various products, such as fresh, bazaar, textile, and grocery applane. The number of customers who shop from January to December 2010 fluctuates every month and long lines occurred in August when the feast of Eid al-Fitr and December when the Christmas and New Year's Eve. From the description, formulated the following research problem: "Why is the gap between the queuing system raises expectations with actual service time at the PT. Carrefour Citra Garden Field ".The research objective was to determine and analyze the queuing system on PT. Carrefour Citra Garden Medan. Benefits of the research is to provide information material to the company in the form of advice regarding the analysis of queuing systems. The study population is the number of customers of PT. Carrefour Citra Garden Field from 2009 until 2010. The samples taken months from January to December 2010. Required data are collected through observation and documentation techniques. Data analysis technique used is descriptive method. From the results of the discussion was concluded that the long queues at the PT. Carrefour Citra Garden Medan often occur on Saturday at 17.00 pm - 20.00 pm, and on a Sunday or holiday queues at 12.00 am - 14.00 pm and at 17.00 pm - 20.00 pm. Standard service time for each customer at the PT. Carrefour Citra Garden Medan maximum of 1 minute, yet customers have to wait up to 20 minutes at the feast of Eid al-Fitr and Christmas Day at 9 minutes. Customer arrival rate at PT. Carrefour Citra Garden Medan is not constant, the time required to serve every customer is different, Kassa served on a first come, first served basis and unlimited customer population. The probability of unemployed workers pads reach 4%. The number of customers in the queuing system at 43 people. The probability of the whole staff busy pads reach 94.91%. Customer in the queue system to 33 people. The time spent waiting and served customers to reach 26 minutes. Time spent waiting for customers to be served up to 20 minutes. This shows that the waiting time to be served is still too high. Suggestions are given for consideration to the management company is the best, firms pay more attention to the system queue by adding pads officers to serve customers at the time of school entry, the feast of Eid al-Fitr and Christmas celebrations and other holidays to reduce the long queues . To avoid the presence of officers who are unemployed pads, the company should provide to an officer other duties such as checking and making gauze packin

Optimality of the shortest line discipline

1977 ◽  
Vol 14 (01) ◽  
pp. 181-189 ◽  
Author(s):  
Wayne Winston
Keyword(s):  
Finite Number ◽  
Stochastic Order ◽  
Queuing System ◽  
Number Of Customers

We consider a queuing system consisting of a finite number of identical exponential servers. Each server has its own queue, and upon arrival each customer must be assigned to some server's queue. Under the assumption that no jockeying between queues is permitted, it is shown that the intuitively satisfying rule of assigning each arrival to the shortest line maximizes, with respect to stochastic order, the discounted number of customers to complete their service in any time t.

Sign in / Sign up

Export Citation Format

Share Document