82 search results - page 3 / 17 » Maximizing Job Completions Online |
RTSS
1994
IEEE
13 years 9 months ago
1994
IEEE
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
ECRTS
2004
IEEE
13 years 9 months ago
2004
IEEE
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
JCO
2010
13 years 5 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...
RTCSA
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...