An improved Monte Carlo Tree Search approach to workflow scheduling
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...
Saved in:
| Main Authors: | Hok-Leung Kung, Shu-Jun Yang, Kuo-Chan Huang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2022-12-01
|
| Series: | Connection Science |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09540091.2022.2052265 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Exploring Monte Carlo Negotiation Search with Nontrivial Agreements
by: Elijah Alden Malaby, et al.
Published: (2021-04-01) -
Optimization of Restricted Container Relocation Using the Monte Carlo Tree Search Method
by: Chaabane Abdelali, et al.
Published: (2025-02-01) -
Optimizing on-demand food delivery with BDI-based multi-agent systems and Monte Carlo tree search scheduling
by: Li Liu, et al.
Published: (2025-07-01) -
Multi-objective synthesis planning by means of Monte Carlo Tree search
by: Helen Lai, et al.
Published: (2025-06-01) -
A Monte Carlo Tree Search-Based Load Balancing Algorithm for 6G Indoor Heterogeneous Networks
by: Guanghui Ma, et al.
Published: (2025-01-01)