How small are shifts required in optimal preemptive schedules?

Edward G. Coffman Jr.C. T. Ng Vadim G. Timkovsky

Published in: J. Sched. (2015)

Keyphrases

scheduling problem
worst case
search engine
optimal design
dynamic programming
lower bound
e learning
real world
optimal solution
video sequences
case study
website
small number
social networks
single machine
processing times
finding optimal
sufficiently small