A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS

DOI10.1142/S0129054104002716zbMath1098.68014OpenAlexW2074482232MaRDI QIDQ4667920

Joseph Y.-T. Leung, Kevin I.-J. Ho

Publication date: 18 April 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002716

zbMATH Keywords

polynomial time algorithmreal-time systemhierarchical optimization problem

Mathematics Subject Classification ID

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

Related Items (2)

Scheduling imprecise computation tasks on uniform processors ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches

Cites Work

• Minimizing mean weighted execution time loss on identical and uniform processors
• Approximation algorithms for scheduling a single machine to minimize total late work
• Minimizing the weighted number of tardy task units
• Scheduling imprecise computation tasks with \(0/1\)-constraint
• Scheduling with Deadlines and Loss Functions
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Single Machine Scheduling to Minimize Total Late Work
• Minimizing Maximum Weighted Error for Imprecise Computation Tasks
• Some simple scheduling algorithms
• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error

This page was built for publication: A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS