Optimal dispatching of the flows falling in the same priority class.

Mihails Kulikovs Ernests Petersons

Published in: Autom. Control. Comput. Sci. (2010)

Keyphrases

dynamic programming
neural network
case study
lower bound
scheduling problem
manufacturing systems
optimal control
information systems
reinforcement learning
np hard
worst case
closed form
preemptive scheduling
squared euclidean distance