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

**Published:** October 12, 2026
**Author:** Yuyu Zhang
**Source:** arXiv — cs.AI
**Language:** en-US
**HTML:** https://aiqazaqstan.com/en/articles/equal-budget-monte-carlo-tree-search-versus-randomized-restart-list-sche

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…

> From the original source: **arXiv — cs.AI**
> [Read full article at arXiv — cs.AI](https://arxiv.org/abs/2610.12542)

**Tags:** #arXiv

---

*AI Qazaqstan — non-commercial informational portal about AI in Kazakhstan. Machine translations and summaries are AI-generated.*