New Algorithms for an Ancient Scheduling Problem
Yair BartalAmos FiatHoward J. KarloffRakesh VohraPublished in: STOC (1992)
Keyphrases
- scheduling problem
- theoretical analysis
- computational cost
- learning algorithm
- times faster
- tabu search
- optimization problems
- parallel machines
- single machine
- recently developed
- orders of magnitude
- np hard
- significant improvement
- computationally efficient
- particle swarm optimization
- machine learning algorithms
- benchmark datasets
- upper bound
- computational complexity
- reinforcement learning
- neural network