Pages that link to "Item:Q1268251"

The following pages link to A tight lower bound for the completion time variance problem (Q1268251):

Displaying 9 items.

• A tight lower bound for job scheduling with cancellation (Q1044744) (← links)
• A minimax job completion-time problem revisited (Q1104851) (← links)
• Tight bounds on expected time to add correctly and add mostly correctly (Q1318774) (← links)
• A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
• 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)
• Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem (Q4261219) (← links)
• Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (Q5145291) (← links)