Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem

The Flexible Job-Shop Scheduling Problem (FJSSP) is an NP-hard combinatorial optimization problem, with several application domains, especially for manufacturing purposes. The objective is toefficiently schedule multiple operations on dissimilar machines. These operations are gathered into jobs, and operations pertaining to the same job need to be scheduled sequentially. Different methods have been previously tested to solve this problem, such as Constraint Solving, Tabu Search, Genetic Algorithms, or Monte Carlo Tree Search (MCTS). We propose a novel algorithm derived from the Generalized Nested Rollout Policy Adaptation, developed to solve the FJSSP. We report encouraging experimental results, as our algorithm performs better than other MCTS-based approaches, even if makespans obtained on large instances are still far from known upper bounds.

@article{kobrosly2025_2505.08451,
  title={ Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem },
  author={ Lotfi Kobrosly and Marc-Emmanuel Coupvent des Graviers and Christophe Guettier and Tristan Cazenave },
  journal={arXiv preprint arXiv:2505.08451},
  year={ 2025 }
}