On 20 synthetic large job shop instances, the best MCTS configurations achieved lower mean weighted completion times than the authors' OR-Tools constraint programming model.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem
On 20 synthetic large job shop instances, the best MCTS configurations achieved lower mean weighted completion times than the authors' OR-Tools constraint programming model.