Alexandria Engineering Journal (2021) 60, 5603–5609

H O S T E D BY
Alexandria University

Alexandria Engineering Journal

www.elsevier.com/locate/aej
www.sciencedirect.com

Multi-objective task scheduling optimization in

cloud computing based on fuzzy self-defense
algorithm
Xueying Guo

Civil Aviation University of China, Basic Experiment Center, TianJin 300300, China

Received 27 February 2021; revised 16 April 2021; accepted 18 April 2021

Available online 6 June 2021

KEYWORDS
Fuzzy self-defense algorithm;
Cloud computing;
Multi-objective task;
Scheduling optimization
Abstract A cloud computing multi-objective task scheduling optimization based on fuzzy self-
defense algorithm is proposed. Select the shortest time, the degree of resource load balance and
the cost of multi-objective task completion as the goal of cloud computing multi-objective task
scheduling, establish a mathematical model to measure the effect of multi-objective task scheduling,
and construct the objective function of cloud computing multi-objective task scheduling. The exper-
imental results show that the cloud computing multi-objective task scheduling optimization method
based on fuzzy self-defense algorithm can improve the performance of multi-objective maximum
completion time, deadline violation rate and virtual machine resource utilization.
Ó 2021 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria
University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/
licenses/by-nc-nd/4.0/).

1. Introduction scheduling problem has very significant theoretical and realis-

