2017
DOI: 10.1007/s10586-017-1534-8
|View full text |Cite
|
Sign up to set email alerts
|

Ranging and tuning based particle swarm optimization with bat algorithm for task scheduling in cloud computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 41 publications
0
12
0
Order By: Relevance
“…Owing to large solution space, scheduling is categorized as an NP-hard problem, and consequently, it needs time for finding an optimal answer. In general, the task scheduling problem could be regarded and modeled as a version of the Traveling Salesman Problem (TSP) [8,9] or Vehicle Routing Problem (VRP) [10,11]. In the TSP, a salesman must travel through all the cities and return to the city of origin, provided that it passes through the city once and travels the shortest distance [8].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Owing to large solution space, scheduling is categorized as an NP-hard problem, and consequently, it needs time for finding an optimal answer. In general, the task scheduling problem could be regarded and modeled as a version of the Traveling Salesman Problem (TSP) [8,9] or Vehicle Routing Problem (VRP) [10,11]. In the TSP, a salesman must travel through all the cities and return to the city of origin, provided that it passes through the city once and travels the shortest distance [8].…”
Section: Introductionmentioning
confidence: 99%
“…In general, the task scheduling problem could be regarded and modeled as a version of the Traveling Salesman Problem (TSP) [8,9] or Vehicle Routing Problem (VRP) [10,11]. In the TSP, a salesman must travel through all the cities and return to the city of origin, provided that it passes through the city once and travels the shortest distance [8]. In the VRP, there is also a vehicle that must meet all customers or cities and meet their demand, provided that customer demand should not exceed the capacity of the vehicle and should also travel the shortest possible distance [10].…”
Section: Introductionmentioning
confidence: 99%
“…Valarmathi et al [8] combined the cuckoo algorithm (CS) with the particle swarm optimization algorithm (PSO), resulting in a new intelligent optimization algorithm (CPSO). The combination of the two algorithms improved the overall population convergence rate and made the algorithm easy to implement.…”
Section: Related Workmentioning
confidence: 99%
“…The completion time (CT) is an important factor affecting the cloud computing's quality of service. The CT is equal to the sum of the task execution time (ET) and the task transfer time (TT), as shown in equation ( 7), while the task execution time is shown in equation (8).…”
Section: ) Task Completion Timementioning
confidence: 99%
“…A study is also conducted in (18) for improving the task scheduling for that an enhanced PSO algorithm was proposed. In the existing PSO algorithm the problem of inertia weight assignment was solved by a tuning function based PSO (RTPSO).…”
Section: Literature Reviewmentioning
confidence: 99%