The problem considered in this paper involves a set of independent jobs on unrelated parallel machines with sequence-dependent setup times and unequal ready times, and the objective is to minimize the weighted number of tardy jobs. Iterated hybrid metaheuristic algorithms are proposed to address this problem. The algorithms begin with effective initial solution generators to generate initial feasible solutions; then, hybrid metaheuristics are applied to improve the initial solutions, integrating the principles of the variable neighborhood descent approach and tabu search. If the search becomes trapped at a local optimum, a perturbation operator is developed to help the search escape. To evaluate the performance of the suggested algorithms, heuristic rules and iterated local search algorithms are examined and compared. Computational experimental results show that the proposed algorithms outperform the other heuristics.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.