Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem
Main:11 Pages
3 Figures
Bibliography:4 Pages
25 Tables
Appendix:20 Pages
Abstract
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 to
View on arXivComments on this paper
