Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.
Zhiyi TanYong HeLeah EpsteinPublished in: Inf. Comput. (2005)
Keyphrases
- scheduling problem
- flowshop
- ordinal data
- orders of magnitude
- worst case
- computationally efficient
- data structure
- exhaustive search
- parallel machines
- dynamic programming
- learning algorithm
- optimization problems
- data sets
- computational cost
- minimizing makespan
- times faster
- single machine
- setup times
- unrelated parallel machines
- data mining techniques
- upper bound
- np hard
- significant improvement
- computational complexity
- machine learning