1095 search results - page 48 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
124
click to vote
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
145
click to vote
ESWA
2011
14 years 11 months ago
2011
This paper presents a multi-objective optimisation model and algorithms for scheduling of radiotherapy treatments for categorised cancer patients. The model is developed considerin...
122
click to vote
SODA
2004
ACM
15 years 5 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 ...
161
Voted
RTAS
2003
IEEE
15 years 9 months ago
2003
IEEE
A reward-based task typically consists of a mandatory part that must be accomplished before the given deadline, and an optional part that is associated with rewards for partial co...
141
Voted
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...