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

DOI10.1007/S11241-006-8198-4zbMath1103.68983OpenAlexW1989748081MaRDI QIDQ853634

Jun Wu, Jian-Jia Chen, Chi-Sheng Shih

Publication date: 17 November 2006

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/155105

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Energy optimal schedules for jobs with multiple active intervals

Cites Work

• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• The one-machine sequencing problem
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Chebyshev's approximation algorithms and applications

This page was built for publication: Approximation algorithms for scheduling real-time jobs with multiple feasible intervals