This is an optimization problem. If you are asking about the algorithm, then try Genetic Algorithm, you can find relevant
articles[
^] on CP.
In a nut shell, you can add another effortless job as 0, so there will be a total of 6 jobs. You program will then permutate these 6 jobs among the 3 persons, then use the z=abs(a-b)+abs(b-c)+abs(c-a) as the fitness function to measure the balance-ness of each permutation.
Person a b c
job rotation1 2, 3 0 5 4, 1 => z?
job rotation2 0, 2 3 1 4, 5 => z?
... and so on
Have fun!