Sciweavers

320 search results - page 32 / 64
» Open problems in real-time scheduling
Sort
View
101
Voted
ORL
2007
86views more  ORL 2007»
15 years 3 months ago
Complexity of two dual criteria scheduling problems
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...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
AAAI
2006
15 years 5 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...
RTCSA
2009
IEEE
15 years 11 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
RTCSA
2003
IEEE
15 years 9 months ago
Scheduling Jobs with Multiple Feasible Intervals
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...
Chi-Sheng Shih, Jane W.-S. Liu, Infan Kuok Cheong
114
Voted
ICASSP
2011
IEEE
14 years 8 months ago
An innovative RTP-based residential power scheduling scheme for smart grids
This paper proposes a Real-Time Pricing (RTP)-based power scheduling scheme as demand response for residential power usage. In this scheme, the Energy Management Controller (EMC) ...
Chen Chen, Shalinee Kishore, Lawrence V. Snyder