Semi-online scheduling with known partial information about job sizes on two identical machines.
Qian CaoZhaohui LiuT. C. Edwin ChengPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- partial information
- identical machines
- processing times
- scheduling problem
- single machine
- job scheduling
- incomplete information
- precedence constraints
- scheduling jobs
- polynomial time approximation
- setup times
- scheduling algorithm
- planning domains
- tabu search
- combinatorial optimization
- approximation algorithms
- resource allocation
- optimization problems
- lower bound