An improved approximation algorithm for the ancient scheduling problem with deadlines.
Eugene LevnerAmir ElaloufPublished in: CoDIT (2014)
Keyphrases
- scheduling problem
- np hard
- error bounds
- learning algorithm
- improved algorithm
- dynamic programming
- experimental evaluation
- detection algorithm
- expectation maximization
- preprocessing
- computational complexity
- similarity measure
- approximation ratio
- significant improvement
- computational cost
- worst case
- data structure
- linear programming
- objective function
- theoretical analysis
- optimization algorithm
- randomized approximation
- job shop scheduling problem
- neural network
- single machine
- response time
- high accuracy
- cost function
- genetic algorithm