The Problem In Words
For our example, we have eleven tasks (A through K) to assign to four workstations (1 through 4). The task precedence diagram looks like this:
The times to complete the various tasks are given in the table below:
Task: |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
Minutes: |
45 |
11 |
9 |
50 |
15 |
12 |
12 |
12 |
12 |
8 |
9 |
We need to find an assignment of tasks to workstations that minimize the assembly line’s cycle time.