Scheduling imprecise computation tasks with \(0/1\)-constraint
From MaRDI portal
Publication:1377660
DOI10.1016/S0166-218X(97)00024-3zbMath0890.68018MaRDI QIDQ1377660
Publication date: 17 February 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS, IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
Cites Work
- Unnamed Item
- 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
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- A fault-tolerant scheduling problem
- Single Machine Scheduling to Minimize Total Late Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some simple scheduling algorithms