A Hybrid Artificial Bee Colony Algorithm to Solve Multi-objective Hybrid Flowshop in Cloud Computing Systems

被引:6
作者
Li, Jun-qing [1 ,2 ]
Han, Yu-yan [1 ]
Wang, Cun-gang [1 ]
机构
[1] Liaocheng Univ, Coll Comp Sci, Liaocheng 252059, Peoples R China
[2] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110819, Liaoning, Peoples R China
来源
CLOUD COMPUTING AND SECURITY, PT I | 2017年 / 10602卷
基金
美国国家科学基金会;
关键词
Hybrid flow shop scheduling problem; Artificial bee colony algorithm; Cloud system; Multi-objective optimization; SHOP SCHEDULING PROBLEMS; PARTICLE SWARM OPTIMIZATION; TOTAL FLOWTIME MINIMIZATION; MULTIPROCESSOR TASKS; DEDICATED MACHINES; FLEXIBLE FLOWSHOP; GENETIC ALGORITHM; IMMUNE ALGORITHM; 2-STAGE; MAKESPAN;
D O I
10.1007/978-3-319-68505-2_18
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes a local search enhanced hybrid artificial bee colony algorithm (LABC) for solving the multi-objective flexible task scheduling problem in Cloud computing system. The task scheduling is modeled as a hybrid flow shop scheduling (HFS) problem. In multiple objectives HFS problems, three objectives, i.e., minimum of the makespan, maximum workload, and total workload are considered simultaneously. In the proposed algorithm, each solution is represented as an integer string. A deep-exploitation function is developed, which is used by the onlooker bee and the best food source found so far to complete a deep level of search. The proposed algorithm is tested on sets of the well-known benchmark instances. Through the analysis of experimental results, the highly effective performance of the proposed LABC algorithm is shown against several efficient algorithms from the literature.
引用
收藏
页数:13
相关论文
共 51 条
[1]   Using ant colony optimization to solve hybrid flow shop scheduling problems [J].
Alaykyran, Kemal ;
Engin, Orhan ;
Doyen, Alper .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 35 (5-6) :541-550
[2]   Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach [J].
Babayan, A ;
He, D .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (04) :777-799
[3]   A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic [J].
Behnamian, J. ;
Ghomi, S. M. T. Fatemi ;
Zandieh, M. .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (08) :11057-11069
[4]   Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility [J].
Buyya, Rajkumar ;
Yeo, Chee Shin ;
Venugopal, Srikumar ;
Broberg, James ;
Brandic, Ivona .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2009, 25 (06) :599-616
[5]   Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints [J].
Chamnanlor, Chettha ;
Sethanan, Kanchana ;
Gen, Mitsuo ;
Chien, Chen-Fu .
JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (08) :1915-1931
[6]   SCHEDULING FLEXIBLE FLOW SHOPS WITH NO SETUP EFFECTS [J].
CHANG, SC ;
LIAO, DY .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1994, 10 (02) :112-122
[7]   Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm [J].
Cho, Hang-Min ;
Bae, Suk-Joo ;
Kim, Jungwuk ;
Jeong, In-Jae .
COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) :529-541
[8]   Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks [J].
Chou, Fuh-Der .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) :137-145
[9]   A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling [J].
Deng Guanlong ;
Xu Zhenhao ;
Gu Xingsheng .
CHINESE JOURNAL OF CHEMICAL ENGINEERING, 2012, 20 (06) :1067-1073
[10]   New multi-objective method to solve reentrant hybrid flow shop scheduling problem [J].
Dugardin, Frederic ;
Yalaoui, Farouk ;
Amodeo, Lionel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (01) :22-31