2014
DOI: 10.1109/jsyst.2013.2256731
|View full text |Cite
|
Sign up to set email alerts
|

Metaheuristic Scheduling for Cloud: A Survey

Abstract: Cloud computing has become an increasingly important research topic given the strong evolution and migration of many network services to such computational environment. The problem that arises is related with efficiency management and utilization of the large amounts of computing resources. This paper begins with a brief retrospect of traditional scheduling, followed by a detailed review of metaheuristic algorithms for solving the scheduling problems by placing them in a unified framework. Armed with these two… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
87
0
2

Year Published

2015
2015
2021
2021

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 214 publications
(89 citation statements)
references
References 88 publications
0
87
0
2
Order By: Relevance
“…Many meta-heuristic, heuristic and hybrid algorithms have been proposed, including ACO, GA, PSO, etc. (Tsai and Rodrigues 2014;Kalra and Singh 2015). In particular, workflow scheduling (Masdari et al 2016) has also been investigated, and corresponding scheduling schemes including meta-heuristic-based scheduling, heuristic workflow scheduling, and their hybrid have been extensively studied (Xu et al 2009).…”
Section: Scheduling In Cloud Computingmentioning
confidence: 99%
“…Many meta-heuristic, heuristic and hybrid algorithms have been proposed, including ACO, GA, PSO, etc. (Tsai and Rodrigues 2014;Kalra and Singh 2015). In particular, workflow scheduling (Masdari et al 2016) has also been investigated, and corresponding scheduling schemes including meta-heuristic-based scheduling, heuristic workflow scheduling, and their hybrid have been extensively studied (Xu et al 2009).…”
Section: Scheduling In Cloud Computingmentioning
confidence: 99%
“…In the literature, metaheuristics are widely used to obtain good quality solutions within acceptable execution time and there exist already several surveys on metaheuristics [228,229]. In this section, the survey on metaheuristics will be divided into three parts.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…However, due to the NP-complete nature of the problem, no feasible exact (optimal) solutions are proposed. On the other hand, metaheuristic algorithms which employ iterative strategies to find solutions in a reasonable time [24], have shown their effectiveness for solving a wide range of hard-to-solve combinatorial and multi-objective optimization problems. The most popular metaheuristic algorithms that are presented to solve NP problems are genetic algorithm (GA) [25], simulated annealing (SA) [26], tabu search (TS) [27], particle swarm optimization (PSO) [28], ant colony optimization (ACO) [29] and artificial bee colony optimization (ABC) [30].…”
Section: Related Workmentioning
confidence: 99%