As a commercial computing pattern, cloud computing pro-
vides three types of resource services, namely, Platform as a
Service (‘‘Paas”), Software as a Service (‘‘SaaS”) and Infras-
tructure as a Service (‘‘IaaS”)[1]. Although cloud computing
provides different services and focuses on various application
programs, it still presents problems in resources and task
scheduling. For the latter problem, the stability of cloud ser-
vice, utilization rate of resources, and operating costs are
related to service quality of users, which is a very significant
part. Therefore, the cloud computing multi-objective task
E-mail address: drxueyingguo@hotmail.com
Peer review under responsibility of Faculty of Engineering, Alexandria
University.
https://doi.org/10.1016/j.aej.2021.04.051
1110-0168 Ó 2021 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University.
This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
tic meanings[2]. In the cloud computing environment, many
dynamic and uncertain factors exist in resources and their
loads. For instance, the load of resource node is related to
the change of time, and the requests of resources also vary
by year, quarter and holiday[3]. These factors may also cause
the waste of resources and reduction of service performance.
If the cloud resource load is too low, resources will be wasted;
instead, if the cloud resource load is very high, the service per-
formance of the system will be reduced.
With regard to the above problems, relevant scholars
within the above fields have made researches on cloud comput-
ing task scheduling. Literature[4] proposes an ant colony opti-
mization task scheduling algorithm, which is established based
on the shortest task completion time, cost and load balance.
According to the task scheduling features of cloud computing,
it defines the cost constraint function of task completion time,
5604
and the load balance function, and also gives the initial pher-
omone. Then, it improves the heuristic function and phero-
mone updating method of ant colony optimization
algorithm. It obtains the objective constraint function through
the ant colony optimization algorithm, further obtaining the
global optimal solution. Then, it simulates the cloudsim, and
compares Min-Min algorithm and ACO algorithm. As demon-
strated in experiment, such algorithm is better than the above
two algorithms in terms of either the task execution time, or
cost, or load balance; Literature[5] proposes a new Q-
learning-based multi-objective optimization task scheduling
algorithm. At the task scheduling stage, the better task
sequence may be obtained through the Q-learning algorithm.
During the virtual machine distribution process, at the begin-
ning, the linear weighting method is used to compute the node
and completion time, optimizing the multi-objective problem.
The objective function is established for the shorter completion
time and smaller total cost. As demonstrated in experiment,
qmts algorithm sorts the tasks based on the Q-learning, which
may obtain shorter sorting time than heft. In addition, after
the optimization of multi-objective scheduling strategy, it
may reduce the total cost and realize the task of makespan.
Ref. [21] introduced a novel antlion algorithm for taking care
of multi-objective task scheduling issues in cloud computing
conditions. In the proposed technique, the multi-target nature
of the issue gets from the need to at the same time limit make-
span while boosting asset use. The proposed algorithm was
upgraded by using elite-based differential advancement as a
neighborhood search strategy to improve its misuse capacity
and to try not to get caught in nearby optima. In another study
in [22], a trust-mindful scheduling methodology for distributed
computing is proposed. This method considers Virtual Machi-
nes’ trust level calculation and undertakings need assurance. In
Ref. [23], a Q-learning-based task scheduling system for
energy-proficient cloud computing is proposed to handle the
issue of energy utilization in both scheduling and assignment
planning. It was shown that the applying of M/M/S lining
model can yield a more limited errand reaction time, which
prompts improved energy effectiveness. In Ref. [24], In this
article, the metaheuristics whale optimization algorithm
(WOA) is utilized for cloud task planning with a multiobjective
streamlining model, targeting improving the presentation of a
cloud framework with given registering assets. On that pre-
mise, a high-level methodology called Improved WOA is pro-
posed for Cloud task scheduling to additionally improve the
searchability of the WOA-based technique. This strategy can
likewise accomplish better execution on framework asset
usage, within the sight of both little and enormous scope
undertakings. In another study, the adaptable assignment
planning issue in a distributed computing framework is con-
centrated by a hybrid discrete artificial bee colony (ABC) cal-
culation in Ref. [25], where the issue is first demonstrated as a
mixture flowshop scheduling issue. An improved variant of the
versatile irritation structure is implanted in the proposed calcu-
lation to adjust the misuse and investigation capacity. A deter-
mination and refreshed methodology are applied to upgrade
the misuse interaction. To additionally improve the abuse
capacities, a profound misuse administrator is planned. An
improved scout honey bee utilized with various neighborhoods
scan strategies for the best food source or the unwanted
arrangement is planned and can expand the intermingling
capacity of the proposed calculation. Planning of client solici-
X. Guo
tations to cloud assets for preparing in a circulated climate is a
well‐known NP‐hard issue. To determine this issue, an energy‐
efficient task‐scheduling calculation is proposed in [26] depen-
dent on best‐worst (BWM) and the Technique for Order Pref-
erence by Similarity to Ideal Solution (TOPSIS) procedure.
Initial, a decision‐making bunch distinguishes the assessment
rules. From that point forward, a BWM cycle is applied to
allot the significance loads for every basis, in light of the fact
that the chose standards have shifted significantly. At that
point, TOPSIS utilizes these weighted models as contributions
to assess and quantify the performance of every other option.
In Ref. [27], an task planning solution is proposed considering
the game hypothesis intended for energy management in cloud
computing. The game hypothesis can more readily facilitate
the dispersion of errands and the conveyance of energy. Like-
wise, The task scheduling model for processing hubs by setting
up a numerical model is proposed in [27] to manage huge
information. Tests show that the calculation can improve
energy planning in distributed computing.
Based on the above background, maximum completion
time, high deadline violation rate and low utilization of virtual
machine resources play an important role in the process of
scheduling optimization for cloud computing multi-objective
tasks. However, so far, these parameters have not been prop-
erly satisfied in a comprehensive solution. Therefore, in order
to improve the performance of cloud computing multi-
objective task in terms of maximum completion time, deadline
violation rate and virtual machine resource utilization, this
paper applies the fuzzy self-defense algorithm to the multi-
objective task scheduling optimization in cloud computing,
designs the cloud computing multi-objective task scheduling
optimization algorithm, and verifies the effectiveness of such
method via the simulation experiment.
2. Design the cloud computing multi-objective task scheduling
optimization method
2.1. Select the goal of cloud computing multi-objective task
scheduling
For the scheduling optimization of cloud computing multi-
objective task, select the shortest time that customers need to
wait, the degree of resource load balance and the cost of
multi-objective task completion as the goal of cloud computing
multi-objective task scheduling[6].
(1) Shortest time that customers need to wait
The computing equation for the shortest time that cus-
tomers need to wait is as follows:
sumðVMj Þ
m X
WFi ¼ max timeij ð1Þ
j¼1
i¼1
In which, timeij refers to the execution time of cloud com-
puting multi-objective task Ti on the virtual machine VMj ;
 
