Optimal combinations of priority rules for scheduling

For the problem of finding optimal combinations of priority scheduling rules an optimal algorithm of finding an optimal combination of static priorities in a three-server problem and polynomial algorithms with estimates in the problem of $m$ servers are proposed and some results on choice of a set of static priorities are given. The finding of an optimal combination of dynamic priorities in a weighted problem of one server is found to be a polynomially complete problem.