OMIS 2010: Queue / Service Design (Week 10)

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/55

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 10:48 PM on 4/19/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

56 Terms

1
New cards

What is a queue?

process flow with input &/ service variability

2
New cards

What explains why a queue has a buffer?

variability

3
New cards

What are the queue model uses?

  • describe variable system’s unit behaviour

  • determine service level

  • evaluate alternate service

4
New cards

What are the queue parts?

  • arrival

  • wait

  • service

  • system notation

  • performance measure

5
New cards

What are the arrival aspects?

  • population

  • behaviour

  • distribution

6
New cards

What are the wait aspects?

  • max size

  • discipline

  • line number

7
New cards

What are the service aspects?

  • server number

  • distribution

8
New cards

What are the queue performance measures?

  • time

    • queue

    • system

  • count / length

  • other

    • utilization

    • wait probability

9
New cards

What are the arrival’s population attributes?

  • infinite

>

  • finite

10
New cards

What are the arrival’s distribution attributes?

  • scheduled

  • random

11
New cards

What is the arrival’s random distribution?

exponential

  • density

  • mean // standard deviation

  • variance

12
New cards

What is the arrival’s random distribution density formula?

f(t)=λeλtf\left(t\right)=\lambda e^{-\lambda t}

13
New cards

What is the λ arrival’s random distribution notation?

arrival rate

14
New cards

What is the arrival’s random distribution mean // standard deviation formula?

1λ\frac{1}{\lambda}

15
New cards

What is the arrival’s random distribution variance formula?

1λ2\frac{1}{\lambda^2}

16
New cards

What is the memoryless property?

next arrival does NOT depend on last arrival → poisson distribution

17
New cards

What is the Nt arrival’s random distribution notation?

arrival number before t

18
New cards

What is the occurrence number = n probability formula?

P(Nt=n)=((λt)neλt)n!P\left(N_{t}=n\right)=\frac{\left(\left(\lambda t\right)^{n}e^{-\lambda t}\right)}{n!}

19
New cards

What is the first occurrence wait time formula?

P(Nt=0)=eλtP\left(N_{t}=0\right)=e^{-\lambda t}

20
New cards

What are the arrival’s behaviour attributes?

  • balk

  • renege

  • jockey

  • patient

21
New cards

What is balking?

customers arrive & leave after inspecting queue

  • observable queue

  • NOT enter wait area

  • if NO buffer, balk

22
New cards

What is reneging?

customers join & leave queue

  • NOT needed observable queue

  • impatient

23
New cards

What is jockeying?

customers join queue & switch lines

24
New cards

What is the wait’s max size attribute?

NO buffer limit BUT physical limit

25
New cards

What are the wait’s discipline attributes?

  • FIFO // FCFS

  • LIFO

  • random

  • priority

26
New cards

What are the wait’s line number attributes?

  • 1 line

>

  • 1/server

27
New cards

What are the service’s server number attributes?

  • more servers → more timely service / happier customer BUT cost

  • cross-train server

28
New cards

What are the service’s time distribution attributes?

  • deterministic

  • random

29
New cards

What is the service’s time distribution?

exponential

  • density

  • mean

  • variance

30
New cards

What is the service’s time distribution density formula?

g(t)=μeμtg\left(t\right)=\mu e^{-\mu t}

31
New cards

What is the service’s time distribution mean // standard deviation formula?

1μ\frac{1}{\mu}

32
New cards

What is the service’s time distribution variance formula?

1μ2\frac{1}{\mu^2}

33
New cards

What is the queue notation?

Kendall

  • A

  • S

  • c // s

  • K

  • N

  • D

34
New cards

What is the A Kendall notation?

arrival time distribution

35
New cards

What is the S Kendall notation?

service time distribution

36
New cards

What is the c Kendall notation?

server number

37
New cards

What are the A parameters?

  • M

    • memoryless IF exponential

  • G

    • general

  • D

    • deterministic

38
New cards

What are the S parameters?

  • M

    • memoryless

  • G

    • general

  • D

    • deterministic

39
New cards

What are the c // s parameters?

  • 1

  • s

40
New cards

What are some Kendall notation examples?

  • M/M/1

  • M/M/s

  • M/G/1

  • M/D/1

41
New cards

What does M/M/1 mean?

  • poisson arrival

  • poisson service

  • 1 server

42
New cards

What does M/M/s mean?

  • poisson arrival

  • poisson service

  • 1/server

43
New cards

What does M/G/1 mean?

general service

44
New cards

What does M/D/1 mean?

constant service

45
New cards

What are the predictable variation performance measures?

  • average

  • utilization

46
New cards

What are the unpredictable variation performance measures?

  • average

    • wait / service time & size

  • probability

    • idle

    • system number

  • utilization

47
New cards

What are the Little’s Flow equations?

average system / queue time & average system / queue units relation

L=λWL=\lambda\cdot W

Lq=λWqL_{q}=\lambda\cdot W_{q}

W=Lλ=Wq+1μW=\frac{L}{\lambda}=W_{q}+\frac{1}{\mu}

Wq=LqλW_{q}=\frac{L_{q}}{\lambda}

48
New cards

What increases throughput if the arrival rate is variable?

  • increase staff

  • decrease service time

  • buffer

49
New cards

What are the operation change characteristics?

  • arrival rate

    • smooth demand by price promotion

  • server number / type

    • dedicate server to task

  • server efficiency

    • add resource / tech

  • line number

    • dedicate server to transaction

  • phase number

  • priority

50
New cards

What are the M/M/1 characteristics?

  • homogeneous / infinite / patient population & 1 queue

  • FIFO

  • 1 server

  • exponential arrival & service time distribution

51
New cards

What if Wq is long?

  • hire cashier assistant → increase service rate

  • hire cashier → decrease service rate

52
New cards

What is the Lq M/M/1 shortcut formula?

Lq=ρLLq=\rho L

53
New cards

What is the Wq M/M/1 shortcut formula?

Wq=pWW_{q}=pW

54
New cards

What is the Pn M/M/1 shortcut formula?

Pn=(1ρ)ρnP_{n}=\left(1-\rho\right)\rho^{n}

55
New cards

What are the M/M/s characteristics?

  • homogeneous / infinite / patient population & 1 queue

  • FIFO

  • multiple servers

  • exponential arrival & service time distribution

56
New cards

What is the M/G/1 use?

NOT all service time → exponential distribution