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 ...

The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.

Grid computing is a powerful form of distributed computing wherein a network of loosely coupled and geographically separated computers, typically of different computational powers, work together to ...