A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing

DOI10.1016/j.ejor.2019.12.006zbMath1441.90060OpenAlexW2995075655WikidataQ126566643 ScholiaQ126566643MaRDI QIDQ2301940

KaiLun Eng, Abdullah Muhammed, Mohamad Afendee Mohamed, Sazlinah Hasan

Publication date: 25 February 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://psasir.upm.edu.my/id/eprint/80426/1/HYBRID.pdf

zbMATH Keywords

schedulinghybrid heuristicgreat deluge (GD)grid scheduling problemvariable neighbourhood descent (VND)

Mathematics Subject Classification ID

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

Uses Software

• GridSim
• irace
• OptorSim
• SIMGRID
• CPU Benchmarks

Cites Work

• Unnamed Item
• Variable neighbourhood search: methods and applications
• Hybrid variable neighbourhood approaches to university exam timetabling
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• NP-complete scheduling problems
• Variable neighborhood search
• Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
• Meta-heuristics for Grid Scheduling Problems
• GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

This page was built for publication: A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing