Approximating Real-Time Scheduling on Identical Machines
From MaRDI portal
Publication:5405072
Recommendations
- Approximating the throughput of multiple machines in real-time scheduling
- Approximating the throughput of multiple machines under real-time scheduling
- Scheduling to approximate minimization objectives on identical machines
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Publication:4938775
- Interval scheduling on identical machines
- Scheduling on parallel identical machines to minimize total tardiness
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- Approximation schemes for scheduling on parallel machines
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
Cited in
(8)- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
- Assigning sporadic tasks to unrelated parallel machines
- scientific article; zbMATH DE number 7561425 (Why is no real title available?)
- Approximating the throughput of multiple machines under real-time scheduling
- Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks
- A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
- Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions
- Interval scheduling on identical machines
This page was built for publication: Approximating Real-Time Scheduling on Identical Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405072)