Minimizing the stretch when scheduling flows of divisible requests.

Arnaud Legrand Alan Su Frédéric Vivien

Published in: J. Sched. (2008)

Keyphrases

scheduling problem
scheduling algorithm
scheduling policies
databases
dynamic scheduling
flow control
information retrieval
project scheduling
minimize total
round robin
parallel machines
resource allocation
completion times
resource utilization
single machine
user requests
job shop
web services
scheduling strategy