Login / Signup
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.
Shmuel Zaks
Published in:
WG (2015)
Keyphrases
</>
scheduling problem
optical networks
approximation error
single machine
processing times
real time
computational complexity
np hard
worst case
general purpose
approximation algorithms
job shop scheduling problem
queueing networks