Consider a workstation that has one maintenance mechanic to repair failed machines. We can think of the mechanic as the processor (scarce resource) and the machines awaiting repair as the jobs. Let us assume that six machines are down, with estimated repair times given here, and that no new machines fail. 1 2 3 4 5 6 Job (fix machine #) Processing time (hours) Compute the flow time for each job using both the FCFS rule and the SPT rule, and compare the average flow times. Round your answers for average values to the nearest whole number. Job 1 2 3 4 5 6 Sequence -Select- V -Select- V -Select- V 9 -Select- V -Select- V -Select- V FCFS Rule Average flow time (FCFS rule): 3 Flow Time (hours) 7 SPT rule Flow Time (hours) Average flow time (SPT rule): The -Select- 1 10 hours hours 4 v minimizes flow time and gets the most work done in the least amount of time.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter12: Queueing Models
Section12.5: Analytic Steady-state Queueing Models
Problem 26P
icon
Related questions
Question
Consider a workstation that has one maintenance mechanic to repair failed machines. We can think of the mechanic as the processor (scarce resource) and the machines awaiting repair as the jobs. Let us assume that
six machines are down, with estimated repair times given here, and that no new machines fail.
2 3 4
Job (fix
machine #)
Processing time
(hours)
Compute the flow time for each job using both the FCFS rule and the SPT rule, and compare the average flow times. Round your answers for average values to the nearest whole number.
1
NO †
4
5
6
Sequence
-Seled-
Average flow time (FCFS rule):
-Select- Y
-Select-
-Select- V
FCFS Rule
-Select- Y
7 1
Flow Time (hours)
SPT rule
Flow Time (hours)
hours
Average flow time (SPT rule):
hours
-Select- ✔ minimizes flow time and gets the most work done in the least amount of time.
Transcribed Image Text:Consider a workstation that has one maintenance mechanic to repair failed machines. We can think of the mechanic as the processor (scarce resource) and the machines awaiting repair as the jobs. Let us assume that six machines are down, with estimated repair times given here, and that no new machines fail. 2 3 4 Job (fix machine #) Processing time (hours) Compute the flow time for each job using both the FCFS rule and the SPT rule, and compare the average flow times. Round your answers for average values to the nearest whole number. 1 NO † 4 5 6 Sequence -Seled- Average flow time (FCFS rule): -Select- Y -Select- -Select- V FCFS Rule -Select- Y 7 1 Flow Time (hours) SPT rule Flow Time (hours) hours Average flow time (SPT rule): hours -Select- ✔ minimizes flow time and gets the most work done in the least amount of time.
Expert Solution
steps

Step by step

Solved in 3 steps with 4 images

Blurred answer
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,