1095 search results - page 6 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
ADCM
2007
14 years 9 months ago
2007
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
CP
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
105
click to vote
EOR
2010
14 years 7 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...