Alejandro Santiago Pineda

  • Citations Per Year
Learn More
We investigate the problem of scheduling precedence constrained applications on a distributed heterogeneous computing system with the aim of minimizing schedule length and reducing energy consumption. We present a scheduling algorithm based on the best-effort idea that promotes local search algorithms and dynamic voltage scaling to reduce energy(More)
In this paper a GRASP algorithm hybridized with a composite local search and path-relinking is proposed to solve the linear ordering problem with cumulative costs. Our approach consists on adding a composite local search that helps to produce diverse good solutions and improve them trough a truncated path-relinking with local search. The computational(More)
  • 1