arrow
返回

A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system

delete2019-12-02
delete100
PRE
AI
L
Li, Jun-qing *
H
Han, Yun-qi
DOI:10.1007/s10586-019-03022-zdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this study, the flexible task scheduling problem in a cloud computing system is studied and solved by a hybrid discrete artificial bee colony (ABC) algorithm, where the considered problem is firstly modeled as a hybrid flowshop scheduling (HFS) problem. Both a single objective and multiple objectives are considered. In multiple objective HFS problems, three objectives, i.e., minimization of the maximum completion time, maximum device workload, and total workloads of all devices, are considered simultaneously. Two different kinds of HFS are considered, i.e., HFS with identical parallel machines and HFS with unrelated machines. In the proposed algorithm, three types of artificial bees are included as in the classical ABC algorithm, i.e., the employed bee, the onlooker bee, and the scout bee. Each solution is represented as an integer string. To consider the problem features, several different types of perturbation structures are investigated to enhance the searching abilities. An improved version of the adaptive perturbation structure is embedded in the proposed algorithm to balance the exploitation and exploration ability. A simple but efficient selection and updated approach are applied to enhance the exploitation process. To further improve the exploitation abilities, a deep-exploitation operator is designed. An improved scout bee employed with different local search methods for the best food source or the abandoned solution is designed and can increase the convergence ability of the proposed algorithm. The proposed algorithm is tested on sets of the well-known benchmark instances, and the performance of the proposed algorithm is verified.
Keyword:
Hybrid flowshop scheduling problem
Artificial bee colony algorithm
Cloud system
Flexible task scheduling
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
论文数:
5.1K
被引数:
7.5K

机构

L
Liaocheng University
学者数:
7.8K
论文数: 6.1K
被引数: 8.8K
S
shandong normal university
学者数:
1.0W
论文数: 8.2K
被引数: 3
引用论文

引用论文

Weed Control in Sericea Lespedeza with Imazethapyr
err2017-01-20
err0
PREAI
errGlenn Wehtje; Jorge A. Mosjidis
err分享
err收藏
Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm
err2016-06-01
err125
PREAI
errWang, Luping; Zhang, Qingfu; Zhou, Aimin; Gong, Maoguo; Jiao, Licheng
err分享
err收藏
The hybrid flow shop scheduling problem
err2010-08-01
err657
errOAAI
errRuiz, Ruben; Antonio Vazquez-Rodriguez, Jose
err分享
err收藏
Sildenafil Improves Immediate Posttransplant Parameters in Warm-Ischemic Kidney Transplants: Experimental Study
err2007-06-01
err0
PREAI
errE. Lledo-Garcia; D. Rodriguez-Martinez; R. Cabello-Benavente; I. Moncada-Iribarren; A. Tejedor-Jorge; E. Dulin; C. Hernandez-Fernandez; J.F. Del Canizo-Lopez
err分享
err收藏
MOMTH: multi-objective scheduling algorithm of many tasks in Hadoop
err2015-04-21
err17
errOAAI
errNita, Mihaela-Catalina; Pop, Florin; Voicu, Cristiana; Dobre, Ciprian; Xhafa, Fatos
err分享
err收藏
学者 查看更多内容