sum VMj refers to the total number of multi-objective tasks
assigned on the virtual machine VMj . The processing time of
the multi-objective task is the ratio of task instruction length
to execution speed of virtual machine VMj , which is repre-
sented as follows:
Multi-objective task scheduling optimization in cloud computing 5605

TAi For the operating cost ctotal required for processing the
timeij ¼ ð2Þ
VAj cloud computing multi-objective task set, assume that the cost
ci for multi-objective task Ti on the virtual machine within the
(2) Degree of resource load balance unit time is ci , then ctotal may be expressed as follows:
The computing equation for the degree of resource load X
p

balance on the virtual machine is as follows: ctotal ¼ ci  ðte ðTi Þ  ts ðTi ÞÞ ð7Þ
sffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
ffi i¼1
P
m
ðVMFj VMFj Þ
2
If the computing performance of multi-objective task on
j¼1
m
the virtual machine is good enough, the value of ci in equation
-¼ ð3Þ (7) is larger[9].
n
However, for the load balance of cloud computing multi-
In which, VMFj refers to the total execution time of the
objective task on the virtual machine, although more multi-
multi-objective task on the virtual machine; VMFj refers to objective tasks are assigned on the virtual machine, the load
the mean execution time of the multi-objective task on the vir- balance effects may not be better[10]. Define the expected exe-
tual machine. cution time of all multi-objective tasks on the virtual machine
as VLj , which is expressed as follows:
(3) Cost of multi-objective task completion !
Xu1
amountðTi Þ
VLj ¼   ð8Þ
The computing equation for the cost of multi-objective task ability Vj
i¼0
completion is as follows:
In which, u refers to the number of multi-objective tasks
X
m
   
costVMj ¼ sum VMj  Vcpuj þ Vramj þ Vbwj ð4Þ assigned on the virtual machine. Define the expected mean exe-
j¼1 cution time of all multi-objective tasks on the virtual machine
as VL, and the computing equation is as shown below:
The equation (4) fully reflects the cost of cloud computing
Pw1
multi-objective task completion on the virtual machine, which j¼0 VLj
is closely connected with central processing unit (CPU), band- VL ¼ ð9Þ
p
width performance and memory of the virtual machine.
Starting from three objectives, namely, shortest time that In which, w refers to the number of multi-objective tasks
customers need to wait, degree of resource load balance and assigned on the virtual machine; p refers to the number of
cost of multi-objective task completion, measure the effect of multi-objective tasks in the cloud computing multi-objective
multi-objective task scheduling and establish the following task set.
mathematical model: Define the load balance variance of multi-objective task
scheduling as BL, which is expressed as follows:
minWF; min-; mincost sffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
Pm ð5Þ P VLj  2
j¼1 aij ¼ 1 aij 2 ½0; 1 i ¼ 1; 2;    ; n w1
s:t:
u
 VL
j¼0
Compute the time of multi-objective task completion by BL ¼ ð10Þ
utilizing the goal of shortest time that customers need to wait. w
In combination with the computing of degree of resource load The smaller the value of BL is, the better the load balance
balance and cost of multi-objective task completion, establish of multi-objective task in the data center is during the process
the mathematical model that measures the effect of multi- of cloud computing multi-objective task scheduling.
objective task scheduling, and select the goal of cloud comput- For the cloud computing users, it is required to spend the
ing multi-objective task scheduling. minimum cost within the shortest time. Therefore, take the
minimum values[11] for ttotal and ctotal . Considering that cloud
2.2. Construct the objective function of cloud computing multi- computing belongs to a commercial service pattern, during the
objective task design of Pareto domination relationship, the time and cost
related to user interests are higher than load balance[12] in
A certain constraint relationship[7] exists among optimized terms of priority. As a result, construct the objective
objectives of multi-objective task in cloud computing. Hence, function of cloud computing multi-objective task, as shown
based on understanding the impact of various steps upon such in equation (11):
8
relationship during the process of cloud computing multi- > minðttotal Þ ¼ minðte ðTlast Þ  ts ðTfirst ÞÞ
>
> p 
objective task scheduling, the optimized multi-objective func- >
> P
>
< minðctotal Þ ¼ min ci  ðte ðTi Þ  ts ðTi ÞÞ
tion[8] of cloud computing multi-objective task scheduling
may be determined.
i¼1
sffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi ! ð11Þ
>
>  2
>
> P
w1 
Assume that, in the cloud computing multi-objective task >
> VLj
set, Tfirst refers to the first processed multi-objective task and : minðBLÞ ¼ min u
 VL =w
