2013
DOI: 10.1007/978-3-642-36071-8_32
|View full text |Cite
|
Sign up to set email alerts
|

MSSA: A M-Level Sufferage-Based Scheduling Algorithm in Grid Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…For comparisons, we select several benchmark SI optimization algorithms to demonstrate the effectiveness of the ISDT‐MOMVO algorithm in solving OMECMOP 64 . Confirmed by simulation, the third non‐dominated sorting genetic algorithm (NSGA‐III), 63 conventional multi‐objective particle swarm algorithm (MOPSO), 27 MOALO, 35 MSSA 65,66 have high convergence and the iterative solutions approximate the Pareto optimal solution, which has significant advantages in solving challenging practical engineering problems and is suitable for solving nonlinear NP‐hard problems. The fixed parameter values of the above algorithms are shown in Table 1.…”
Section: Simulationsmentioning
confidence: 99%
“…For comparisons, we select several benchmark SI optimization algorithms to demonstrate the effectiveness of the ISDT‐MOMVO algorithm in solving OMECMOP 64 . Confirmed by simulation, the third non‐dominated sorting genetic algorithm (NSGA‐III), 63 conventional multi‐objective particle swarm algorithm (MOPSO), 27 MOALO, 35 MSSA 65,66 have high convergence and the iterative solutions approximate the Pareto optimal solution, which has significant advantages in solving challenging practical engineering problems and is suitable for solving nonlinear NP‐hard problems. The fixed parameter values of the above algorithms are shown in Table 1.…”
Section: Simulationsmentioning
confidence: 99%