Pages that link to "Item:Q1268251"
From MaRDI portal
The following pages link to A tight lower bound for the completion time variance problem (Q1268251):
Displaying 3 items.
- Minimizing completion time variance with compressible processing times (Q1781972) (← links)
- Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
- A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)