Name
Abstract | ||
|---|---|---|
Workflow computing has become an essential part of many scientific and engineering fields, while workflow scheduling has long been a well-known NP-complete research problem. Major previous works can be classified into two categories: heuristic-based and guided random-search-based workflow scheduling methods. Monte Carlo Tree Search (MCTS) is a recently proposed search methodology with great success in AI research on game playing, such as Computer Go. However, researchers found that MCTS also has potential application in many other domains, including combinatorial optimization, task scheduling, planning, and so on. In this paper, we present a new workflow scheduling approach based on MCTS, which is still a rarely explored direction. Several new mechanisms are developed for the major steps in MCTS to improve workflow execution schedules further. Experimental results show that our approach outperforms previous methods significantly in terms of execution makespan. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1080/09540091.2022.2052265 | CONNECTION SCIENCE |
Keywords | DocType | Volume |
Monte Carlo Tree Search, workflow scheduling, parallel processing | Journal | 34 |
Issue | ISSN | Citations |
1 | 0954-0091 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hok-Leung Kung | 1 | 0 | 0.34 |
| Shu-Jun Yang | 2 | 0 | 0.34 |
| Kuo-Chan Huang | 3 | 0 | 0.34 |