1. A method of organizing and routing a multitude of service requests of a multitude of different types, to a plurality of teams of servers, the method comprising the steps of: establishing a set of system parameters; using said parameters to generate a model, said model including a defined optimization problem with the goal of finding teams of servers that optimizes variance of total processing; solving said optimization problem to output a set of mixing weights; using said set of parameters and said mixing weights to generate a task; and distributing the service requests to different service teams according to the generated task, wherein the optimization problem is: find values w ij (team i, request j) satisfying the condition: 
 min sum i=1,l (sum j=1 w ij sd j ) 2 , where: w ij >=0, w ij <=n ij , sum w ij =N j , and where: the requests are denoted as r 1 ,. .. , r k , the teams of servers are denoted as t 1 ,. .. , t l , each team i is able to provide throughput n ij for the requests r 1 ,. .. , r k , a load is characterized by counts N 1 ,. .. , N k for the requests r 1 ,. .. , r k , and sd j is the standard deviation in the distribution of the throughputs of the server teams for processing request j.