Exam 11: Queueing Models
Exam 1: Introduction54 Questions
Exam 2: Linear Programming: Basic Concepts85 Questions
Exam 3: Linear Programming: Formulation and Applications76 Questions
Exam 4: The Art of Modeling With Spreadsheets75 Questions
Exam 5: What-If Analysis for Linear Programming75 Questions
Exam 6: Network Optimization Problems84 Questions
Exam 7: Using Binary Integer Programming to Deal With Yes-Or-No Decisions76 Questions
Exam 8: Nonlinear Programming75 Questions
Exam 9: Decision Analysis80 Questions
Exam 10: Forecasting77 Questions
Exam 11: Queueing Models78 Questions
Exam 12: Computer Simulation: Basic Concepts79 Questions
Exam 13: Computer Simulation With Analytic Solver77 Questions
Select questions type
Multiple-server queueing systems can perform satisfactorily with somewhat higher utilization factors than can single-server queueing systems.
Free
(True/False)
4.9/5
(34)
Correct Answer:
True
In a single-server system, the utilization factor is equal to the mean arrival rate divided by the mean service rate.
Free
(True/False)
4.7/5
(39)
Correct Answer:
True
Customers arrive at a suburban ticket outlet at the rate of 14 per hour on Monday mornings (exponential interarrival times). Selling the tickets and providing general information takes an average of 3 minutes per customer, and varies exponentially. There is 1 ticket agent on duty on Mondays.
How many minutes does the average customer wait in line?
Free
(Multiple Choice)
4.9/5
(32)
Correct Answer:
A
Waiting lines occur even in systems that are less that 100% utilized because of variability in service rates and/or arrival rates.
(True/False)
4.7/5
(30)
Priority Average Arrival Rate (exponential interarrival times) High 3 per hour Low 5 per hour
Nurrber\nobreakspaceof\nobreakspaceservers: 5 Service\nobreakspacerate: 2\nobreakspaceper\nobreakspacehour\nobreakspace(exponential\nobreakspaceservice\nobreakspacetimes)
What is the average time in line (in minutes) for a high priority item?
(Multiple Choice)
4.8/5
(31)
Decreasing the variability of service times, without any change in the mean, improves the performance of a single-server queueing system substantially.
(True/False)
4.8/5
(25)
Customers filter into a record shop at an average of 1 per minute (exponential interarrivals) where the service rate is 15 per hour (exponential service times).
What is the minimum number of servers needed to keep the average time in the system under 6 minutes?
(Multiple Choice)
4.7/5
(31)
Priority Average Arrival Rate (exponential interarrival times) High 3 per hour Low 5 per hour
Nurrber\nobreakspaceof\nobreakspaceservers: 5 Service\nobreakspacerate: 2\nobreakspaceper\nobreakspacehour\nobreakspace(exponential\nobreakspaceservice\nobreakspacetimes)
What is the overall arrival rate per hour?
(Multiple Choice)
4.7/5
(36)
Which of the following will equal the average time that a customer is in the system?
I. The average number in the system divided by the arrival rate.
II. The average number in the system multiplied by the arrival rate.
III. The average time in line plus the average service time.
(Multiple Choice)
4.7/5
(42)
Priority Average Arrival Rate (exponential interarrival times) High 3 per hour Low 5 per hour
Nurrber\nobreakspaceof\nobreakspaceservers: 5 Service\nobreakspacerate: 2\nobreakspaceper\nobreakspacehour\nobreakspace(exponential\nobreakspaceservice\nobreakspacetimes)
What is the average time in the system (in minutes) for a low priority item?
(Multiple Choice)
4.7/5
(38)
During the early morning hours, customers arrive at a branch post office at the average rate of 45 per hour (exponential interarrival times), while clerks can handle transactions on an average of 4 minutes each (exponential).
If clerk cost is $30 per hour and customer waiting time represents a cost of $20 per hour, how many clerks can be justified on a cost basis?
(Multiple Choice)
4.7/5
(43)
Managers who oversee queueing systems are usually concerned with how many customers are waiting and how long they will have to wait.
(True/False)
4.9/5
(38)
The exponential distribution will always provide a reasonably close approximation of the true service-time distribution.
(True/False)
4.9/5
(34)
A single server queueing system has an average service time of 8 minutes and an average time between arrivals of 10 minutes. The arrival rate is:
(Multiple Choice)
4.8/5
(38)
A single-server queueing system has an average service time of 16 minutes per customer, which is exponentially distributed. The manager is thinking of converting to a system with a constant service time of 16 minutes. The arrival rate will remain the same. The effect will be to:
(Multiple Choice)
4.8/5
(37)
In a nonpreemptive priority system, customers are served in the order in which they arrive in the queue.
(True/False)
4.9/5
(26)
Priority Average Arrival Rate (exponential interarrival times) High 3 per hour Low 5 per hour
Nurrber\nobreakspaceof\nobreakspaceservers: 5 Service\nobreakspacerate: 2\nobreakspaceper\nobreakspacehour\nobreakspace(exponential\nobreakspaceservice\nobreakspacetimes)
What is the average number of low priority items waiting in line for service?
(Multiple Choice)
4.9/5
(39)
Showing 1 - 20 of 78
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)