2714 search results - page 87 / 543 » Approximation Schemes for Scheduling |
RTSS
2002
IEEE
15 years 5 months ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
108
click to vote
CCE
2004
15 years 13 days ago
2004
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
109
click to vote
IOR
2008
14 years 11 months ago
2008
Abstract Firms compete in supply functions when they offer a schedule of prices and quantities into a market; for example, this occurs in many wholesale electricity markets. We stu...
109
Voted
STOC
1996
ACM
15 years 4 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
79
Voted
ENTCS
2007
15 years 16 days ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...