MO-Greedy: an extended beam-search approach for solving a multi-criteria scheduling problem on heterogeneous machines
CANON, Louis-Claude
PrograMming and scheduling design fOr Applications in Interactive Simulation [MOAIS]
PrograMming and scheduling design fOr Applications in Interactive Simulation [MOAIS]
CANON, Louis-Claude
PrograMming and scheduling design fOr Applications in Interactive Simulation [MOAIS]
< Leer menos
PrograMming and scheduling design fOr Applications in Interactive Simulation [MOAIS]
Idioma
en
Communication dans un congrès
Este ítem está publicado en
International Heterogeneity in Computing Workshop, 2011-05-16, Anchorage. 2011-09-01
Resumen en inglés
Optimization problems can often be tackled with respect to several objectives. In such cases, there can be several incomparable Pareto-optimal solutions. Computing or approximating such solutions is a major challenge in ...Leer más >
Optimization problems can often be tackled with respect to several objectives. In such cases, there can be several incomparable Pareto-optimal solutions. Computing or approximating such solutions is a major challenge in algorithm design. Here, we show how to use an extended beam-search technique to solve a multi-criteria scheduling problem for heterogeneous machines. This method, called MO-Greedy (for Multi-Objective greedy), allows the design of a multi-objective algorithm when a single-objective greedy one is known. We show that we can generate, in a single execution, a Pareto front optimized with respect to the preferences specified by the decision maker. We compare our approach to other heuristics and an approximation algorithm and show that the obtained front is, on average, better with our method.< Leer menos
Orígen
Importado de HalCentros de investigación