---
id: 20261013-T0-08
title: "Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study"
url: https://ai.daily.yangsir.net/daily/20261013-T0-08
issue_date: 2026-10-13
publish_date: 2026-10-12T04:00:00.000Z
source_name: "arXiv cs.AI"
source_url: https://arxiv.org/abs/2610.12542
---

# Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study

arXiv:2610.12542v1 Announce Type: new Abstract: Monte Carlo Tree Search (MCTS) is often proposed for scheduling directed-acyclic-graph (DAG) workflows, yet most studies never run the comparison that could refute it - giving a much simpler method the same search effort. We run that comparison under a

---

**来源**：[arXiv cs.AI](https://arxiv.org/abs/2610.12542)

**详情页**：https://ai.daily.yangsir.net/daily/20261013-T0-08

---

*智语观潮 · Daily — https://ai.daily.yangsir.net/llms.txt*