j¼0
Tlast refers to the last processed multi-objective task. Then,
the equation (6) may be utilized to compute the processing Define the number of multi-objective tasks in the multi-
time of cloud computing multi-objective task set, namely: objective task set through computing the processing time of
cloud computing multi-objective task set. According to the
ttotal ¼ te ðTlast Þ  ts ðTfirst Þ ð6Þ expected execution time of all multi-objective tasks on the vir-
5606 X. Guo

tual machine, compute the load balance variance of multi-

objective task scheduling, and construct the objective function
of cloud computing multi-objective task scheduling.

2.3. Design the cloud computing multi-objective task scheduling

optimization algorithm

The cloud computing multi-objective task scheduling opti-

mization algorithm is a model established based on the fuzzy
self-defense algorithm. For bird flock foraging, it features
small individual number, simple algorithm structure, and
easily completed procedure[13]. It achieves better effects upon
non-linear optimization and combination optimization, based
on the network optimization and engineering management
[14]. During the design process of particle simulation based
on bird flocks, the particle velocity represents its flying speed
and the position represents the flying direction[15]. It is the
solution that is obtained after the optimization of particle posi-
tion. The population p refers to the aggregate of all particles.
The quality of particle is expressed by the value of fitness func-
tion[16]. The present individual extremum of particle i repre-
sents the historical optimal solution obtained after the
search, and the optimal solution obtained by search in p is rep-
resented by the global optimal solution g. During the particle
iterative replacement process, the computing equation of new
solution[17] search is as shown below:

vi ðt þ 1Þ ¼ xvi ðtÞ þ c1 r1 ðp Best i  xi ðtÞÞ þ c2 r2 ðgBest  xi ðtÞÞ
xi ðt þ 1Þ ¼ xi ðtÞ þ vi ðt þ 1Þ
ð12Þ
In which, vi ðt þ 1Þ represents the speed of multi-objective
task at the iteration t þ 1 and vi ðtÞ represents the speed of Fig. 1 Basic Procedure of Cloud Computing Multi-objective
multi-objective task at the iteration t; x represents the inertia Task Scheduling Optimization Algorithm.
weight; r1 and r2 are random numbers; c1 and c2 are accelera-
tion factors; xi ðt þ 1Þ represents the position of multi-objective
task at the iteration t þ 1; xi ðtÞ represents the position of multi- objective function through the fuzzy self-defense algorithm,
objective task at the iteration t. and finally obtain the global optimal solution of the objective
The basic procedure of cloud computing multi-objective function, realizing the cloud computing multi-objective task
task scheduling optimization algorithm is as shown in Fig. 1. scheduling optimization.
For the cloud computing multi-objective task scheduling
optimization, the fuzzy self-defense algorithm is adopted.
3. Analysis of simulation experiment
The particle and population solutions are the set of optimal
solutions and the high quality new solutions of particles will
be obtained[18]. Therefore, considering the algorithm perfor- On the simulation platform, add the cloud computing multi-
mance, it is required to study how to select the individual objective task scheduling optimization method to the Datacen-
extremum and find the global optimal solution. In general, terBroker category, carry out scheduling according to the
optimal solutions are selected by the degree of crowdedness cloud computing multi-objective task scheduling optimization
and stored by external documents [19]. For the particles in method based on fuzzy self-defense algorithm and literature[4]
external documents, the lower the density is, the easier they method and literature[5] method, and make the quantitative
will be selected. For the density computing of particles in exter- analysis of cloud computing multi-objective task scheduling
nal documents, the grid method shall be adopted to divide the results in terms of maximum completion time, deadline viola-
target space into many small zones. The particle density refers tion rate and utilization of virtual machine resources.
to the number[20] of particles contained in the zone where the Compare the maximum completion time results through
particles are located. setting the number of different cloud computing multi-
In conclusion, first select the shortest time that customers objective tasks. The results are as shown in Fig. 2.
need to wait, the degree of resource load balance and the cost As shown in Fig. 2, with the increase of number of cloud
of multi-objective task completion as the goal of cloud com- computing multi-objective tasks, the maximum completion
puting multi-objective task scheduling, then construct the time of these three methods becomes much longer. Literature
objective function of cloud computing multi-objective task [5] method not only improves the optimal solution search dis-
scheduling, obtain the new solution search equation of the advantage of traditional methods, but also considers the multi-
Multi-objective task scheduling optimization in cloud computing 5607

