Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
33 views
50 pages
Queuing
Uploaded by
Ujjwal
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save queuing For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
33 views
50 pages
Queuing
Uploaded by
Ujjwal
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save queuing For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 50
Search
Fullscreen
Queueing Theory “Delay is the enemy of efficier and “waiting is the enemy of ilisation” sd. INTRODUCTION ‘a flow of customers from infinite/finite population towards the service facility forms a queue (waiting fine) on account of lack of capability to serve them all at a time, The queues may be of persons waiting at a doctor's clinic or at railway booking office, these may be of machines waiting to be repaired or of ships in the harbour waiting to be unloaded or of letters arriving at a typist’s desk. In the absence of a perfect balance between the service facilities and the customers, waiting is required tither of the service facilities or for the customer's arrival. By the term ‘customer’ we mean the arriving unit that requires some service to be performed. The customer may be of persons, machines, vehicles, parts, etc. Queues (waiting line) stands for a number of customers waiting to be serviced. The queue does not include the customer being serviced. The process Sr aystem that performs the services to the customer is termed by service channel or service facility, ‘The subject of queueing is not directly concerned with optimization (maximisation Ot minimization). Rather, it attempts to explore, ‘understand, and compare various queueing situations and thus indirectly achieves optimization approximately. 21:2. QUEUEING SYSTEM ‘The mechanism of a queueing process is very simple. Customers arrive at a service counter and are Trend to by one or more of the servers. As soon as a customer is served, it departs from the system, Thaw a queucing system can be described as consisting of customers arriving for service, waiting for sence iit is not immediate, and leaving the system after being served. ‘The general framework of a queueing system is shown in Fig, 21.1 : Served customers Teaving em [PER Queue Waiting customers Queue discipline Fig, 21.1, Queueing System 21; . ELEMENTS OF A QUEUEING SYSTEM The basic elements of a queueing system are as follows : 1. Input (or Arrival) Process. This element of queueing system is concerned with the pattern in Which the customers arrive for service. Input source can be described by following three factors :590 2 of the queue. If the a ae of potenti ean: ‘the input source is said to be finite. On the other hand, it ating sey fficiently large in number, then the input source is consid tential custe TE only few ustomers may arrive at the service facility in batches ce 0 be infin "iing In the case when more than one arrival is allowed to e, Iked size op of y, ystem does not necessarily mean entering into service), MHET the system sin tle sing - in the ii Sim Ships discharging cargo at a dock, families visiting rane is said to ety eC. ate the ull chan, @ si al customers then size Oo! service are Su! Also, the ¢! ‘or one by one (entering the 8 or in batches. bulk arrivals. _— (b) Pattern of arrivals. Customers may arrive in the system at knows times, or they may arrive in a random way. In case the arrival times are k queueing problems are categorized as deterministic models. On the other hi successive arrivals (inter-arrival times) is uncertain, the arrival Pattern is measured arrival rate ot iter-arrival time, These are characterised by the probability dismiter so this random process. The most common stochastic queueing models assume that Poisson distribution and/or the inter-arrival times follow an exponential distributi (c) Customers’ behaviour. It is also necessary to know the reaction of a customer upon enterin the system. A customer may decide to wait no matter how long the queue becomes (patient castomer, or if the queue is too long to suit him, may decide not to enter it (impatient customer). Machina arriving at the maintenance shop in a plant are examples of patient customers. For impatient customers, (i) if a customer decides not to enter the queue because of its length, he is said to have baiked. 8 (ii) if a customer enters the queue, but after some time loses patience and decides to leave, then he is said to have reneged. (iii) if a customer moves from one queue to another (providing similar/different services) for bis Personal economic gains, then he. is said to have jockeyed for position. The final factor to be’ considered regarding the input process is the manner in which the arval pattern changes with time. The input process which does not change with time is called a stationary input process. If it is time dependent then the process is termed as transient. ; ne i when a 2. Queue Discipline. It is a rule according to which customers are selected for sei CED, queue has been formed. The most common queue discipline is the “first come, first ae or the “frst in, first out” (FIFO) rule under which the customers are serviced in the St to bas arrivals. Other queue discipline include : “last in, first out” (L/FO) rule according ‘ast arrival in the system is serviced first. ded is This discinn; Pe the last item loa is discipline is practised in most cargo handling situations where items arrive 3¢2 Femoved first. Another example may be from the production process. whe is taken first 1° workplace and are stacked one on top of the other. Item on the t0 1 disciplines at reressi®® which is the last one to have arrived for service. Besides seve random ct Setvice in random order” (SIRO) rule according to which | ding which ee teSPective of their arrivals in the system; and a variety of priority u se eee S service is done in preference over some other customer. oom Inder priority disci F = (i) Pre-emptive priority. the eunn eri ny discipline, the service is of two types : (i) Pre eevetomers That is. lower Customer's corer 8h Priority are given service over the low priority CUS ser, The I * Service is interrupted (pre-empted) to start service for a Prony service n served. * resumed again as soon as the highest priority customer has ve goes ahead in lon 7 . . ie stom but his service cet priority. In this ease the highest priority CUM curently ust Started only after the completion of the service © mer, y P| rest (regular or of NOWN With ce and, if the time hers fet mean ution associated with arrival rate follow 4 ion. yp of the stacl these, othe! i ich the arrivals are schemes — #660\EING THEORY oueu! 591 vice Mechanism. The service 3 eee foo The te vice mechanism is concerned with service time and service ti ee re infinite eee from the commencement of service to the completion of service r ey serval and there will be no queue, S then all the customers are served instantaneously on number of servers is 7 It oe ectomene may ao then the customers are served according to a specific order. eat. by the same server, such aga wy eutches of fixed size or of variable size rather than indi + Such as a computer with para indore system in this ease is termed sone parallel processing or people boarding a bus. das bulk service system. In the case of parallel channels “fastest server rule (FSR) is adopted. For its discussion we suppose that the customers arrive before parallel service channels, If only one service channel is free, then incoming customer is assigned to free service channel, But it will be more efficient to assume that an incoming c pe be assigned a server of largest service rate among the free ones. Service facilities can be of the following types : (a) Single queue-one server, i.e., one queue-one service channel, wherein the customer waits till the service point is ready to take him in for servicing, (b) Single queue-several servers wherein the customers w: : ait in a single qu cue until one of the service channels is ready to take them in for servicing, ‘ (c) Several queues-one server wherein there are several queues and the customer may join any one of these but there is only one service channel (d) Several servers. When there are several service channels available to provide service, much depends upon their arrangements. They may be arranged in parallel or in series or a more complex combination of both, depending on the design of the system’s service mechanism, By parallel channels, we mean a number of channels providing identical service facilities Further, customers may wait in a single queue until one of the service channels is ready to serve. as in a barber shop where many chairs are considered as different service channels; or customers may form separate queues in front of each service channel as in the case of super markets. For series channels, a customer must pass through all the service channels in sequence before service is completed. The situations may be seen in public offices where parts of the service are done at different service counters. 4, Capacity of the System. The source from which customers are generated may be finite or infinite. A finite source limits the customers arriving for service. i.e., there is a finite limit to the maximum queue size. The queue can also be viewed as one with forced baking where a customer is forced to balk if he arrives at a time when queue size is at its limit. Alternatively, an infinite source is forever “abundant” as in the case of telephone calls arriving at a telephone exchange. 214, OPERATING CHARACTERISTICS OF A QUEUEING SYSTEM Some of the operational characteristics of a queueing system, that are of general interest for the evaluation of the performance of an existing queueing system and to design a new system are as follows : 1. Expected number of customers in the system denoted by E(n) or L is the average number of customers in the system, both waiting and in service. Here, 1 stands for the number of customers in the queueing system. | 2. Expected number of customers in the queue denoted by E (m) or L, is the average number of customers waiting in the queue. Here m = 1, ie., excluding the customer being served. 3. Expected waiting time in the system denoted by E (v) or W is the average total time spent bya Customer in the system. It is generally taken to be the waiting time plus servicing time.
You might also like
Queuing Part 1 PDF
PDF
No ratings yet
Queuing Part 1 PDF
13 pages
Queuing Theory Notes
PDF
0% (1)
Queuing Theory Notes
6 pages
Queuing Theory
PDF
100% (6)
Queuing Theory
25 pages
USMAACST6 Unit 4 Queueing Theory 2020-21 Lecture Notes Amrit Rajwadkar
PDF
No ratings yet
USMAACST6 Unit 4 Queueing Theory 2020-21 Lecture Notes Amrit Rajwadkar
48 pages
5 Applied Queuing Model 1
PDF
No ratings yet
5 Applied Queuing Model 1
42 pages
QT Theory Merged OCR
PDF
No ratings yet
QT Theory Merged OCR
189 pages
BIF3203 - Part II Analytical Model of Queuing Systems (November 2012)
PDF
No ratings yet
BIF3203 - Part II Analytical Model of Queuing Systems (November 2012)
76 pages
Queueing Models
PDF
No ratings yet
Queueing Models
44 pages
Queuing System
PDF
No ratings yet
Queuing System
76 pages
Queuing Analysis
PDF
100% (1)
Queuing Analysis
47 pages
Queiung Model
PDF
No ratings yet
Queiung Model
33 pages
Characteristics of Queuing System
PDF
No ratings yet
Characteristics of Queuing System
5 pages
Queuing Theory
PDF
No ratings yet
Queuing Theory
23 pages
Queuing Theory Chapter
PDF
No ratings yet
Queuing Theory Chapter
22 pages
Waiting Line Models
PDF
100% (1)
Waiting Line Models
40 pages
Module-5 - Queueing Theory
PDF
No ratings yet
Module-5 - Queueing Theory
31 pages
Queue Management
PDF
No ratings yet
Queue Management
47 pages
Chapter 3 Students
PDF
No ratings yet
Chapter 3 Students
29 pages
Basic Characteristcis of Queue System
PDF
No ratings yet
Basic Characteristcis of Queue System
4 pages
Queueing Nvs R 02 Nov 2024
PDF
No ratings yet
Queueing Nvs R 02 Nov 2024
20 pages
Módulo D - OM Solutions (8 Edición) - Barry Render y Jay Heizer
PDF
No ratings yet
Módulo D - OM Solutions (8 Edición) - Barry Render y Jay Heizer
13 pages
Queuing Theory
PDF
100% (1)
Queuing Theory
76 pages
Queuing Theory
PDF
No ratings yet
Queuing Theory
13 pages
Chapter 7
PDF
No ratings yet
Chapter 7
29 pages
Final Queuing Theory
PDF
No ratings yet
Final Queuing Theory
67 pages
Queuing Models - 20.04.2023
PDF
No ratings yet
Queuing Models - 20.04.2023
39 pages
Lecture 1 Queuing Theory (Elements and Characteristics)
PDF
No ratings yet
Lecture 1 Queuing Theory (Elements and Characteristics)
34 pages
Queuing Theory - With Probability Distributions
PDF
No ratings yet
Queuing Theory - With Probability Distributions
71 pages
06 Chapter1
PDF
No ratings yet
06 Chapter1
30 pages
Waiting Line Theroy
PDF
No ratings yet
Waiting Line Theroy
15 pages
BookChapter-QueueingSystem
PDF
No ratings yet
BookChapter-QueueingSystem
32 pages
4 Queuing System Ioenotes
PDF
No ratings yet
4 Queuing System Ioenotes
40 pages
Queuing Theory
PDF
100% (1)
Queuing Theory
25 pages
Queuing Theory
PDF
No ratings yet
Queuing Theory
35 pages
Queueing Theory
PDF
No ratings yet
Queueing Theory
21 pages
Chapter 4
PDF
No ratings yet
Chapter 4
45 pages
OR Chapter 3-1
PDF
No ratings yet
OR Chapter 3-1
61 pages
Queuing Theory: Waiting Line Analysis
PDF
No ratings yet
Queuing Theory: Waiting Line Analysis
47 pages
Slides 9: Queuing Models
PDF
No ratings yet
Slides 9: Queuing Models
48 pages
4 Queuing System
PDF
No ratings yet
4 Queuing System
43 pages
Chapter 4 - Queuing System
PDF
No ratings yet
Chapter 4 - Queuing System
25 pages
Chapter 7 QUEUEING MOEL
PDF
No ratings yet
Chapter 7 QUEUEING MOEL
18 pages
Queueing Theory
PDF
No ratings yet
Queueing Theory
21 pages
Queuing Analysis: Lecture Notes in Transportation Systems Engineering
PDF
No ratings yet
Queuing Analysis: Lecture Notes in Transportation Systems Engineering
13 pages
Queuing Theory (Waiting Line Theory) : Queueing Theory Study Notes - Emma Charles 0753-236-367/0787-080-333 - Win 10 Pro
PDF
No ratings yet
Queuing Theory (Waiting Line Theory) : Queueing Theory Study Notes - Emma Charles 0753-236-367/0787-080-333 - Win 10 Pro
10 pages
Queuing Theory With P&S
PDF
No ratings yet
Queuing Theory With P&S
22 pages
OR-I-Lecture_Matl-01-02-2021-P1
PDF
No ratings yet
OR-I-Lecture_Matl-01-02-2021-P1
21 pages
Queueing
PDF
No ratings yet
Queueing
43 pages
Introdution
PDF
No ratings yet
Introdution
6 pages
Queuing Models
PDF
No ratings yet
Queuing Models
8 pages
Queing Theory
PDF
No ratings yet
Queing Theory
4 pages
Queuing Theory
PDF
No ratings yet
Queuing Theory
5 pages
Queuing (Or Waiting Line) : Theory
PDF
No ratings yet
Queuing (Or Waiting Line) : Theory
8 pages
10 Queueing Theory
PDF
No ratings yet
10 Queueing Theory
5 pages
Chapter 2
PDF
No ratings yet
Chapter 2
6 pages