188 search results - page 2 / 38 » Regret Minimization and Job Scheduling |
EOR
2010
13 years 2 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
APPROX
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
ICPP
2007
IEEE
13 years 11 months ago
2007
IEEE
Quality of service (QoS) mechanisms allowing users to request for turn-around time guarantees for their jobs have recently generated much interest. In our previous work we had des...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE