Pages that link to "Item:Q2893338"
From MaRDI portal
The following pages link to Scheduling in the presence of processor networks : complexity and approximation (Q2893338):
Displaying 18 items.
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
- On the minimum number of processors for scheduling problems with communication delays (Q1290161) (← links)
- Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
- Upper bound on the number of processors for scheduling with interprocessor communication delays. (Q1403166) (← links)
- Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Minimizing the volume in scheduling an out-tree with communication delays and duplication. (Q1853241) (← links)
- Scheduling chains on uniform processors with communication delays (Q1860371) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- DVS scheduling in a line or a star network of processors (Q2354292) (← links)
- On the Complexity of Scheduling in Half-Duplex Diamond Networks (Q2976842) (← links)
- C.P.M. Scheduling with Small Communication Delays and Task Duplication (Q3980521) (← links)
- A Heuristic for a Scheduling Problem with Communication Delays (Q4367272) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
- Task scheduling in networks (Q5054769) (← links)
- Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
