Abstract: In this study, a novel general variable neighborhood search through Q-learning (GVNS-QL) algorithm is proposed to solve the no-idle flowshop scheduling problem with the makespan objective.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback