Approximation Algorithms For Scheduling On Uniform Processors
From MaRDI portal
Publication:4202255
Recommendations
- Approximation for scheduling on uniform nonsimultaneous parallel machines
- Approximation algorithms for multiprocessor scheduling under uncertainty
- scientific article; zbMATH DE number 1979517
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Publication:4938775
- Approximation schemes for scheduling on parallel machines
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation algorithms for general parallel task scheduling
- Scheduling imprecise computation tasks on uniform processors
Cited in
(17)- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- Approximation for scheduling on uniform nonsimultaneous parallel machines
- Time optimal linear schedules for algorithms with uniform dependencies
- scientific article; zbMATH DE number 1863264 (Why is no real title available?)
- On time optimal implementation of uniform recurrences onto array processors via quadratic programming
- An approximation result for a duo-processor task scheduling problem
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines
- scientific article; zbMATH DE number 4162635 (Why is no real title available?)
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
- A unified approach to approximating resource allocation and scheduling
- Scheduling imprecise computation tasks on uniform processors
- scientific article; zbMATH DE number 34575 (Why is no real title available?)
- An efficient load distribution strategy for a distributed linear network of processors with communication delays
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- scientific article; zbMATH DE number 4011924 (Why is no real title available?)
This page was built for publication: Approximation Algorithms For Scheduling On Uniform Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202255)