Efficient scheduling of tasks without full use of processor resources
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3466528 (Why is no real title available?)
- A Level Algorithm for Preemptive Scheduling
- Algorithms for Scheduling Tasks on Unrelated Processors
- An Analysis of Preemptive Multiprocessor Job Scheduling
- Bounds for LPT Schedules on Uniform Processors
- Bounds for List Schedules on Uniform Processors
- Bounds on Multiprocessing Timing Anomalies
- Bounds on the Scheduling of Typed Task Systems
- Efficient scheduling of tasks without full use of processor resources
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- On a multiplexing scheme for threshold logical elements
- Optimal Preemptive Scheduling on Two-Processor Systems
- Performance analysis of multiprocessor systems containing functionally dedicated processors
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Cited in
(7)- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- A note on on-line scheduling with precedence constraints on identical machines
- An improved monotone algorithm for scheduling related machines with precedence constraints
- A monotone approximation algorithm for scheduling with precedence constraints
- Efficient scheduling of tasks without full use of processor resources
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- On-line scheduling with precedence constraints
This page was built for publication: Efficient scheduling of tasks without full use of processor resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145998)
