Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem.
José Carlos Soto MonterrubioAlejandro Santiago PinedaHéctor Joaquín Fraire HuacujaJuan Frausto SolísDavid Terán VillanuevaPublished in: Int. J. Comb. Optim. Probl. Informatics (2016)
Keyphrases
- branch and bound algorithm
- heterogeneous computing
- multi objective
- lower bound
- precedence constraints
- branch and bound
- compute intensive
- upper bound
- np hard
- objective function
- evolutionary algorithm
- test problems
- multiple objectives
- grid computing
- optimal solution
- single machine scheduling problem
- particle swarm optimization
- parallel processors
- combinatorial optimization
- upper bounding
- lower bounding
- genetic algorithm
- high performance computing
- lagrangian relaxation
- scheduling problem
- parallel computing
- release dates
- search algorithm
- sequence dependent setup times
- partial order
- neural network
- orders of magnitude
- optimization problems
- data mining