I'll have to develop an application which the final purpose is to sort all the member into groups. Each group will have the same size.

And I had to put the members into the groups several times during the execution of the program.

To put the member into the groups, a lot of critria are to be look at, because we do not want that two people are put again together two time in the same execution of the program, of course if it's the only way to find a correct solution, it' fine, and there is a lot of other criteria, like some people can be willing to be always with another member.

So to resume, we have n members to put in groups of size 8. After the first "round" we have to do again the algorithm to sort them differently. And a lot of critria may go in the calculation of the priority of each member

Do you have any idea?