The following pages link to (Q4252370):
Displaying 13 items.
- Fair online load balancing (Q398848) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- An improved lower bound for a bi-criteria scheduling problem (Q924887) (← links)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- A note on scheduling to meet two min-sum objectives (Q2643821) (← links)
