Solving blocking flowshop scheduling problem with makespan criterion using q-learning-based iterated greedy algorithms

Abstract

This study proposes Q-learning-based iterated greedy (IGQ) algorithms to solve the blocking flowshop scheduling problem with the makespan criterion. Q learning is a model-free machine intelligence technique which is adapted into the traditional iterated greedy (IG) algorithm to determine its parameters mainly the destruction size and temperature scale factor adaptively during the search process. Besides IGQ algorithms two different mathematical modeling tech-niques. One of these techniques is the constraint programming (CP) model which is known to work well with scheduling problems. The other technique is the mixed integer linear programming (MILP) model which provides the mathematical definition of the problem. The introduction of these mathematical models supports the validation of IGQ algorithms and provides a comparison between different exact solution methodologies. To measure and compare the performance of IGQ algorithms and mathematical models extensive computational experiments have been performed on both small and large VRF benchmarks available in the literature. Computational results and statistical analyses indicate that IGQ algorithms generate substantially better results when compared to non-learning IG algorithms. © 2024 Elsevier B.V. All rights reserved.