文章基本信息

标题：Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem
本地全文：下载
作者：J. Carlos Soto-Monterrubio ; Alejandro Santiago ; H. J. Fraire-Huacuja 等
期刊名称：International Journal of Combinatorial Optimization Problems and Informatics
印刷版ISSN：2007-1558
电子版ISSN：2007-1558
出版年度：2016
卷号：7
期号：3
页码：7-19
语种：English
出版社：International Journal of Combinatorial Optimization Problems and Informatics
其他摘要：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 .
其他关键词：Scheduling; optimal Pareto front; exact algorithm; branch and bounD.