199 search results - page 1 / 40 » Complexity of two dual criteria scheduling problems |
ORL
2007
14 years 10 months ago
2007
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...
AAAI
1997
15 years 16 days ago
1997
Difficult real-time AI problems require a means for expressing multi-dimensional and dynamic goal criteria and a principled model for satisficing to best meet the criteria. In the...
114
click to vote
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
IPCO
1998
15 years 16 days 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...
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...