fairness scheduling problem - partition nxm item scores into m groups of n items each
- From: Richard <richard.google@xxxxxxxxxxxxx>
- Date: 18 May 2007 19:03:34 -0700
N = nxm
An event hosts N participants with ratings from LO to HI.
The participants need to be fairly arranged into n teams of m each.
In other words, find a way to minimize the stdev of the teams mean
ratings
Simple example for n=3 m=3
given ratings
4 6 2 1 5 10 6 3 1 2
one arrangement is
g1: 1 2 10
g2: 3 4 6
g3: 2 5 7
Any suggestions on algorithms to find best or close to best solution?
.
- Follow-Ups:
- Prev by Date: Re: how do I make this work in Excel with Runge Kutta?
- Next by Date: Re: help about ARPACK solver
- Previous by thread: Linear Least Squares. quadratic, semidefinite, positive
- Next by thread: Re: fairness scheduling problem - partition nxm item scores into m groups of n items each
- Index(es):
Loading
