A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing (Q2301940)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing |
scientific article; zbMATH DE number 7173701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing |
scientific article; zbMATH DE number 7173701 |
Statements
A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing (English)
0 references
25 February 2020
0 references
scheduling
0 references
hybrid heuristic
0 references
variable neighbourhood descent (VND)
0 references
great deluge (GD)
0 references
grid scheduling problem
0 references
0 references
0.8384460806846619
0 references
0.8232242465019226
0 references
0.8158674836158752
0 references
