Pages that link to "Item:Q4367272"
From MaRDI portal
The following pages link to A Heuristic for a Scheduling Problem with Communication Delays (Q4367272):
Displaying 13 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)
- 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)
- Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← 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)
- General scheduling non-approximability results in presence of hierarchical communications (Q2384613) (← links)
- (Q2741499) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays (Q5929309) (← links)
