An improved scatter search algorithm for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
Different heuristics are adopted to generate the diversified population. A variable neighborhood search is embedded into the algorithm to improve the trial solutions and the combined solutions. The number of edges by which the two solutions differ from each other is counted to measure the diversification value. The length of reference set of scatter search could be adjusted adaptively to balance the computing time and solving ability. A discrete differential evolution operator is proposed as combination strategy.
improved scatter search total weighted tardiness scheduling variable neighborhood search discrete differential evolution variable-length reference set