An efficient implementation of the Min-Min heuristic
From MaRDI portal
Publication:336601
DOI10.1016/J.COR.2013.05.014zbMATH Open1348.90636OpenAlexW2012298530MaRDI QIDQ336601FDOQ336601
Authors: Pablo Ezzatti, Martín Pedemonte, Álvaro Martín 
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
Recommendations
- A heuristic algorithm for scheduling multiprocessor tasks in a grid computing environment
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- scientific article; zbMATH DE number 5670540
- Independent tasks scheduling on tree-based grid computing platforms
- Optimized parallelization heuristic for task scheduling
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Quicksort
- Title not available (Why is that?)
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- QoS guided min-min heuristic for grid task scheduling
- A tabu search algorithm for scheduling independent jobs in computational grids
- Radix Exchange—An Internal Sorting Method for Digital Computers
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- 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
Cited In (1)
Uses Software
This page was built for publication: An efficient implementation of the Min-Min heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336601)
