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

DOI10.1007/S11241-006-8198-4zbMATH Open1103.68983OpenAlexW1989748081MaRDI QIDQ853634FDOQ853634

Authors: Jian-Jia Chen, Jun Wu, 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

Recommendations

• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Approximating the throughput of multiple machines in real-time scheduling
• scientific article; zbMATH DE number 1670533
• Approximating the throughput of multiple machines under real-time scheduling
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines

Mathematics Subject Classification ID

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

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Chebyshev's approximation algorithms and applications
• 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 to minimize maximum error
• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• Algorithms for Scheduling Imprecise Computations with Timing Constraints

Cited In (2)

• Energy optimal schedules for jobs with multiple active intervals
• Integer programming approach for schedulability of sporadic real-time systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853634)