Fig. 2 Comparison Results of Maximum Completion Time of

Cloud Computing Multi-objective Task Scheduling. Fig. 3 Test Results of Deadline Violation Rate of Multi-
objective Task Scheduling.

objective nature. It has shorter maximum completion time

than Literature[4] method. The Literature[4] method has
slower convergence speed, which results in the longer maxi-
mum completion time. However, the cloud computing multi-
objective task scheduling optimization method based on fuzzy
self-defense algorithm plans the three objectives, namely,
shortest time that customers need to wait, degree of resource
load balance and cost of multi-objective task completion as a
single objective evaluation function, and takes it as the
scheduling goal. As a result, it obtains a better scheduling
effect, with the shortest maximum scheduling completion time.
Compare the deadline violation rate of these three methods
through setting different numbers of cloud computing multi-
objective tasks. The results are as shown in Fig. 3.
As shown in Fig. 3, with the increase of number of cloud
computing multi-objective tasks, a low deadline violation rate
is maintained for both the cloud computing multi-objective
task scheduling optimization method based on fuzzy self-
defense algorithm and Literature[5] method. However, the
deadline violation rate of cloud computing multi-objective task
scheduling optimization method based on fuzzy self-defense
algorithm is lower, namely, about 5%; Literature[4] method
takes the deadline as a constraint condition, so the final
scheduling effect is affected as the multi-objective task schedul-
ing algorithm is not properly optimized. Therefore, the dead- Fig. 4 Comparison Results of Virtual Machine Resource
line violation rate of the design method is the lowest, with a Utilization of Cloud Computing Multi-objective Tasks.
better scheduling effect.
When the number of multi-objective tasks is 100, randomly balanced with regard to the task scheduling, which indicates
select 10 virtual machines and compare and analyze the that the resource utilization rate on the virtual machine is rel-
resource utilization rate of these three methods on the virtual atively adequate, namely, always above 95%. The Literature[5]
machines. The results are as shown in Fig. 4. method adopts the task execution energy consumption and
As shown from the results in Fig. 4, under a certain number task execution cost as the loads among virtual machines. As
of multi-objective tasks, the results obtained with the cloud a result, the resource utilization rate on the virtual machine
computing multi-objective task scheduling optimization is very high, almost above 90%; however, the Literature [4]
method based on fuzzy self-defense algorithm are relatively method adopts the task execution energy consumption and
5608
deadline as the evaluation goal. As a result, it is impossible to
achieve the load balance among virtual machines and the fluc-
tuation of resource utilization rate is greater.
4. Conclusion
A cloud computing multi-objective task scheduling optimiza-
tion based on fuzzy self-defense algorithm is proposed in this
paper. Based on the selection of the goal of cloud computing
multi-objective task scheduling, an objective function of cloud
computing multi-objective task scheduling is constructed.
After solving the objective function with the fuzzy self-
defense algorithm by search, the global optimal solution of
the objective function is obtained, realizing the cloud comput-
ing multi-objective task scheduling optimization. As shown
from the results, this method has better performance in terms
of maximum completion time, deadline violation rate, and uti-
lization of virtual machine resources. Therefore, it has better
applicability. The proposed algorithm plans the three objec-
tives, namely, shortest time that customers need to wait, degree
of resource load balance and cost of multi-objective task com-
pletion as a single objective evaluation function, and takes it as
the scheduling goal. As a result, it obtains a better scheduling
effect, with the shortest maximum scheduling completion time.
Furthermore, as the number of cloud computing multi-
objective tasks increases, a low deadline violation rate is main-
tained for proposed algorithm so that the deadline violation
rate is less than other methods, namely, about 5%. In addition,
under a certain number of multi-objective tasks, the results
obtained with the proposed algorithm are relatively balanced
with regard to the task scheduling, which indicates that the
resource utilization rate on the virtual machine is relatively
adequate, namely, always above 95%.
Declaration of Competing Interest
The authors declare that they have no known competing
financial interests or personal relationships that could have
appeared to influence the work reported in this paper.
Acknowledgment
This paper is funded by the central university basic scientific
research business fee project of Civil Aviation University of
China. The project name is the application research of desktop
cloud in university computer laboratory, and the project num-
ber is 3122018S009.
Availability of data and material
All the data can be requested from the corresponding author
upon reasonable request.
References
[1] M.A. Elaziz, I. Attiya, An improved Henry gas solubility
optimization algorithm for task scheduling in cloud computing,
Artif. Intell. Rev. (2020) 1–39.
[2] D.V. Kunhambu, R.V.S. Balan, An Efficient Multi-Objective
Particle Swarm Optimization Based Ranking System for Cloud
Service Selection, IET Commun. 13 (3) (2018) 297–304.
X. Guo
[3] S.Z. Mirjalili, S. Mirjalili, S. Saremi, et al, Grasshopper
optimization algorithm for multi-objective optimization
problems, Appl. Intell. 48 (4) (2018) 805–820.
[4] Jun-wei Ge, Qiang Guo, Yi-qiu Fang, A Multi-objective
Optimization Algorithm for Cloud Computing Task
Scheduling Based on Improved Ant Colony Algorithm,
Microelectron. Comput. 34 (11) (2017) 63–67.
[5] Zhao Tong, Xiao-mei Deng, Hong-jian Chen, et al, Multi-
objective Task Scheduling Algorithm Based on Reinforcement
Learning in Cloud Envi-ronments, J. Chinese Comput. Syst. 41
(02) (2020) 285–290.
[6] D. Vazquez, M.J. Fernandez-Torres, R. Ruiz-Femenia, et al,
MILP method for objective reduction in multi-objective
optimization, Comput. Chem. Eng. 108 (4) (2018) 382–394.
[7] H. Dkhil, A. Yassine, H. Chabchoub, Multi-objective
optimization of the integrated problem of location assignment
and straddle carrier scheduling in maritime container terminal at
import, J. Oper. Res. Soc. 69 (2) (2018) 247–269.
[8] A. Cheaitou, P. Cariou, Greening of maritime transportation: a
multi-objective optimization approach, Ann. Oper. Res. 273 (1–
2) (2019) 501–525.
[9] Dhiraj, Kumar, Suhasini, et al. Abrasive waterjet machining of
Ti/CFRP/Ti laminate and multi-objective optimization of the
process parameters using response surface methodology. J.
Compos. Mater. 54(13) (2019) 1741-1759.
[10] Haifeng, Jin, Mohammad, et al. Multiobjective Optimization for
Scaffolding Space Planning in Industrial Piping Construction
Using Model-Based Simulation Programming. J. Comput. Civ.
Eng., 2020, 34(1):107-112.
[11] X. Blasco, G. Reynoso-Meza, E.A. Sánchez-Pérez, et al,
Computing Optimal Distances to Pareto Sets of Multi-
Objective Optimization Problems in Asymmetric Normed
Lattices, Acta Appl. Math. 3 (2018) 1–19.
[12] M. Abd Elaziz, S. Xiong, K.P.N. Jayasena, et al, Task
scheduling in cloud computing based on hybrid moth search
algorithm and differential evolution, Knowl.-Based Syst. 169 (1)
(2019) 39–52.
[13] A. Asghari, M.K. Sohrabi, F. Yaghmaee, Task scheduling,
resource provisioning, and load balancing on scientific
workflows using parallel SARSA reinforcement learning
agents and genetic algorithm, J. Supercomput. (2020) 1–29.
[14] Rey Antón, F.D. Igual, Prieto-Matı́as Manuel, Variable intra-
task threading for power-constrained performance and energy
optimization in DAG scheduling, J. Supercomput. 75 (2) (2019)
104–116.
[15] E. Barboza, C. Bastos-Filho, J.F.M. Filho, Adaptive Control of
Optical Amplifier Operating Point using VOA and Multi-
Objective Optimization, J. Lightwave Technol. 37 (16) (2019)
3994–4000.
[16] S.N. Naserabad, A. Mehrpanahi, G. Ahmadi, Multi-Objective
Optimization of HRSG Configurations on the Steam Power
Plant Repowering Specifications, Energy 159 (15) (2018) 277–
293.
[17] A. Stupar, T. Mcrae, N. Vukadinovic, et al, Multi-Objective
Optimization of Multi-Level DC-DC Converters using
Geometric Programming, IEEE Trans. Power Electron. 34
(12) (2019) 11912–11939.
[18] Dkhil, Hamdi, Yassine, et al. Multi-objective optimization of
the integrated problem of location assignment and straddle
carrier scheduling in maritime container terminal at import. J.
Oper. Res. Soc. 2018, 69(2):247-269.
[19] A M A A, B M T R. Multi-objective optimization of reliability–
redundancy allocation problem with cold-standby strategy using
NSGA-II. Reliability Engineering & System Safety, 2018,
172:225-238.
[20] M. Sadeghi, A.S. Mehr, M. Zar, et al, Multi-objective
optimization of a novel syngas fed SOFC power plant using a
downdraft gasifier, Energy 148 (1) (2018) 16–31.
Multi-objective task scheduling optimization in cloud computing
[21] Laith Abualigah, Ali Diabat, A novel hybrid antlion
optimization algorithm for multi-objective task scheduling
problems in cloud computing environments, Cluster
Computing (2020) 1–19.
[22] Rjoub Gaith, Jamal Bentahar, Omar Abdel Wahab,
BigTrustScheduling: Trust-aware big data task scheduling
approach in cloud computing environments, Future
Generation Computer Syst. 110 (2020) 1079–1097.
[23] Ding Ding, Xiaocong Fan, Yihuan Zhao, Kaixuan Kang, Qian
Yin, Jing Zeng, Q-learning based dynamic task scheduling for
energy-efficient cloud computing, Future Generation Computer
Systems 108 (2020) 361–371.
[24] Xuan Chen, Long Cheng, Cong Liu, Qingzhi Liu, Jinwei Liu,
Ying Mao, John Murphy, A woa-based optimization approach
5609
for task scheduling in cloud computing systems, IEEE Syst. J. 14
(3) (2020) 3117–3128.
[25] Jun-qing Li, Yun-qi Han, A hybrid multi-objective artificial bee
colony algorithm for flexible task scheduling problems in cloud
computing system, Cluster Computing 23 (4) (2020) 2483–2499.
[26] Reihaneh Khorsand, Mohammadreza Ramezanpour, An
energy-efficient task-scheduling algorithm based on a multi-
criteria decision-making method in cloud computing, Int. J.
Commun Syst 33 (9) (2020) e4379.
[27] Jiachen Yang, Bin Jiang, Zhihan Lv, Kim-Kwang Raymond
Choo, A task scheduling algorithm considering game theory
designed for energy management in cloud computing, Future
Generation computer systems 105 (2020) 985–992.