34 search results - page 1 / 7 » Approximation Algorithms for Scheduling Multiple Feasible In... |
RTCSA
2005
IEEE
13 years 10 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...
RTCSA
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
MOR
2006
13 years 4 months ago
2006
SPAA
2010
ACM
13 years 4 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...