Value-density algorithms to handle transient overloads in scheduling.
Daniel MosséMartha E. PollackYagíl RonénPublished in: ECRTS (1999)
Keyphrases
- learning algorithm
- orders of magnitude
- computationally efficient
- computational complexity
- computationally expensive
- resource allocation
- optimization problems
- flexible manufacturing systems
- parallel processors
- combinatorial optimization
- theoretical analysis
- data sets
- worst case
- scheduling problem
- recommender systems
- bayesian networks
- neural network