The following pages link to (Q4252437):
Displayed 5 items.
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Multicriteria scheduling (Q2566699) (← links)