1. 1. Draw the precedence diagram.

2. 2. Determine workstation cycle time.

3. 3. Determine the theoretical minimum number of workstations required.

4. Select assignment rules.
Prioritize tasks in order of the largest number of following tasks.
Prioritize tasks in order of the longest task time.

5. 5. Make task assignments to form Workstation 1, Workstation 2, etc.

6. Station 1 A 45 5.4 None Station 2 Station 3 Station 4 Station 5 Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2
Station 3
Station 4
Station 5

7. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 Station 4
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3
Station 4
Station 5

8. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 B 11 39.4 C, E
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3 B 11
39.4
C, E
C,E E
Station 4
Station 5

9. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 B E 11 15 39.4
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3 B E 11 15
39.4
24.4
C, E
C,H,I
C,E C
Station 4
Station 5

10. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 B E C 11 15 9
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3 B E C 11 15 9
39.4
24.4
15.4
C, E
C,H,I
F,G,H,I
C,E
Station 4
Station 5

11. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 B E C F* 11 15 9
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3 B E C F* 11 15 9 12
39.4
24.4
15.4
3.4
C, E
C,H,I
F,G,H,I
C,E
Station 4
Station 5

12. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 B E C F* 11 15 9
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3 B E C F* 11 15 9 12
39.4
24.4
15.4
3.4
C, E
C,H,I
F,G,H,I
C,E
Station 4 G
38.4
H,I
Station 5

13. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 B E C F* 11 15 9
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3 B E C F* 11 15 9 12
39.4
24.4
15.4
3.4
C, E
C,H,I
F,G,H,I
C,E
Station 4 G H* I J 8
38.4
26.4
14.4
6.4
H,I
Station 5

14. Station 1 A 45 5.4 None Station 2 D 50 0.4 Station 3 B E C F* 11 15 9
Task
Task Time
(seconds)
Remaining unassigned Time
Feasible Remaining Tasks
Task with most followers
Task with longest operation time
Station 1 A 45
5.4
None
Station 2 D 50
0.4
Station 3 B E C F* 11 15 9 12
39.4
24.4
15.4
3.4
C, E
C,H,I
F,G,H,I
C,E
Station 4 G H* I J 8
38.4
26.4
14.4
6.4
H,I
Station 5 K
41.4

15. 6. Calculate efficiency.

16. 7. Evaluate the solution.