Scalable linear programming based resource allocation for makespan minimization in heterogeneous computing systems.
Kyle M. TarpleeRyan FrieseAnthony A. MaciejewskiHoward Jay SiegelPublished in: J. Parallel Distributed Comput. (2015)
Keyphrases
- resource allocation
- computing systems
- linear programming
- makespan minimization
- polynomially solvable
- np hard
- parallel machines
- special case
- scheduling problem
- processing times
- job shop scheduling problem
- heterogeneous systems
- metaheuristic
- feasible solution
- parallel computing
- computer systems
- grid environment
- flowshop
- linear program
- single machine
- resource management
- resource allocation problems
- polynomial time approximation
- optimal solution
- dynamic programming
- release dates
- np complete
- optimal resource allocation
- resource consumption
- objective function
- approximation algorithms
- tabu search
- simulated annealing
- integer programming
- lagrangian relaxation
- computing platform
- genetic algorithm
- minimum cost
- setup times
- knapsack problem
- data processing