A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing
DOI10.1016/J.EJOR.2019.12.006zbMATH Open1441.90060OpenAlexW2995075655WikidataQ126566643 ScholiaQ126566643MaRDI QIDQ2301940FDOQ2301940
Authors: 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
Recommendations
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
- Job scheduling in computational grid using a hybrid algorithm based on genetic algorithm and particle swarm optimization
- scientific article; zbMATH DE number 5763750
- Large-Scale Scientific Computing
- GA-based task scheduling algorithm for efficient utilization of available resources in computational grid
schedulinghybrid heuristicgreat deluge (GD)grid scheduling problemvariable neighbourhood descent (VND)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing
- Title not available (Why is that?)
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Hybrid variable neighbourhood approaches to university exam timetabling
- NP-complete scheduling problems
- Meta-heuristics for Grid Scheduling Problems
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
Cited In (7)
- GA-based task scheduling algorithm for efficient utilization of available resources in computational grid
- Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
- Integration of task abortion and security requirements in GA-based meta-heuristics for independent batch grid scheduling
- A grid DAG scheduling algorithm based on fuzzy clustering
- Lower-bound complexity algorithm for task scheduling on heterogeneous grid
- A tabu search algorithm for scheduling independent jobs in computational grids
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
Uses Software
This page was built for publication: A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301940)
