Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem
Fuente:
Redalyc
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artículo científico |
| Lenguaje: | en |
| Publicado: |
International Journal of Combinatorial Optimization Problems and Informatics
2016
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1876431466896818176 |
|---|---|
| author | J. Carlos Soto-Monterrubio |
| author_facet | J. Carlos Soto-Monterrubio |
| contents | Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem J. Carlos Soto-Monterrubio Alejandro Santiago H. J. Fraire-Huacuja Juan Frausto-Solís J. David Terán-Villanueva Computación Scheduling exact algorithm branch and bounD optimal Pareto front In this paper the Pareto optimization of the Heterogeneous Computing Scheduling Multi - Objective Problem (HCSMOP) is approached. The goal is to minimize two objectives which are in conflict: the overall completion time (makespan) and the energy consumed. In the revised literature, there are no reported exact algorithms which solve the HCSMOP. In this work, we propose a Branch and Bound algorithm to solve the problem and it is used to find the optimal Pareto front of a set of instances of the literature. This set is the first available benchmark to assess the performance of multiobjective algorithms with quality metrics that requires known the optimal front of the instances . 2016 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265254330002 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.3 Vol.7 |
| format | Artículo científico |
| id | redalyc_265254330002 |
| institution | Redalyc |
| language | en |
| publishDate | 2016 |
| publisher | International Journal of Combinatorial Optimization Problems and Informatics |
| spellingShingle | Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem J. Carlos Soto-Monterrubio Computación Scheduling exact algorithm branch and bounD optimal Pareto front Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem J. Carlos Soto-Monterrubio Alejandro Santiago H. J. Fraire-Huacuja Juan Frausto-Solís J. David Terán-Villanueva Computación Scheduling exact algorithm branch and bounD optimal Pareto front In this paper the Pareto optimization of the Heterogeneous Computing Scheduling Multi - Objective Problem (HCSMOP) is approached. The goal is to minimize two objectives which are in conflict: the overall completion time (makespan) and the energy consumed. In the revised literature, there are no reported exact algorithms which solve the HCSMOP. In this work, we propose a Branch and Bound algorithm to solve the problem and it is used to find the optimal Pareto front of a set of instances of the literature. This set is the first available benchmark to assess the performance of multiobjective algorithms with quality metrics that requires known the optimal front of the instances . 2016 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265254330002 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.3 Vol.7 |
| title | Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem |
| topic | Computación Scheduling exact algorithm branch and bounD optimal Pareto front |
| url | https://www.redalyc.org/articulo.oa?id=265254330002 |