Pages that link to "Item:Q2643821"
From MaRDI portal
The following pages link to A note on scheduling to meet two min-sum objectives (Q2643821):
Displayed 8 items.
- An almost tight lower bound for the scheduling problem to meet two min-sum objectives (Q384219) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- An improved lower bound for a bi-criteria scheduling problem (Q924887) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Two dimensional load balancing (Q1785303) (← links)
- An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)