Pages that link to "Item:Q3581492"
From MaRDI portal
The following pages link to A robust maximum completion time measure for scheduling (Q3581492):
Displaying 5 items.
- New approximation results for resource replication problems (Q270001) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Minimizing average flow-time under knapsack constraint (Q896150) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
