Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
52 views

Queueing Theory Assignments

Queueing theory models systems where customers arrive randomly to receive service from servers. A document on queueing theory assignments describes key concepts like arrival rate, service time, queue characteristics, and applications to traffic flow, scheduling, and facility design. It provides examples of different queueing systems and answers questions to distinguish between their components and metrics.

Uploaded by

Zunair Khan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views

Queueing Theory Assignments

Queueing theory models systems where customers arrive randomly to receive service from servers. A document on queueing theory assignments describes key concepts like arrival rate, service time, queue characteristics, and applications to traffic flow, scheduling, and facility design. It provides examples of different queueing systems and answers questions to distinguish between their components and metrics.

Uploaded by

Zunair Khan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Queueing Theory

Assignments
__________________________________________
TASK# 1:
Q.1 What is Queueing theory and its importance? 
Answer: Queueing theory was developed to predict the behavior of systems that attempt to provide
service for randomly arising demands. It is important to help with creating an efficient and cost- efficient
workflow, allowing the user to improve traffic flow. 

Q.2 How can we avoid queues? 


Answer: We can avoid queues to design a system in which service rate is greater than the arrival rate.

Q.3 What is waiting time or waiting delay? Is it the time a customer spends in the queue? 
Answer: Waiting time or waiting delay is the time that the job in the queue, not being served. It is also
called the “time in queue”. 
                                                             E[T] = E[Tq] + E[S]  

Q.4 Explain Response time a.k.a. Sojourn? 


Answer: Response time is defined as the time from when a job first arrives at the service facility until it
completes service. 
                                                               T = (t_depart) – (t_arrive) 

Q.5 Is it true that the goal of queueing analyst is to design an “optimal” system according to some
criterion? 
Answer: Yes, it is true that the goal of queueing analysis is to design an optimal system. 

Q.6 What are the basic characteristics of queueing processes? 


Answer: There are six basic characteristics of queueing processes provide an adequate description of
queueing system. 
1. Arrival Pattern 
2. Service pattern 
3. Number of servers 
4. System capacity 
5. Queue discipline 
6. Number of service stages  
  

Q.7 Describe applications of queueing theory? 


Answer: There are many valuable applications of queueing theory including: 
 Traffic flow 
 Scheduling 
 Facility design 

Traffic Flow: Traffic flow is define as the total time a vehicle spends in the system, which equals the
sum of waiting time and service time.  

Scheduling: Scheduling is the policy in which define the arrival sequence of the customer some
scheduling policy is FCFS, LCFS, SIRO. 
Queueing Theory
Assignments
__________________________________________
Facility design:  There are many possible facility designs that can be used for dispatching jobs to hosts. 
 Random  
 Round-Robin 
 Shortest-Queue 
 Size-Interval-Task-Assignment (SITA) 
 Least-Work-Left (LWL) 
 Central Queue 

TASK# 2:
Q.1 Differeniate between Preemptive and Non-Preemptive FCFS?
Answer:

Preemptive Non-Preemptive
Interrupted or means the server hold the current Non Interrupted or means the server not wait the
customer. current customer.
It has overheads scheduling the processes. It does not overheads scheduling the processes.
Flexible Rigid
In preemptive scheduling, CPU utilization is high. In non-preemptive scheduling, CPU utilization is
low.

Q. 2 In each of the following situations, identify the customer and the server.

 Plane arriving at an airport


Answer: Arriving Customer: Plane, Server: Runway

 Taxi stand serving waiting passengers


Answer: Arriving Customer: Passenger, Server: Taxi

 Letter processed in the post office


Answer: Arriving Customer: Letter, Server: Clerk

 Registeration for classes in a university


Answer: Arriving Customer: Registeration, Server: University

 Legal court cases


Answer: Arriving Customer: Case, Server: Court

 Check-out operation in a supermarket


Answer: Arriving Customer: Check-out, Server: Supermarket
Queueing Theory
Assignments
__________________________________________
 Parking lot operation
Answer: Arriving Customer: Parking, Server: Area

 The checkout stand in a grocery store


Answer: Arriving Customer: Checkout stand, Server: Grocery store

 A fire Station
Answer: Arriving Customer: Fire, Server: Station

 The toll booth for a bridge


Answer: Arriving Customer: Toll booth, Server: Bridge

 A bicycle repair shop


Answer: Arriving Customer: Bicycle, Server: Shop

 A shipping dock
Answer: Arriving Customer:Shipping, Server: Dock

 A group of semiautomatic machines assigned to one operator


Answer: Arriving Customer: Machine, Server: Operator

 The materials-handling equipment in a factory area


Answer: Arriving Customer: Equipment, Server: Factory

 A plumbing shop
Answer: Arriving Customer: Plumbing, Server: Shop

 A job shop producing customer order


Answer: Arriving Customer: Order, Server: Job shop

 A secretarial typing pool


Answer: Arriving Customer: Secretary , Server: Pool

Q.3 Explain your understanding of the relationship between the arrival rate and the average
interarrival time. What are the units describing each variable?
Answer: Arrival rate at which the jobs arrive to the server, and interarrival time at which average time
between successive job arrivals. Relationship between arrival rate and average interarrival time is arrival
rate inversely proportional to average interarrival time. Average interval time unit is hour and average
arrival rate unit is arrival per hour.
Queueing Theory
Assignments
__________________________________________
Q.4 In each of the following cases, determine the average arrival rate per hour, and the average
interarrival time in hours.

 One arrival occurs every 10 minutes


Answer: Average interarrival time = 1/λ = 10 mintues = 1/6 hour, Average Arrival rate = λ = 6 per
hour

 Two arrivals occur every 6 minutes


Answer: One arrival occurs in every 3 minutes
Average interarrival time = 1/λ = 3 mintues = 1/20 hour, Average Arrival rate = λ = 20 per hour

 Number of arrivals in a 30 minute period is 10


Answer: One arrival occurs in every 3 minutes
Average interarrival time = 1/λ = 3 mintues = 1/20 hour, Average Arrival rate = λ = 20 per hour

 The average interval between successive arrivals is 0.5 hour


Answer: One arrival occurs in every 30 minutes
Average interarrival time = 1/λ = 30 mintues = 1/2 hour, Average Arrival rate = λ = 2 per hour
Q.5 In each of the following cases, determine the average service rate per hour, µ, and the average
service time in hours.

 One service is completed every 12 minutes


Answer: Average service time = E[S] = 1/µ = 12 minutes = 1/5 hour, Average service rate = µ = 5
service/hour.

 Two departure occur every 15 minutes


Answer: One departure occur in every 7.5 minutes
Average service time = E[S] = 1/µ = 7.5 minutes = 1/8 hour, Average service rate = µ = 8
service/hour.

 Number of customers served in a 30 minute period is 5


Answer: One customer served in 6 minute period
Average service time = E[S] = 1/µ = 6 minutes = 1/10 hour, Average service rate = µ = 10
service/hour.

 The average service time is 0.3 hours


Answer: Average service time = E[S] = 1/µ = 0.3 hour, Average service rate = µ = 1/0.33 = 3.33
service/hour.
Queueing Theory
Assignments
__________________________________________
Q.6 Consider a typical barbar shop, Demonstrate that it is a queueing system by describing its
components.
Answer: Input source: Population having hair.
Calling Units: Customers wanting haircuts.
Queue: Customers waiting for a barbar.
Service Discipline: Usually FCFS.
Service Mechanism: Barbers and Equipment.

You might also like