1095 search results - page 16 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
162
click to vote
AIPS
2003
15 years 7 months ago
2003
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
192
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
150
click to vote
JCO
2010
15 years 20 days ago
2010
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
160
click to vote
RTSS
2005
IEEE
15 years 11 months ago
2005
IEEE
Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past ...
173
click to vote
CLUSTER
2003
IEEE
15 years 11 months ago
2003
IEEE
— The efforts to construct a national scale Grid computing environment have brought unprecedented computing capacity and complicacy. Exploiting this complex infrastructure requir...