is goal is to produce 1,000 bicycles per standard 40-hour workweek, Time Task Precedence Tasks (sec) 60 K3 K4 24 K3 27 66 22 3 K3 K3 J3 22221 2225981

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
please answer within 30 minutes its very urgent.
As the Cottrell Bicycle Co. of St. Louis completes plans for its new assembly line, it identifies 25 different tasks in the production process. VP of Operations
Jonathan Cottrell now faces the job of balancing the line. He lists precedences and provides time estimates for each step based on work-sampling
techniques. His goal is to produce 1,000 bicycles per standard 40-hour workweek,
Time
Time
Task
Precedence Tasks
Task
Precedence Tasks
(sec)
60
24
27
66
(sec)
109
53
72
78
37
78
F3
F4
F9, E2, E3
E3, D6
D6
F7
A7 no nn
K3
E3
D6
D7
D8
D9
C1
K4
K3
K3
K3
K3
K9
J1
J2
J3
22
3
D6
37
78
K3
D9
J2
J3
G4
G5
F3
22
3.
79
29
32
92
21
126
F7
D7, D8, D9, C1
C1
83
B5
B5
K4, K9
K9, J1
J2
J2
J3
G4
G5. F3
C1
B3
B5
B7
72
108
18
52
72
114
F4
F7
F9
E2
A1
A2
A3
87, A1, A2
18
Balance this operation, using various heuristics Fil in the summary table below (enter number of workstations as a whole number and efficiency as a percent
rounded to two decimal places
rounded to two decimal places.)
Actual
Number of
Workstations
Actual
Efficiency
Algorithm
Fewest following tasks
Longest operation time
Most following tasks
Ranked positional weight
Shortest operation time
Transcribed Image Text:As the Cottrell Bicycle Co. of St. Louis completes plans for its new assembly line, it identifies 25 different tasks in the production process. VP of Operations Jonathan Cottrell now faces the job of balancing the line. He lists precedences and provides time estimates for each step based on work-sampling techniques. His goal is to produce 1,000 bicycles per standard 40-hour workweek, Time Time Task Precedence Tasks Task Precedence Tasks (sec) 60 24 27 66 (sec) 109 53 72 78 37 78 F3 F4 F9, E2, E3 E3, D6 D6 F7 A7 no nn K3 E3 D6 D7 D8 D9 C1 K4 K3 K3 K3 K3 K9 J1 J2 J3 22 3 D6 37 78 K3 D9 J2 J3 G4 G5 F3 22 3. 79 29 32 92 21 126 F7 D7, D8, D9, C1 C1 83 B5 B5 K4, K9 K9, J1 J2 J2 J3 G4 G5. F3 C1 B3 B5 B7 72 108 18 52 72 114 F4 F7 F9 E2 A1 A2 A3 87, A1, A2 18 Balance this operation, using various heuristics Fil in the summary table below (enter number of workstations as a whole number and efficiency as a percent rounded to two decimal places rounded to two decimal places.) Actual Number of Workstations Actual Efficiency Algorithm Fewest following tasks Longest operation time Most following tasks Ranked positional weight Shortest operation time
Expert Solution
steps

Step by step

Solved in 4 steps

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,