Pages that link to "Item:Q1342284"
From MaRDI portal
The following pages link to Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284):
Displaying 21 items.
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- A very difficult scheduling problem with communication delays (Q1604057) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
- Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications (Q1853631) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- General scheduling non-approximability results in presence of hierarchical communications (Q2384613) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- (Q2741503) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
- On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays (Q5929309) (← links)
- Scheduling interval ordered tasks with non-uniform deadlines (Q6487456) (← links)
