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 there is time to compute the schedule, this algorithm can be used. Otherwise, the simple heuristics presented here can be used. In addition, a priority-boosting EDF algorithm is designed to enhance the timeliness of jobs. Simulation results show that the combined use of the heuristics and the priority boosting EDF algorithm performs nearly as well as the optimal algorithm.

• Type: Conference
• Year: 2003
• Where: RTCSA
• Authors: Chi-Sheng Shih, Jane W.-S. Liu, Infan Kuok Cheong
• Keywords: EDF Algorithm, Optimal Branch-and-bound Algorithm, Priority-boosting Edf Algorithm, Real-Time Computing, RTCSA 2003