An efficient implementation of the Min-Min heuristic

DOI10.1016/J.COR.2013.05.014zbMath1348.90636OpenAlexW2012298530MaRDI QIDQ336601

Pablo Ezzatti, Álvaro Martín, Martín Pedemonte

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.014

zbMATH Keywords

schedulingheterogeneous computinggrid computingMin-Min heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Quicksort
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems
• Efficient batch job scheduling in grids using cellular memetic algorithms
• QoS guided min-min heuristic for grid task scheduling
• Radix Exchange—An Internal Sorting Method for Digital Computers
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Quicksort
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

This page was built for publication: An efficient implementation of the Min-Min heuristic