From Computerworld Australia comes news that researchers at the University of Sydney have developed (and, sadly, patented) an algorithm that its inventors say will schedule jobs in a way that reduces ...
In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results