Polynomial-time approximation schemes for scheduling problems with time lags.
Xiandong ZhangSteef L. van de VeldePublished in: J. Sched. (2010)
Keyphrases
- approximation schemes
- scheduling problem
- approximation algorithms
- np hard
- special case
- single machine
- processing times
- worst case
- flowshop
- optimal solution
- tabu search
- np complete
- job shop scheduling
- lower bound
- job shop scheduling problem
- greedy heuristics
- parallel machines
- linear programming
- error metrics
- polynomial time approximation
- job shop
- constraint satisfaction problems
- numerical methods
- computational complexity
- reinforcement learning
- search space
- higher order
- sequencing problems
- list scheduling