614 search results - page 62 / 123 » Resource Minimization Job Scheduling |
146
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
122
Voted
STACS
2009
Springer
15 years 10 months 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...
143
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
138
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
119
click to vote
JSSPP
2005
Springer
15 years 9 months ago
2005
Springer
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...