Exam 11: Waiting Line Models
Exam 1: Introduction49 Questions
Exam 2: An Introduction to Linear Programming52 Questions
Exam 3: Linear Programming: Sensitivity Analysis and Interpretation of Solution47 Questions
Exam 4: Linear Programming Applications in Marketing, Finance and Operations Management38 Questions
Exam 5: Advanced Linear Programming Applications35 Questions
Exam 6: Distribution and Network Problems54 Questions
Exam 7: Integer Linear Programming43 Questions
Exam 8: Nonlinear Optimization Models48 Questions
Exam 9: Project Scheduling: Pertcpm44 Questions
Exam 10: Inventory Models51 Questions
Exam 11: Waiting Line Models48 Questions
Exam 12: Simulation49 Questions
Exam 13: Decision Analysis42 Questions
Exam 14: Multicriteria Decisions45 Questions
Exam 15: Forecasting47 Questions
Exam 16: Markov Processes41 Questions
Exam 17: Linear Programming: Simplex Method46 Questions
Exam 18: Simplex-Based Sensitivity Analysis and Duality34 Questions
Exam 19: Solution Procedures for Transportation and Assignment Problems42 Questions
Exam 20: Minimal Spanning Tree18 Questions
Exam 21: Dynamic Programming30 Questions
Select questions type
Queue discipline refers to the manner in which waiting units are arranged for service.
Free
(True/False)
4.8/5
(26)
Correct Answer:
True
In developing the total cost for a waiting line, waiting cost takes into consideration both the time spent waiting in line and the time spent being served.
Free
(True/False)
4.8/5
(29)
Correct Answer:
True
Discuss the importance of the utilization factor in a queuing system and the assumptions made about its value.
(Essay)
4.9/5
(31)
Before waiting lines can be analyzed economically, the arrivals' cost of waiting must be estimated.
(True/False)
4.8/5
(36)
In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can be received every hour. What are and ?
(Multiple Choice)
4.7/5
(38)
Give examples of systems you have seen in which a) blocked arrivals are cleared, and b) there is a finite calling population.
(Essay)
4.9/5
(25)
What queue discipline is assumed by the waiting line models presented in the textbook?
(Multiple Choice)
4.9/5
(40)
Use of the Poisson probability distribution assumes that arrivals are not random.
(True/False)
4.8/5
(31)
The manner in which units receive their service, such as FCFS, is the
(Multiple Choice)
4.8/5
(43)
Queue discipline refers to the assumption that a customer has the patience to remain in a slow moving queue.
(True/False)
4.7/5
(27)
When a waiting system is in steady-state operation, the number of units in the system is not changing.
(True/False)
4.9/5
(29)
The assumption of exponentially distributed service times indicates that
(Multiple Choice)
4.7/5
(29)
In a multiple channel system it is more efficient to have a separate waiting line for each channel.
(True/False)
4.8/5
(37)
For an M/G/1 system with = 20 and = 35, with = .005, find
a.the probability the system is idle.
b.the average length of the queue.
c.the average number in the system.
(Essay)
4.9/5
(24)
If arrivals occur according to the Poisson distribution every 20 minutes, then which is NOT true?
(Multiple Choice)
4.8/5
(24)
In waiting line systems where the length of the waiting line is limited, the mean number of units entering the system might be less than the arrival rate.
(True/False)
4.8/5
(30)
Showing 1 - 20 of 48
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)