Hande OztopMehmet Fatih TasgetirenLevent KandillerQuan-Ke PanTasgetiren, Mehmet FatihOztop, HandeKandiller, LeventPan, Quan-Ke2025-10-062020978-1-7281-6929-3978172816929310.1109/CEC48606.2020.91855562-s2.0-85092030797https://gcris.yasar.edu.tr/handle/123456789/6996https://doi.org/10.1109/CEC48606.2020.9185556In 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. In the outer loop of the GVNS-QL insertion and exchange operators are used to shaking the permutation. On the other hand in the inner loop of variable neighborhood descent procedure variable iterated greedy and variable block insertion heuristic algorithms are employed with two effective insertion local search procedures. The proposed GVNS-QL defines the parameters of the algorithm using a Q-learning mechanism. The developed GVNS-QL algorithm is compared with the traditional iterated greedy (IG) algorithm using the well-known benchmark set. The comprehensive computational experiments show that the GVNS-QL outperforms the traditional IG algorithm. The results of the IG and GVNS-QL algorithms are also compared with the current best-known solutions reported in the literature. The computational results show that the proposed GVNS-QL algorithm improves the current best-known solutions for 104 out of 250 instances.Englishinfo:eu-repo/semantics/closedAccessno-idle flowshop scheduling problem, makespan, general variable neighborhood search, Q-learning, variable iterated greedy, variable block insertionITERATED GREEDY ALGORITHM, DEPENDENT SETUP TIMES, DIFFERENTIAL EVOLUTION, MAKESPAN, OPTIMIZATION, TARDINESS, MINIMIZE, MACHINE, HEURISTICS, MAXMakespanVariable Block InsertionNo-Idle Flowshop Scheduling ProblemQ-learningVariable Iterated GreedyGeneral Variable Neighborhood SearchConference Object