Pages that link to "Item:Q4202255"
From MaRDI portal
The following pages link to Approximation Algorithms For Scheduling On Uniform Processors (Q4202255):
Displaying 15 items.
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- On time optimal implementation of uniform recurrences onto array processors via quadratic programming (Q1270564) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
- An efficient load distribution strategy for a distributed linear network of processors with communication delays (Q1805442) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- (Q3489778) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
- An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors (Q3971845) (← links)
- A variation of Graham's LPT-algorithm (Q3989473) (← links)
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines (Q4203814) (← links)
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs (Q4729336) (← links)
- (Q4791888) (← links)
- Time optimal linear schedules for algorithms with uniform dependencies (Q5375403) (← links)
- A unified approach to approximating resource allocation and scheduling (Q5895231) (← links)
