Ch 13 Flashcards

(18 cards)

1
Q

Whose notation for queues is a popular classification system for identifying features of a queue

A

Kendall’s Notation for Queues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Which notation for queues involves shorthand notation where A/B/C/D/E describe the queue and are applicable to a large number of queuing scenarios

A

Kendall’s Notation for Queues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What does A stand for in Kendall’s notation for queues

A

Inter-arrrival time distribution (poisson)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What does B stand for in Kendall’s notation for queues

A

Service time distribution (exponential)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What does C stand for in Kendall’s notation for queues

A

Number of parallel servers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What does D stand for in Kendall’s notation for queues

A

Maximum numbers of jobs that can be in the system (waiting and in service) - default is infinite for infinite number of waiting positions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does E stand for in Kendall’s notation for queues

A

Queuing disciplines (FCS,LCFS,PR, etc)- default is FCFS/FIFO

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

For A and B of Kendall’s Notation for Queues , distributions may be notated as>

A

“M”: poisson/expnential
D: deterministic
E_k: Erlangian (order k)
G: General

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Which term is defined as a body of knowledge about waiting lines and is valuable tool for service ops managers as they must recognize the
tradeoff between cost of providing good service and cost of customer waiting time

A

Queuing Theory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What are the key points of the queuing thoery

A
  • Want short queues so customers do not leave
    -Willing to allow some waiting if it is balanced by a significant
    savings in capacity costs
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Which basic queuing system configuration is the most simple queue configuration that uses the poisson distribution for arrivals, exponential distribution for service time with 1 single server

A

M/M/1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Which basic queuing system configuration channel refers to the number of servers. The phase refers to the number of stops or stations that must be made by the customer to complete the service. An example of this queue is a drive thru bank with only one lane

A

Single channel, single phase

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Which basic queuing system configuration can be described below:
A restaurant where you place your order at step 1 and you pay for your order at step 2 is an example for what?

A

Single channel, multi phase

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Which basic queuing system configuration can be described below:
a single line at a store with multiple cashiers,
i.e. Dick’s Sporting Goods or Wendy’s

A

Multi Channel, single phase

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Which basic queuing system configuration can be described below:
Example: a laundromat where you have a choice between two washing
machines to first wash your clothes and a choice between 2 dryers to dry
your clothes after they’ve completed the wash step

A

Multi channel, multi phase

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What law was created and proved by John Little and states “the average number of customers in a system
(L) is equal to the arrival rate (λ) times the average waiting time (W)”

A

Little’s Law

17
Q

Why is Little’s Law important for ALL businesses?

A

-It is applied to calculate the capacity of systems
* In a manufacturing setting we view the variables a little differently
− L = work in progress (WIP) instead of customer volume
− λ = Throughput (departure rate or production output) instead of customer’s
arrival rate
− W = Lead time (the time an item spends in a system) instead of people spend
waiting at a business
− So L=λW becomes…
WIP = Throughput x Lead Time