2008
DOI: 10.1007/978-3-540-78985-7_13
|View full text |Cite
|
Sign up to set email alerts
|

Particle Swarm Scheduling for Work-Flow Applications in Distributed Computing Environments

Abstract: Recently, the scheduling problem in distributed data-intensive computing environments has been an active research topic. This Chapter models the scheduling problem for work-flow applications in distributed dataintensive computing environments (FDSP) and makes an attempt to formulate the problem. Several meta-heuristics inspired from particle swarm optimization algorithm are proposed to formulate efficient schedules. The proposed variable neighborhood particle particle swarm optimization algorithm is compared w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…Dahal et al (2008) apply a constructive search and VNS to tackle a complex real world workforce scheduling problem. Abraham et al (2008) propose a VNS/PSO hybrid for the scheduling problem in distributed data-intensive computing environments. Liao and Liao (2008) apply an ACO algorithm which uses a VNS as the local search to make it more efficient and effective for scheduling in agile manufacturing.…”
Section: Car Sequencingmentioning
confidence: 99%
“…Dahal et al (2008) apply a constructive search and VNS to tackle a complex real world workforce scheduling problem. Abraham et al (2008) propose a VNS/PSO hybrid for the scheduling problem in distributed data-intensive computing environments. Liao and Liao (2008) apply an ACO algorithm which uses a VNS as the local search to make it more efficient and effective for scheduling in agile manufacturing.…”
Section: Car Sequencingmentioning
confidence: 99%
“…Dahal et al (2008) apply a constructive search and VNS to tackle a complex real world workforce scheduling problem. Abraham et al (2008) propose a VNS/PSO hybrid for the scheduling problem in distributed data-intensive computing environments. Liao and Liao (2008) apply an ACO algorithm which uses a variable neighbourhood search as the local search to make it more efficient and effective for scheduling in agile manufacturing.…”
Section: Car Sequencingmentioning
confidence: 99%
“…Performance(84) EXACT PROBLEM-SPECIFIC(3) [1], [112], [126], EXACT STANDARD(14) [12]- [15], [42]- [44], [69], [117], [169], [174], [218], [236], [241], GENERAL(1) [153], METAHEURIS-TIC(45) [2], [3], [23], [29], [32], [35], [38]- [40], [45], [46], [66], [73], [77], [83], [84], [88], [114], [122]- [124], [130], [133], [141], [143], [145], [160], [161], [170], [175]- [177], [188], [189], [196]- [198], [200], [220], …”
Section: Qa Optimization Strategy Type Constraint Handlingmentioning
confidence: 99%