320 search results - page 33 / 64 » Open problems in real-time scheduling |
EOR
2007
14 years 11 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
ICMCS
1997
IEEE
15 years 4 months ago
1997
IEEE
Multimedia applications have dynamic and adaptive realtime requirements. Current scheduling practice, as typified by UNIX System V Release 4, lacks the necessary information and ...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
IPCO
1998
15 years 1 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
CP
2009
Springer
15 years 6 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...