A branch and bound algorithm to minimize completion time variance on a single processor.
G. ViswanathkumarG. SrinivasanPublished in: Comput. Oper. Res. (2003)
Keyphrases
- branch and bound algorithm
- single processor
- parallel processors
- precedence constraints
- lower bound
- branch and bound
- multi processor
- parallel architectures
- upper bound
- np hard
- optimal solution
- combinatorial optimization
- parallel machines
- upper bounding
- single machine scheduling problem
- distributed memory
- lagrangian relaxation
- scheduling problem
- finding an optimal solution
- special case
- parallel processing
- linear programming
- search space
- fine grained