Multiprocessor Scheduling Problem by Wading across Stream Algorithm

被引：0

作者：

Gao, Shang ^{[1
]}

Liu, Yong ^{[2
]}

机构：

[1] Jiangsu Univ Sci & Technol, Sch Comp Sci & Engn, Zhenjiang 212003, Peoples R China

[2] Artificial Intelligence Key Lab Sichuan Prov, Zigong 643000, Peoples R China

来源：

PROCEEDINGS OF THE 2017 7TH INTERNATIONAL CONFERENCE ON EDUCATION, MANAGEMENT, COMPUTER AND SOCIETY (EMCS 2017) | 2017年 / 61卷

关键词：

Random optimization algorithm; Multiprocessor Scheduling problem; wading across stream algorithm;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Wading across Stream Algorithm (WSA) act a solution as a start point, then search several solutions randomly near the start point, and find the best solution of these solutions. This best solution is to take as next start point, and then search several solutions randomly near this start point, and so on. For solving the Multiprocessor Scheduling problem, two methods to selected the initial solution as start solution were given. In order to search neighborhood trial solution, four strategies are put forward.. It is proved that Wading across Stream Algorithm is a simple and effective algorithm.

引用

页码：2009 / 2014

页数：6

共 10 条

[1] Gao S., 2006, Swarm intelligence algorithms and applications
[2] [高尚 Gao Shang], 2005, [计算机工程与应用, Computer Engineering and Application], V41, P72
[3] Guo-hua Gao, 1999, ACTA AUTOMATICA SINI, V25, P425
[4] OPTIMIZATION BY SIMULATED ANNEALING
KIRKPATRICK, S
GELATT, CD
VECCHI, MP
[J]. SCIENCE, 1983, 220 (4598) : 671 - 680
[5] Knuth DonaldE., 1973, The art of computer programming, V3, P1
[6] Lishan Kang, 1994, SIMULATED ANNEALING, P150
[7] Shang Gao, 2014, International Journal of Computers and Applications, V36, P127, DOI 10.2316/Journal.202.2014.4.202-3916
[8] Shang Gao, 2003, MICROCOMPUTER APPL, V19, P9
[9] Wilf Herbert S., 1994, ALGORITHMS COMPLEXIT, P30
[10] Xiaodong Wang, 2001, ALGORITHMS DESIGN AN, P102

← 1 →