Real-Time Systems

, Volume 34, Issue 3, pp 155–172

Approximation algorithms for scheduling real-time jobs with multiple feasible intervals


DOI: 10.1007/s11241-006-8198-4

Cite this article as:
Chen, JJ., Wu, J. & Shih, CS. Real-Time Syst (2006) 34: 155. doi:10.1007/s11241-006-8198-4


Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is \({\cal N}{\cal P}\)-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average.

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringGraduate Institute of Networking and Multimedia, National Taiwan UniversityTaipeiROC
  2. 2.Department of Information TechnologyNational Pingtung Institute of CommerceROC

Personalised recommendations