Question 1

In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can be received every hour. What are $\lambda$ and $\mu$?

Accepted Answer

A)  $\lambda$ = 10, $\mu$= 10 
B)  $\lambda$ = 6, $\mu$= 6 
C)  $\lambda$ = 6, $\mu$ = 10 
D)  $\lambda$ = 10, $\mu$ = 6 
A)  $\lambda$ = 10, $\mu$= 10 
B)  $\lambda$ = 6, $\mu$= 6 
C)  $\lambda$ = 6, $\mu$ = 10 
D)  $\lambda$ = 10, $\mu$ = 6 C

Question 2

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.

Accepted Answer

A) True 
 B)False  True

Question 3

For all waiting lines, P0 + Pw = 1.

Accepted Answer

A) True 
 B)False  False

Question 4

Circle Electric Supply is considering opening a second service counter to better serve the electrical contractor customers. The arrival rate is 10 per hour. The service rate is 14 per hour. If the cost of waiting is $30 and the cost of each service counter is $22 per hour, then should the second counter be opened?

Accepted Answer

With one window the cost per h

Question 5

The assumption of exponentially distributed service times indicates that

Accepted Answer

A)  37% of the service times are less than the mean service time. 
B)  50% of the service times are less than the mean service time. 
C)  63% of the service times are less than the mean service time. 
D)  service time increase at an exponential rate as the waiting line grows. 
A)  37% of the service times are less than the mean service time. 
B)  50% of the service times are less than the mean service time. 
C)  63% of the service times are less than the mean service time. 
D)  service time increase at an exponential rate as the waiting line grows.

Question 6

In waiting line applications, the exponential probability distribution indicates that approximately 63 percent of the service times are less than the mean service time.

Accepted Answer

A) True 
 B)False

Question 7

Which of the following can NOT be found by the queuing formulas presented in the textbook?

Accepted Answer

A)  the probability that no units are in the system. 
B)  the average number of units in the system. 
C)  the maximum time a unit spends in the system. 
D)  the average time a unit spends in the system. 
A)  the probability that no units are in the system. 
B)  the average number of units in the system. 
C)  the maximum time a unit spends in the system. 
D)  the average time a unit spends in the system.

Question 8

If some maximum number of customers is allowed in a queuing system at one time, the system has a finite calling population.

Accepted Answer

A) True 
 B)False

Question 9

Little's flow equations

Accepted Answer

A)  require Poisson and exponential assumptions. 
B)  are applicable to any waiting line model. 
C)  require independent calculation of W, L, Wq, and Lq. 
D)  All of the alternatives are correct. 
A)  require Poisson and exponential assumptions. 
B)  are applicable to any waiting line model. 
C)  require independent calculation of W, L, Wq, and Lq. 
D)  All of the alternatives are correct.

Question 10

In a multiple channel system it is more efficient to have a separate waiting line for each channel.

Accepted Answer

A) True 
 B)False

Question 11

Decision makers in queuing situations attempt to balance

Accepted Answer

A)  operating characteristics against the arrival rate. 
B)  service levels against service cost. 
C)  the number of units in the system against the time in the system. 
D)  the service rate against the arrival rate. 
A)  operating characteristics against the arrival rate. 
B)  service levels against service cost. 
C)  the number of units in the system against the time in the system. 
D)  the service rate against the arrival rate.

Question 12

Waiting line models describe the transient-period operating characteristics of a waiting line.

Accepted Answer

A) True 
 B)False

Question 13

In a multiple channel system

Accepted Answer

A)  each server has its own queue. 
B)  each server has the same service rate. 
C) $\mu$>$\lambda$ 
D)  All of the alternatives are correct. 
A)  each server has its own queue. 
B)  each server has the same service rate. 
C) $\mu$>$\lambda$ 
D)  All of the alternatives are correct.

Question 14

When blocked customers are cleared, an important decision is how many channels to provide.

Accepted Answer

A) True 
 B)False

Question 15

The total cost for a waiting line does NOT specifically depend on

