Pages that link to "Item:Q4595479"

The following pages link to Scheduling jobs with communication delays: Using infeasible solutions for approximation (Q4595479):

Displaying 10 items.

• Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
• Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
• On the complexity of scheduling with large communication delays (Q1278302) (← links)
• Approximation algorithms for scheduling with a limited number of communications (Q1575597) (← links)
• A very difficult scheduling problem with communication delays (Q1604057) (← links)
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
• Server cloud scheduling (Q2085746) (← links)
• Scheduling on Two Unbounded Resources with Communication Costs (Q3297565) (← links)
• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
• Server cloud scheduling (Q6130327) (← links)