Date post: | 26-Dec-2015 |
Category: |
Documents |
Upload: | shawn-norris |
View: | 213 times |
Download: | 0 times |
© 2006 Prentice Hall, Inc. D – 1
Operations ManagementOperations ManagementModule D – Waiting-Line ModelsModule D – Waiting-Line Models
© 2006 Prentice Hall, Inc.
PowerPoint presentation to accompanyPowerPoint presentation to accompany Heizer/Render Heizer/Render Principles of Operations Management, 6ePrinciples of Operations Management, 6eOperations Management, 8e Operations Management, 8e
© 2006 Prentice Hall, Inc. D – 2
OutlineOutline
Characteristics Of A Waiting-Line Characteristics Of A Waiting-Line SystemSystem Arrival CharacteristicsArrival Characteristics
Waiting-Line CharacteristicsWaiting-Line Characteristics
Service Facility CharacteristicsService Facility Characteristics
Measuring the Queue’s PerformanceMeasuring the Queue’s Performance
Queuing CostsQueuing Costs
© 2006 Prentice Hall, Inc. D – 3
Outline – ContinuedOutline – Continued
The Variety Of Queuing ModelsThe Variety Of Queuing Models Model A(M/M/1): Single-Channel Model A(M/M/1): Single-Channel
Queuing Model With Poisson Arrivals Queuing Model With Poisson Arrivals and Exponential Service Timesand Exponential Service Times
Model B(M/M/S): Multiple-Channel Model B(M/M/S): Multiple-Channel Queuing ModelQueuing Model
Model C(M/D/1): Constant Service Time Model C(M/D/1): Constant Service Time ModelModel
Model D: Limited Population ModelModel D: Limited Population Model
Other Queuing ApproachesOther Queuing Approaches
© 2006 Prentice Hall, Inc. D – 4
Learning ObjectivesLearning Objectives
When you complete this module, you When you complete this module, you should be able to:should be able to:
Identify or Define:Identify or Define:
The assumptions of the four basic The assumptions of the four basic waiting-line modelswaiting-line models
How to apply waiting-line modelsHow to apply waiting-line models
How to conduct an economic How to conduct an economic analysis of queuesanalysis of queues
Describe or Explain:Describe or Explain:
© 2006 Prentice Hall, Inc. D – 5
Common Queuing Common Queuing SituationsSituations
SituationSituation Arrivals in QueueArrivals in Queue Service ProcessService Process
SupermarketSupermarket Grocery shoppersGrocery shoppers Checkout clerks at cash Checkout clerks at cash registerregister
Highway toll boothHighway toll booth AutomobilesAutomobiles Collection of tolls at boothCollection of tolls at booth
Doctor’s officeDoctor’s office PatientsPatients Treatment by doctors and Treatment by doctors and nursesnurses
Computer systemComputer system Programs to be runPrograms to be run Computer processes jobsComputer processes jobs
Telephone companyTelephone company CallersCallers Switching equipment to Switching equipment to forward callsforward calls
BankBank CustomerCustomer Transactions handled by tellerTransactions handled by teller
Machine Machine maintenancemaintenance
Broken machinesBroken machines Repair people fix machinesRepair people fix machines
HarborHarbor Ships and bargesShips and barges Dock workers load and unloadDock workers load and unload
Table D.1Table D.1
© 2006 Prentice Hall, Inc. D – 6
Characteristics of Waiting-Characteristics of Waiting-Line SystemsLine Systems
1.1. Arrivals or inputs to the systemArrivals or inputs to the system Population size, behavior, statistical Population size, behavior, statistical
distributiondistribution
2.2. Queue discipline, or the waiting line Queue discipline, or the waiting line itselfitself Limited or unlimited in length, discipline Limited or unlimited in length, discipline
of people or items in itof people or items in it
3.3. The service facilityThe service facility Design, statistical distribution of service Design, statistical distribution of service
timestimes
© 2006 Prentice Hall, Inc. D – 7
Arrival CharacteristicsArrival Characteristics
1.1. Size of the populationSize of the population Unlimited (infinite) or limited (finite)Unlimited (infinite) or limited (finite)
2.2. Behavior of arrivalsBehavior of arrivals Scheduled or random, often a Poisson Scheduled or random, often a Poisson
distributiondistribution
3.3. Behavior of arrivalsBehavior of arrivals Wait in the queue and do not switch Wait in the queue and do not switch
lineslines
Balking or renegingBalking or reneging
© 2006 Prentice Hall, Inc. D – 8
Parts of a Waiting LineParts of a Waiting Line
Figure D.1Figure D.1
Dave’s Dave’s Car WashCar Wash
enterenter exitexit
Population ofPopulation ofdirty carsdirty cars
ArrivalsArrivalsfrom thefrom thegeneralgeneral
population …population …
QueueQueue(waiting line)(waiting line)
ServiceServicefacilityfacility
Exit the systemExit the system
Arrivals to the systemArrivals to the system Exit the systemExit the systemIn the systemIn the system
Arrival CharacteristicsArrival Characteristics Size of the populationSize of the population Behavior of arrivalsBehavior of arrivals Statistical distribution Statistical distribution
of arrivalsof arrivals
Waiting Line Waiting Line CharacteristicsCharacteristics
Limited vs. Limited vs. unlimitedunlimited
Queue disciplineQueue discipline
Service CharacteristicsService Characteristics Service designService design Statistical distribution Statistical distribution
of serviceof service
© 2006 Prentice Hall, Inc. D – 9
Poisson DistributionPoisson Distribution
PP((xx)) = for x = for x = 0, 1, 2, 3, 4, …= 0, 1, 2, 3, 4, …ee--xx
xx!!
wherewhere P(x)P(x) == probability of x arrivalsprobability of x arrivals
xx == number of arrivals per number of arrivals per unit of timeunit of time
== average arrival rateaverage arrival rate
ee == 2.71832.7183 ((which is the which is the base of the natural logarithmsbase of the natural logarithms))
© 2006 Prentice Hall, Inc. D – 10
Poisson DistributionPoisson DistributionProbability = PProbability = P((xx)) = =
ee--xx
x!x!
0.25 0.25 –
0.02 0.02 –
0.15 0.15 –
0.10 0.10 –
0.05 0.05 –
–
Pro
bab
ility
Pro
bab
ility
00 11 22 33 44 55 66 77 88 99
Distribution for Distribution for = 2 = 2
xx
0.25 0.25 –
0.02 0.02 –
0.15 0.15 –
0.10 0.10 –
0.05 0.05 –
–
Pro
bab
ility
Pro
bab
ility
00 11 22 33 44 55 66 77 88 99
Distribution for Distribution for = 4 = 4
xx1010 1111
Figure D.2Figure D.2
© 2006 Prentice Hall, Inc. D – 11
Waiting-Line CharacteristicsWaiting-Line Characteristics
Limited or unlimited queue lengthLimited or unlimited queue length
Queue discipline - first-in, first-out Queue discipline - first-in, first-out is most commonis most common
Other priority rules may be used in Other priority rules may be used in special circumstancesspecial circumstances
© 2006 Prentice Hall, Inc. D – 12
Service CharacteristicsService Characteristics
Queuing system designsQueuing system designs Single-channel system, multiple-Single-channel system, multiple-
channel systemchannel system
Single-phase system, multiphase Single-phase system, multiphase systemsystem
Service time distributionService time distribution Constant service timeConstant service time
Random service times, usually a Random service times, usually a negative exponential distributionnegative exponential distribution
© 2006 Prentice Hall, Inc. D – 13
Queuing System DesignsQueuing System Designs
Figure D.3Figure D.3
DeparturesDeparturesafter serviceafter service
Single-channel, single-phase systemSingle-channel, single-phase system
Queue
ArrivalsArrivals
Single-channel, multiphase systemSingle-channel, multiphase system
ArrivalsArrivalsDeparturesDeparturesafter serviceafter service
Phase 1 service facility
Phase 2 service facility
Service facility
Queue
Your family dentist’s officeYour family dentist’s office
McDonald’s dual window drive-throughMcDonald’s dual window drive-through
© 2006 Prentice Hall, Inc. D – 14
Queuing System DesignsQueuing System Designs
Figure D.3Figure D.3Multi-channel, single-phase systemMulti-channel, single-phase system
ArrivalsArrivals
Queue
Most bank and post office service windowsMost bank and post office service windows
DeparturesDeparturesafter serviceafter service
Service facility
Channel 1
Service facility
Channel 2
Service facility
Channel 3
© 2006 Prentice Hall, Inc. D – 15
Queuing System DesignsQueuing System Designs
Figure D.3Figure D.3Multi-channel, multiphase systemMulti-channel, multiphase system
ArrivalsArrivals
Queue
Some college registrationsSome college registrations
DeparturesDeparturesafter serviceafter service
Phase 2 service facility
Channel 1
Phase 2 service facility
Channel 2
Phase 1 service facility
Channel 1
Phase 1 service facility
Channel 2
© 2006 Prentice Hall, Inc. D – 16
Negative Exponential Negative Exponential DistributionDistribution
Figure D.4Figure D.4
1.0 1.0 –
0.9 0.9 –
0.8 0.8 –
0.7 0.7 –
0.6 0.6 –
0.5 0.5 –
0.4 0.4 –
0.3 0.3 –
0.2 0.2 –
0.1 0.1 –
0.0 0.0 –
Pro
bab
ility
th
at s
ervi
ce t
ime
Pro
bab
ility
th
at s
ervi
ce t
ime
≥ 1
≥ 1
| | | | | | | | | | | | |
0.000.00 0.250.25 0.500.50 0.750.75 1.001.00 1.251.25 1.501.50 1.751.75 2.002.00 2.252.25 2.502.50 2.752.75 3.003.00
Time t in hoursTime t in hours
Probability that service time is greater than t = eProbability that service time is greater than t = e-µ-µtt for t for t ≥ 1≥ 1
µ =µ = Average service rate Average service ratee e = 2.7183= 2.7183
Average service rate Average service rate (µ) = (µ) = 1 customer per hour1 customer per hour
Average service rate Average service rate (µ) = 3(µ) = 3 customers per hour customers per hour Average service time Average service time = 20= 20 minutes per customer minutes per customer
© 2006 Prentice Hall, Inc. D – 17
Measuring Queue Measuring Queue PerformancePerformance
1.1. Average time that each customer or object Average time that each customer or object spends in the queuespends in the queue
2.2. Average queue lengthAverage queue length
3.3. Average time in the systemAverage time in the system
4.4. Average number of customers in the systemAverage number of customers in the system
5.5. Probability the service facility will be idleProbability the service facility will be idle
6.6. Utilization factor for the systemUtilization factor for the system
7.7. Probability of a specified number of customers Probability of a specified number of customers in the systemin the system
© 2006 Prentice Hall, Inc. D – 18
Queuing CostsQueuing Costs
Figure D.5Figure D.5
Total expected costTotal expected cost
Cost of providing serviceCost of providing service
CostCost
Low levelLow levelof serviceof service
High levelHigh levelof serviceof service
Cost of waiting timeCost of waiting time
MinimumMinimumTotalTotalcostcost
OptimalOptimalservice levelservice level
© 2006 Prentice Hall, Inc. D – 19
Queuing ModelsQueuing Models
Table D.2Table D.2
ModelModel NameName ExampleExample
AA Single channel Single channel Information counter Information counter system system at department store at department store(M/M/1)(M/M/1)
NumberNumber NumberNumber ArrivalArrival ServiceServiceofof ofof RateRate TimeTime PopulationPopulation QueueQueue
ChannelsChannels PhasesPhases PatternPattern PatternPattern SizeSize DisciplineDiscipline
SingleSingle SingleSingle PoissonPoisson ExponentialExponential UnlimitedUnlimited FIFOFIFO
© 2006 Prentice Hall, Inc. D – 20
Queuing ModelsQueuing Models
Table D.2Table D.2
ModelModel NameName ExampleExample
BB Multichannel Multichannel Airline ticketAirline ticket (M/M/S)(M/M/S) counter counter
NumberNumber NumberNumber ArrivalArrival ServiceServiceofof ofof RateRate TimeTime PopulationPopulation QueueQueue
ChannelsChannels PhasesPhases PatternPattern PatternPattern SizeSize DisciplineDiscipline
Multi-Multi- SingleSingle PoissonPoisson ExponentialExponential UnlimitedUnlimited FIFOFIFO channelchannel
© 2006 Prentice Hall, Inc. D – 21
Queuing ModelsQueuing Models
Table D.2Table D.2
ModelModel NameName ExampleExample
CC Constant Constant Automated car Automated car service service wash wash(M/D/1)(M/D/1)
NumberNumber NumberNumber ArrivalArrival ServiceServiceofof ofof RateRate TimeTime PopulationPopulation QueueQueue
ChannelsChannels PhasesPhases PatternPattern PatternPattern SizeSize DisciplineDiscipline
SingleSingle SingleSingle PoissonPoisson ConstantConstant UnlimitedUnlimited FIFOFIFO
© 2006 Prentice Hall, Inc. D – 22
Queuing ModelsQueuing Models
Table D.2Table D.2
ModelModel NameName ExampleExample
DD Limited Limited Shop with only a Shop with only a population population dozen machines dozen machines
((finitefinite)) that might breakthat might break
NumberNumber NumberNumber ArrivalArrival ServiceServiceofof ofof RateRate TimeTime PopulationPopulation QueueQueue
ChannelsChannels PhasesPhases PatternPattern PatternPattern SizeSize DisciplineDiscipline
SingleSingle SingleSingle PoissonPoisson ExponentialExponential LimitedLimited FIFOFIFO
© 2006 Prentice Hall, Inc. D – 23
Model A - Single ChannelModel A - Single Channel
1.1. Arrivals are FIFO and every arrival Arrivals are FIFO and every arrival waits to be served regardless of the waits to be served regardless of the length of the queuelength of the queue
2.2. Arrivals are independent of preceding Arrivals are independent of preceding arrivals but the average number of arrivals but the average number of arrivals does not change over timearrivals does not change over time
3.3. Arrivals are described by a Poisson Arrivals are described by a Poisson probability distribution and come from probability distribution and come from an infinite populationan infinite population
© 2006 Prentice Hall, Inc. D – 24
Model A - Single ChannelModel A - Single Channel
4.4. Service times vary from one customer Service times vary from one customer to the next and are independent of one to the next and are independent of one another, but their average rate is another, but their average rate is knownknown
5.5. Service times occur according to the Service times occur according to the negative exponential distributionnegative exponential distribution
6.6. The service rate is faster than the The service rate is faster than the arrival ratearrival rate
© 2006 Prentice Hall, Inc. D – 25
Model A - Single ChannelModel A - Single Channel
== Mean number of arrivals per time periodMean number of arrivals per time period
µµ == Mean number of units served per time Mean number of units served per time periodperiod
LLss == Average number of units (customers) in Average number of units (customers) in the system (waiting and being served)the system (waiting and being served)
==
WWss== Average time a unit spends in the Average time a unit spends in the system (waiting time plus service time)system (waiting time plus service time)
==
µ – µ –
11µ – µ –
Table D.3Table D.3
© 2006 Prentice Hall, Inc. D – 26
Model A - Single ChannelModel A - Single Channel
LLqq== Average number of units waiting in the Average number of units waiting in the queuequeue
==
WWqq== Average Average time a unit spends waiting in time a unit spends waiting in the queuethe queue
==
pp == Utilization factor for the systemUtilization factor for the system
==
22
µ(µ – µ(µ – ))
µ(µ – µ(µ – ))
µµ
Table D.3Table D.3
© 2006 Prentice Hall, Inc. D – 27
Model A - Single ChannelModel A - Single Channel
PP00 == Probability of Probability of 00 units in the system units in the system (that is, the service unit is idle)(that is, the service unit is idle)
== 1 –1 –
PPn > kn > k ==Probability of more than k units in the Probability of more than k units in the system, where n is the number of units in system, where n is the number of units in the systemthe system
==
µµ
µµ
k k + 1+ 1
Table D.3Table D.3
© 2006 Prentice Hall, Inc. D – 28
Single Channel ExampleSingle Channel Example
== 2 2 cars arriving/hourcars arriving/hourµµ= 3 = 3 cars serviced/hourcars serviced/hour
LLss= = = 2= = = 2 cars in cars in
the system on averagethe system on average
WWss = = = = 1= = 1 hour hour
average waiting time in the average waiting time in the systemsystem
LLqq== = = 1.33 = = 1.33
cars waiting in linecars waiting in line
22
µ(µ – µ(µ – ))
µ – µ –
11µ – µ –
22
3 - 23 - 2
11
3 - 23 - 2
2222
3(3 - 2)3(3 - 2)
© 2006 Prentice Hall, Inc. D – 29
Single Channel ExampleSingle Channel Example
WWqq= = = =
= 40 = 40 minute average minute average waiting timewaiting time
pp= = /µ = 2/3 = 66.6% /µ = 2/3 = 66.6% of time mechanic is of time mechanic is busybusy
µ(µ – µ(µ – ))
223(3 - 2)3(3 - 2)
µµ
PP00= 1 - = .33= 1 - = .33 probability probability
there are there are 00 cars in the system cars in the system
== 2 2 cars arriving/hourcars arriving/hourµµ= 3 = 3 cars serviced/hourcars serviced/hour
© 2006 Prentice Hall, Inc. D – 30
Single Channel ExampleSingle Channel Example
Probability of More Than k Cars in the SystemProbability of More Than k Cars in the System
kk PPn > kn > k = (2/3)= (2/3)k k + 1+ 1
00 .667.667 Note that this is equal toNote that this is equal to 1 - 1 - PP00 = 1 - .33 = 1 - .33
11 .444.444
22 .296.296
33 .198.198 Implies that there is aImplies that there is a 19.8% 19.8% chance that more thanchance that more than 3 3 cars are in the cars are in the systemsystem
44 .132.132
55 .088.088
66 .058.058
77 .039.039
© 2006 Prentice Hall, Inc. D – 31
Single Channel EconomicsSingle Channel EconomicsCustomer dissatisfactionCustomer dissatisfaction
and lost goodwill and lost goodwill = $10= $10 per hour per hour
WWqq = 2/3= 2/3 hour hour
Total arrivalsTotal arrivals = 16= 16 per day per dayMechanic’s salaryMechanic’s salary = $56= $56 per day per day
Total hours Total hours customers spend customers spend waiting per daywaiting per day
= (16) = 10 = (16) = 10 hourshours2233
2233
Customer waiting-time cost Customer waiting-time cost = $10 10 = $106.67= $10 10 = $106.672233
Total expected costs Total expected costs = $106.67 + $56 = $162.67= $106.67 + $56 = $162.67
© 2006 Prentice Hall, Inc. D – 32
Multi-Channel ModelMulti-Channel Model
MM == number of channels opennumber of channels open == average arrival rateaverage arrival rateµµ == average service rate at each average service rate at each channelchannel
PP00 = for M = for Mµ > µ > 11
11MM!!
11nn!!
MMµµMMµ - µ -
M M – 1– 1
n n = 0= 0
µµ
nnµµ
MM
++∑∑
LLss = P = P00 + +µ(µ(/µ)/µ)MM
((M M - 1)!(- 1)!(MMµ - µ - ))22
µµ
Table D.4Table D.4
© 2006 Prentice Hall, Inc. D – 33
Multi-Channel ExampleMulti-Channel Example
= 2 µ = 3 = 2 µ = 3 M M = 2= 2
PP00 = = = = 11
1122!!
11nn!!
2(3)2(3)
2(3) - 22(3) - 2
11
n n = 0= 0
2233
nn
2233
22
++∑∑
11
22
LLss = + = = + =(2)(3(2/3)(2)(3(2/3)22 22
331! 2(3) - 21! 2(3) - 2 22
11
22
33
44
WWqq = = .0415= = .0415.083.083
22WWss = = = =
3/43/4
22
33
88LLqq = – = = – =22
3333
44
11
1212
© 2006 Prentice Hall, Inc. D – 34
Multi-Channel ExampleMulti-Channel Example
Single ChannelSingle Channel Two ChannelsTwo Channels
PP00 .33.33 .5.5
LLss 22 cars cars .75.75 cars cars
WWss 6060 minutes minutes 22.522.5 minutes minutes
LLqq 1.331.33 cars cars .083.083 cars cars
WWqq 40 40 minutesminutes 2.52.5 minutes minutes
© 2006 Prentice Hall, Inc. D – 35
Constant Service ModelConstant Service Model
Table D.5Table D.5
LLqq = = 22
2µ(µ – 2µ(µ – ))Average lengthAverage lengthof queueof queue
WWqq = = 2µ(µ – 2µ(µ – ))
Average waiting timeAverage waiting timein queuein queue
µµ
LLss = L = Lqq + + Average number ofAverage number ofcustomers in systemcustomers in system
WWss = W = Wqq + + 11µµ
Average waitingAverage waitingtime in systemtime in system
© 2006 Prentice Hall, Inc. D – 36
Net savingsNet savings = $ 7 /= $ 7 /triptrip
Constant Service ExampleConstant Service ExampleTrucks currently wait Trucks currently wait 1515 minutes on average minutes on averageTruck and driver cost Truck and driver cost $60$60 per hour per hourAutomated compactor service rate Automated compactor service rate (µ) (µ) = 12 trucks per hour= 12 trucks per hourArrival rate Arrival rate (()) = 8= 8 per hour per hourCompactor costs Compactor costs $3$3 per truck per truck
Current waiting cost per trip Current waiting cost per trip = (1/4= (1/4 hr hr)($60) = $15)($60) = $15 //triptrip
WWqq = = hour = = hour882(12)(12 - 8)2(12)(12 - 8)
111212
Waiting cost/tripWaiting cost/tripwith compactorwith compactor = (1/12= (1/12 hr wait hr wait)($60/)($60/hr costhr cost)) = $ 5 /= $ 5 /triptrip
Savings withSavings withnew equipmentnew equipment
= $15 (= $15 (currentcurrent) - $ 5 () - $ 5 (newnew)) = $10 = $10 //triptrip
Cost of new equipment amortizedCost of new equipment amortized = = $ 3 /$ 3 /triptrip
© 2006 Prentice Hall, Inc. D – 37
Limited Population ModelLimited Population Model
Service factor: X =Service factor: X =
Average number running: J = NFAverage number running: J = NF(1 -(1 - X X))
Average number waiting: L = NAverage number waiting: L = N(1 -(1 - F F))
Average number being serviced: H = FNXAverage number being serviced: H = FNX
Average waiting time: W =Average waiting time: W =
Number of population: N = J + L + HNumber of population: N = J + L + H
TTT + UT + U
TT(1 -(1 - F F))XFXF
© 2006 Prentice Hall, Inc. D – 38
Limited Population ModelLimited Population Model
Service factor: X =Service factor: X =
Average number running: J = NFAverage number running: J = NF(1 -(1 - X X))
Average number waiting: L = NAverage number waiting: L = N(1 -(1 - F F))
Average number being serviced: H = FNXAverage number being serviced: H = FNX
Average waiting time: W =Average waiting time: W =
Number of population: N = J + L + HNumber of population: N = J + L + H
TTT + UT + U
TT(1 -(1 - F F))XFXF
D = Probability that a unit will have to wait in queue
N = Number of potential customers
F = Efficiency factor T = Average service time
H = Average number of units being served
U = Average time between unit service requirements
J = Average number of units not in queue or in service bay
W = Average time a unit waits in line
L = Average number of units waiting for service
X = Service factor
M = Number of service channels
© 2006 Prentice Hall, Inc. D – 39
Finite Queuing TableFinite Queuing Table
Table D.7Table D.7
XX MM DD FF
.012.012 11 .048.048 .999.999
.025.025 11 .100.100 .997.997
.050.050 11 .198.198 .989.989
.060.060 22 .020.020 .999.999
11 .237.237 .983.983
.070.070 22 .027.027 .999.999
11 .275.275 .977.977
.080.080 22 .035.035 .998.998
11 .313.313 .969.969
.090.090 22 .044.044 .998.998
11 .350.350 .960.960
.100.100 22 .054.054 .997.997
11 .386.386 .950.950
© 2006 Prentice Hall, Inc. D – 40
Limited Population ExampleLimited Population Example
Service factor: X = Service factor: X = = .091 (= .091 (close to close to .090).090)
For M For M = 1,= 1, D D = .350= .350 and F and F = .960= .960
For M For M = 2,= 2, D D = .044= .044 and F and F = .998= .998
Average number of printers working:Average number of printers working:
For M For M = 1,= 1, J J = (5)(.960)(1 - .091) = 4.36= (5)(.960)(1 - .091) = 4.36
For M For M = 2,= 2, J J = (5)(.998)(1 - .091) = 4.54= (5)(.998)(1 - .091) = 4.54
222 + 202 + 20
Each of Each of 55 printers requires repair after printers requires repair after 2020 hours hours ((UU)) of use of useOne technician can service a printer in One technician can service a printer in 22 hours hours ((TT))Printer downtime costs Printer downtime costs $120/$120/hourhourTechnician costs Technician costs $25/$25/hourhour
© 2006 Prentice Hall, Inc. D – 41
Limited Population ExampleLimited Population Example
Service factor: X = Service factor: X = = .091 (= .091 (close to close to .090).090)
For M For M = 1,= 1, D D = .350= .350 and F and F = .960= .960
For M For M = 2,= 2, D D = .044= .044 and F and F = .998= .998
Average number of printers working:Average number of printers working:
For M For M = 1,= 1, J J = (5)(.960)(1 - .091) = 4.36= (5)(.960)(1 - .091) = 4.36
For M For M = 2,= 2, J J = (5)(.998)(1 - .091) = 4.54= (5)(.998)(1 - .091) = 4.54
222 + 202 + 20
Each of Each of 55 printers require repair after printers require repair after 2020 hours hours ((UU)) of use of useOne technician can service a printer in One technician can service a printer in 22 hours hours ((TT))Printer downtime costs Printer downtime costs $120/$120/hourhourTechnician costs Technician costs $25/$25/hourhour
Number of Technicians
Average Number Printers
Down (N - J)
Average Cost/Hr for Downtime(N - J)$120
Cost/Hr for Technicians
($25/hr)Total
Cost/Hr
1 .64 $76.80 $25.00 $101.80
2 .46 $55.20 $50.00 $105.20