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.
Abstract: This paper introduces an efficient algorithm for finding the dominant generalized eigenvectors of a pair of symmetric matrices. Combining tools from approximation theory and convex ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results