A manager wants to assign tasks to workstations to achieve an hourly output rate of 33 units. Assume that the shop works 60 minutes per hour (i.e., no breaks). 1.39 a Workstations 1 2 3 4 .65 b Efficiency Task a a. Assign the tasks shown in the above precedence network (times are on the nodes and are in minutes) to workstations using the following heuristic rules: (i) "Assign the task with the most followers." (ii) Tiebreaker: "Assign the task with the longest time." (Round the intermediate calculations and final answers to 2 decimal places.) b, e c, d, g ✔ f, h 120.0 3 3 3 3 .87 % C .44 d .97 Idle Time 15 25 10 0.3 1.2 1.47 f x .45 9 b. What is the efficiency? (Round the intermediate calculations to 2 decimal places. Round the final answer to 1 decimal place.) .24 h

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter4: Linear Programming Models
Section: Chapter Questions
Problem 111P
icon
Related questions
Question

Oeration management

A manager wants to assign tasks to workstations to achieve an hourly output rate of 33 units. Assume that the shop works 60 minutes
per hour (i.e., no breaks).
1.39
Workstations
1
2
3
4
.65
Efficiency
Task
a. Assign the tasks shown in the above precedence network (times are on the nodes and are in minutes) to workstations using the
following heuristic rules: (i) "Assign the task with the most followers." (ii) Tiebreaker: “Assign the task with the longest time." (Round the
intermediate calculations and final answers to 2 decimal places.)
a
b, e
c, d, g
f, h
120.0
.87
3 3 3 3
*%
.44
.97
Idle Time
15
25
10
0.3
1.47
f
x
45
1.2 x
9
b. What is the efficiency? (Round the intermediate calculations to 2 decimal places. Round the final answer to 1 decimal place.)
.24
h
Transcribed Image Text:A manager wants to assign tasks to workstations to achieve an hourly output rate of 33 units. Assume that the shop works 60 minutes per hour (i.e., no breaks). 1.39 Workstations 1 2 3 4 .65 Efficiency Task a. Assign the tasks shown in the above precedence network (times are on the nodes and are in minutes) to workstations using the following heuristic rules: (i) "Assign the task with the most followers." (ii) Tiebreaker: “Assign the task with the longest time." (Round the intermediate calculations and final answers to 2 decimal places.) a b, e c, d, g f, h 120.0 .87 3 3 3 3 *% .44 .97 Idle Time 15 25 10 0.3 1.47 f x 45 1.2 x 9 b. What is the efficiency? (Round the intermediate calculations to 2 decimal places. Round the final answer to 1 decimal place.) .24 h
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 6 images

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