Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Boveroux, Laurie, Ernst, Damien, Louveaux, Quentin
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Artificial Intelligence Optimization and Control F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A hybrid solution approach for the Integrated Healthcare Timetabling Competition 2024
di: Guericke, Daniela, et al.
Pubblicazione: (2025)

Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows
di: Özyılmaz, Mustafa Mert
Pubblicazione: (2025)

Instance Configuration for Sustainable Job Shop Scheduling
di: Perez, Christian, et al.
Pubblicazione: (2024)

A Bi-Level Optimization Approach to Joint Trajectory Optimization for Redundant Manipulators
di: Fried, Jonathan, et al.
Pubblicazione: (2024)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
di: Grüne, Christoph, et al.
Pubblicazione: (2023)

CoupleEvo: Evolving Heuristics for Coupled Optimization Problems Using Large Language Models
di: Bömer, Thomas, et al.
Pubblicazione: (2026)

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
di: Donkiewicz, Tim, et al.
Pubblicazione: (2026)

Deep Reinforcement Learning for Flexible Job Shop Scheduling with Random Job Arrivals
di: Tang, Yu, et al.
Pubblicazione: (2026)

Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems
di: Smit, Igor G., et al.
Pubblicazione: (2024)

Online matching and market imbalance
di: Barrientos, Benjamin, et al.
Pubblicazione: (2025)

How Low Can We Go? Minimizing Interaction Samples for Configurable Systems
di: Krupke, Dominik, et al.
Pubblicazione: (2025)

Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints
di: Nicosia, Gaia, et al.
Pubblicazione: (2024)

Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
di: Asadi, Ali, et al.
Pubblicazione: (2025)

The Complexity of Blocking All Solutions
di: Grüne, Christoph, et al.
Pubblicazione: (2025)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
di: Grüne, Christoph, et al.
Pubblicazione: (2024)

Finite horizon stochastic $H_2/H_\infty$ control for continuous-time mean-field systems with Poisson jumps
di: Han, Huimin, et al.
Pubblicazione: (2025)

Sensitivity analysis for linear changes of the constraint matrix of a (mixed-integer) linear program
di: Derval, Guillaume, et al.
Pubblicazione: (2024)

Towards a better approach to the Vehicle Routing Problem
di: Abdoune, Souad, et al.
Pubblicazione: (2025)

An In-depth Study of LLM Contributions to the Bin Packing Problem
di: Herrmann, Julien, et al.
Pubblicazione: (2025)

Non-maximizing policies that fulfill multi-criterion aspirations in expectation
di: Dima, Simon, et al.
Pubblicazione: (2024)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
di: Liao, Chao, et al.
Pubblicazione: (2022)

Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling
di: Li, Sirui, et al.
Pubblicazione: (2025)

Relaxation strength for multilinear optimization: McCormick strikes back
di: Schutte, Emily, et al.
Pubblicazione: (2023)

On the complexity of a maintenance problem for hierarchical systems
di: Schulz, Andreas S., et al.
Pubblicazione: (2023)

Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard
di: Moseley, Benjamin, et al.
Pubblicazione: (2026)

MACI: Multi-Agent Collaborative Intelligence for Adaptive Reasoning and Temporal Planning
di: Chang, Edward Y.
Pubblicazione: (2025)

StarCraft+: Benchmarking Multi-agent Algorithms in Adversary Paradigm
di: Li, Yadong, et al.
Pubblicazione: (2025)

Efficient LP warmstarting for linear modifications of the constraint matrix
di: Derval, Guillaume, et al.
Pubblicazione: (2025)

Blockchain As a Platform For Artificial Intelligence (AI) Transparency
di: Akther, Afroja, et al.
Pubblicazione: (2025)

On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning
di: Walker, Thayne T, et al.
Pubblicazione: (2024)

A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem
di: Festa, Paola, et al.
Pubblicazione: (2024)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
di: Wittwer, David, et al.
Pubblicazione: (2024)

BLISS: Bandit Layer Importance Sampling Strategy for Efficient Training of Graph Neural Networks
di: Alsaqa, Omar, et al.
Pubblicazione: (2025)

Singularity-aware Optimization via Randomized Geometric Probing: Towards Stable Non-smooth Optimization
di: Xu, Ruoran, et al.
Pubblicazione: (2026)

From Kicking to Causality: Simulating Infant Agency Detection with a Robust Intrinsic Reward
di: Xu, Xia, et al.
Pubblicazione: (2025)

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
di: Marica, Edina, et al.
Pubblicazione: (2026)

Incremental Selection of Most-Filtering Conjectures and Proofs of the Selected Conjectures
di: Ngouonou, Jovial Cheukam, et al.
Pubblicazione: (2025)

Approximation algorithms for Job Scheduling with reconfigurable resources
di: Bergé, Pierre, et al.
Pubblicazione: (2023)

Self-Labeling the Job Shop Scheduling Problem
di: Corsini, Andrea, et al.
Pubblicazione: (2024)

Prophet Inequalities: Separating Random Order from Order Selection
di: Giambartolomei, Giordano, et al.
Pubblicazione: (2023)