On the complexity of scheduling tasks with discrete starting times.

Published in: Oper. Res. Lett. (1992)

Keyphrases

scheduling problem
real time
neural network
orders of magnitude
discrete geometry
multi agent
computational complexity
starting point
round robin
computational grids
discrete version
databases
np hard
resource allocation
scheduling algorithm
space complexity