Multiprocessor Scheduling Problem by Wading across Stream Algorithm

DOI

10.2991/emcs-17.2017.378How to use a DOI?

Keywords

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

Abstract

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.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Shang Gao
AU  - Yong Liu
PY  - 2017/03
DA  - 2017/03
TI  - Multiprocessor Scheduling Problem by Wading across Stream Algorithm
BT  - Proceedings of the 2017 7th International Conference on Education, Management, Computer and Society (EMCS 2017)
PB  - Atlantis Press
SP  - 2009
EP  - 2014
SN  - 2352-538X
UR  - https://doi.org/10.2991/emcs-17.2017.378
DO  - 10.2991/emcs-17.2017.378
ID  - Gao2017/03
ER  -