I think kvale has already described the outlines of a solution, but I would create a 'schedule' for each person, then based on that information find out when they are free. Once you have that information, you can assign people to rings, starting with the time slots that are hardest to fill (that is, have the fewest people), and move from there to the time slots that are the easiest to fill (the ones that have lots of people).
Alex / talexb / Toronto
"Groklaw is the open-source mentality applied to legal research" ~ Linus Torvalds
In reply to Re: Interesting scheduling application problem.
by talexb
in thread Interesting scheduling application problem.
by blue_cowdawg
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |