The system has an optimizing algorithm. It assigns students based on several criteria. One of the criteria it uses is to avoid assigning siblings to the same Tutor as we have found it is best to keep siblings separate. Usually the algorithm will assign students by distributing the students evenly. However, in the case of siblings, the algorithm will assign the students to different Tutors when possible.
For instance, say Tutor A has 1 student, and Tutor B has 4 students and each tutor has a capacity of 5 students. There are three newly registered students S1, S2 and S3 and none of the students are siblings. Then the algorithm will allocate S1, S2, S3 to Tutor A.
However, in the above example, if say S2 and S3 were siblings, then it would allocate S1 and S2 to Tutor A, and because there is an open spot with Tutor B, it would allocate S3 to tutor B.
Note that if in the above example, Tutor B had 5 students already, then S1, S2 and S3 would have been allocated to Tutor A, as there was no open spot with other tutors. In this case, the session leads can manually reassign students by moving students between Tutor A and Tutor B.