2. Rank positional weight
It is a heuristic algorithm used to solve the assembly line balancing
problem. This methods depends on the processing times for all tasks and
their followers.
3. RPW Example
The below figure shows the tasks, times and precedence relation for each
element used in cashew machine assembly.
Tas Time
(min)
Description Predecessor
1 20 Frame assembly -
2 20 Cutter assembly 1
3 45 Motor assembly 2
4 10 Crank assembly 3
5 7 Pickup assembly 2
6 5 Belt cover assembly 5
7 8 Cup assembly 5
8 20 Bucket and disk assembly with
shaft
5
9 15 Feed motor and belt assembly 5
10 5 Circuit assembly 5
11 4 Hopper assembly 6,7,8,9,10
12 45 Connect wires 11,4
13 6 Outer cover assembly 12
5. RPW solution method
1-draw precedence diagram.
2- for each task find the transitive followers (followers of followers till you
reach the end of the graph).
3- calculate the RPW for each task (i). (RPW(i)= time of the task (i)+
summation of times of tasks in the transitive followers (i)
4-re-arrange tasks according to their RPW in descending order
5-open a work station and assign the feasible tasks till the cycle time is
reached or no more assignable tasks in the station.
6- Repeat step 5 till all tasksare added to work stations.