2013
DOI: 10.1007/978-3-319-03859-9_21
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective Parallel Machines Scheduling for Fault-Tolerant Cloud Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…Table 1 presents the parameter settings of the selected scheduling techniques. The parameter values of the ACO are based on [ 29 , 50 ], while the parameter values for the GA are based on [ 24 , 51 ]. The parameter settings for the GBLCA are based on [ 14 ].…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Table 1 presents the parameter settings of the selected scheduling techniques. The parameter values of the ACO are based on [ 29 , 50 ], while the parameter values for the GA are based on [ 24 , 51 ]. The parameter settings for the GBLCA are based on [ 14 ].…”
Section: Methodsmentioning
confidence: 99%
“…GA is a metaheuristic optimization method inspired by the Darwinian evolutionary theory [ 22 , 23 ]. Ga̧sior and Seredyński [ 24 ] put forward a multi-objective parallel machine scheduling technique using GA to increase fault tolerance adaptability in the Cloud computing environment. The approach provides not just a single optimal solution, but a set of results that are not subjugated by one another.…”
Section: Related Workmentioning
confidence: 99%
“…Here table 2 shows some of the selected scheduling algorithm's parameter settings. Parameter settings of Genetic Algorithm (GA) are inspired from [13,14] whereas in case Ant Colony Optimization (ACO) parameters are taken from [15,16] and that of the same from GBLCA are derived from [5].…”
Section: Experimentationmentioning
confidence: 99%
“…Lin and Li (2004) presented a polynomial algorithm for the parallel machine scheduling problem with unit-length jobs. Many people successfully developed the genetic algorithm (GA) for parallel machine scheduling problem with different constraints and objectives, such as minimizing the completion on non-identical parallel machines with fuzzy logic (Alcan and Başlıgil, 2011), workflow balancing with precedence constraints (Rajakumar et al, 2006), minimizing the weighted completion time with precedence (Ramachandra and Elmaghraby, 2006), minimizing the maximum lateness with dynamic job arrivals (Malve and Uzsoy, 2007), and multi-objective (Gasior and Seredynski, 2013). However, there is a noticeable gap between the theory and the practice of scheduling, because some real situations are ignored.…”
Section: Introductionmentioning
confidence: 99%