Accepted Answer

A)  the cost of waiting. 
B)  the cost of service. 
C)  the number of units in the system. 
D)  the cost of a lost customer. 
A)  the cost of waiting. 
B)  the cost of service. 
C)  the number of units in the system. 
D)  the cost of a lost customer.

Question 16

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.

Accepted Answer

A) True 
 B)False

Question 17

If service time follows an exponential probability distribution, approximately 63% of the service times are less than the mean service time.

Accepted Answer

A) True 
 B)False

Question 18

Operating characteristics formulas for the single-channel queue do NOT require

Accepted Answer

A)  $\lambda$ $\ge$ $\mu$. 
B)  Poisson distribution of arrivals. 
C)  an exponential distribution of service times. 
D)  an FCFS queue discipline. 
A)  $\lambda$ $\ge$ $\mu$. 
B)  Poisson distribution of arrivals. 
C)  an exponential distribution of service times. 
D)  an FCFS queue discipline.

Question 19

A multiple-channel system has more than one waiting line.

Accepted Answer

A) True 
 B)False

Question 20

Arrivals at a box office in the hour before the show follow the Poisson distribution with $\lambda$ = 7 per minute. Service times are constant at 7.5 seconds. Find the average length of the waiting line.

Accepted Answer

L<sub>q</s

In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can be received every hour. What are $\lambda$ and $\mu$ ?

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.

For all waiting lines, P₀ + P_w = 1.

The assumption of exponentially distributed service times indicates that

In waiting line applications, the exponential probability distribution indicates that approximately 63 percent of the service times are less than the mean service time.

Which of the following can NOT be found by the queuing formulas presented in the textbook?

If some maximum number of customers is allowed in a queuing system at one time, the system has a finite calling population.

Little's flow equations

In a multiple channel system it is more efficient to have a separate waiting line for each channel.

Decision makers in queuing situations attempt to balance

Waiting line models describe the transient-period operating characteristics of a waiting line.

In a multiple channel system

When blocked customers are cleared, an important decision is how many channels to provide.

The total cost for a waiting line does NOT specifically depend on

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.

If service time follows an exponential probability distribution, approximately 63% of the service times are less than the mean service time.

Operating characteristics formulas for the single-channel queue do NOT require

A multiple-channel system has more than one waiting line.

Arrivals at a box office in the hour before the show follow the Poisson distribution with $\lambda$ = 7 per minute. Service times are constant at 7.5 seconds. Find the average length of the waiting line.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters

Exam 11: Waiting Line Models

In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can be received every hour. What are λ\lambdaλ and μ\muμ ?

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.

For all waiting lines, P0 + Pw = 1.

The assumption of exponentially distributed service times indicates that

In waiting line applications, the exponential probability distribution indicates that approximately 63 percent of the service times are less than the mean service time.

Which of the following can NOT be found by the queuing formulas presented in the textbook?

If some maximum number of customers is allowed in a queuing system at one time, the system has a finite calling population.

Little's flow equations

In a multiple channel system it is more efficient to have a separate waiting line for each channel.

Decision makers in queuing situations attempt to balance

Waiting line models describe the transient-period operating characteristics of a waiting line.

In a multiple channel system

When blocked customers are cleared, an important decision is how many channels to provide.

The total cost for a waiting line does NOT specifically depend on

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.

If service time follows an exponential probability distribution, approximately 63% of the service times are less than the mean service time.

Operating characteristics formulas for the single-channel queue do NOT require

A multiple-channel system has more than one waiting line.

Arrivals at a box office in the hour before the show follow the Poisson distribution with λ\lambdaλ = 7 per minute. Service times are constant at 7.5 seconds. Find the average length of the waiting line.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters

In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can be received every hour. What are $\lambda$ and $\mu$ ?

For all waiting lines, P₀ + P_w = 1.

Arrivals at a box office in the hour before the show follow the Poisson distribution with $\lambda$ = 7 per minute. Service times are constant at 7.5 seconds. Find the average length of the waiting line.