JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2010, Vol. 40 ›› Issue (5): 12-16.

• Articles • Previous Articles     Next Articles

An optimization approach to grid workflow scheduling using improved SPEA2 algorithm

LI Jin-zhong1, XIA Jie-wu1, ZENG Jin-tao1, WANG Xiang2*   

  1. 1.School of Information Science and Communication, Jinggangshan University, Ji′an 343009, China;
    2. Institute of Technology, Jinggangshan University, Ji′an 343009, China
  • Received:2010-04-23 Online:2010-10-16 Published:2010-04-23

PDF (PC)

2073

Abstract:

A multiobjective optimal grid workflow scheduling algorithm with QoS constraints, named ISPEA2 is proposed. The proposed algorithm, based on the rich-construct abstract grid workflow language (AGWL) grid workflow model, is introduced constraints detection into strength pareto evolutionary algorithm 2 (SPEA2) to optimize the grid workflow scheduling problem. The algorithm overcomes the following drawbacks: only considering DAG structure of grid workflow model, fewer multidimensional QoS parameters, and aggregating the multi-dimensional QoS parameters into a single objective function for optimal scheduling. Decision makers can choose a satisfied solution according to user’s preferences from the produced Pareto optimal solutions. Compared with a grid workflow scheduling algorithm OSPEA2 based on the original SPEA2, the experimental results show that all of Pareto optimal solutions are obtained by ISPEA2 which are non-dominated solutions of satisfying the QoS constraints and better mean result of solutions than OSPEA2.
 

Key words: quality of service (QoS), grid workflow, scheduling, strength pareto evolutionary algorithm 2

[1] PEI Xiaobing, CHEN Huifen, ZHANG Baizhan, CHEN Menghui. Improved bi-variables estimation of distribution algorithms for multi-objective permutation flow shop scheduling problem [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2017, 47(4): 25-30.
[2] DENG Guanlong, YANG Hongyong, ZHANG Shuning, GU Xingsheng. Multi-objective scheduling in no-wait flow shop using a hybridized differential evolution algorithm [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2016, 46(5): 21-28.
[3] ZHANG Fei, GENG Hong-qin. Optimization of job-shop scheduling problem based on chaos particle swarm optimization algorithm [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2013, 43(3): 19-22.
[4] ZHANG Qi-cong1, YANG Gong-ping2*. Study on Agent based simulation of banking queuing system [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2011, 41(4): 68-72.
[5] LI Ming, LI Qi-qiang, GUO Qing-qiang, DING Ran. Scheduling optimization model of refinery processes based on production characteristics [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2010, 40(3): 51-56.
[6] YU Da-yang1, MENG Xiang-xing2, HAN Xue-shan1, ZHAO Jian-guo3. The  solution  space  structure  and  searching  strategies  of  the  integrated-maintenance  scheduling  problem [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2010, 40(2): 130-132.
[7] JIA Mao-Sen, GUO Qiang-Jiang, ZHANG Bin. Algorithm for generalized disjunctive programming model of production scheduling [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2009, 39(6): 53-57.
[8] WU Yin-gui,YUAN Dong-feng,LIU Jian . Packet scheduling algorithm based on a contention window for IEEE 802.11 WLAN [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2007, 37(6): 62-65 .
[9] CHEN Xin,YANG Wen-dong,LU Xun,ZHU Jin-fu . An ant colony algorithm for an aircraft sequencing problem in the airport terminal area [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2007, 37(6): 111-117 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of Journal of Shandong University (Engineering Science)
Supported by Beijing Magtech Co.Ltd