Understanding the behavior of Solution‐Guided Search for job‐shop scheduling

This paper investigates reasons behind the behavior of constructive Solution‐Guided Search (SGS) on job‐shop scheduling optimization problems. In particular, two, not mutually exclusive, hypotheses are investigated: (1) Like randomized restart, SGS exploits heavy‐tailed distributions of search cost; and (2) Like local search, SGS exploits search space structure such as the clustering of high‐quality solutions. Theoretical and experimental evidence strongly support both hypotheses. Unexpectedly, the experiments into the second hypothesis indicate that the performance of randomized restart and standard chronological backtracking are also correlated with search space structure. This result leaves open the question of finding the mechanism by which such structure is exploited as well as suggesting a deeper connection between the performance of constructive and local search.