1095 search results - page 86 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
MST
2000
14 years 9 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
110
click to vote
JSSPP
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we address the problem of finding workload exchange policies for decentralized Computational Grids using an Evolutionary Fuzzy System. To this end, we establish a n...
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
DAGSTUHL
2006
14 years 11 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
ENTCS
2006
14 years 10 months ago
2006
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...