Pages that link to "Item:Q2319644"

The following pages link to Non-clairvoyantly scheduling to minimize convex functions (Q2319644):

Displaying 1 item.

• A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)