Pages that link to "Item:Q582203"
From MaRDI portal
The following pages link to A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints (Q582203):
Displaying 17 items.
- Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
- A polynomially solvable class of quadratic semi-assignment problems (Q1278260) (← links)
- Scheduling tasks and communications on a virtual distributed system (Q1278306) (← links)
- Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465) (← links)
- Tree scheduling with communication delays (Q1327224) (← links)
- Scheduling complete intrees on two uniform processors with communication delays (Q1349970) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms (Q1850711) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
- Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
- A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays (Q6487185) (← links)
- Bounds and algorithms for a practical task allocation model (extended abstract) (Q6487459) (← links)
