82 search results - page 8 / 17 » Maximizing Job Completions Online |
147
click to vote
IEEEPACT
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we compare the performance of area equivalent small, medium, and large-scale multithreaded chip multiprocessors (CMTs) using throughput-oriented applications. We use...
182
click to vote
AIPS
2007
15 years 8 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
144
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
142
click to vote
STACS
2009
Springer
16 years 23 days ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
136
click to vote
CLUSTER
2005
IEEE
15 years 11 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...