Algorithms based on VNS for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties.

Abstract

This work implements and compares four algorithms based on Variable Neighborhood Search (VNS), named RVNS, GVNSf, GVNSr and GVNSrf, for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties (SM-SPETP). Computational experiments showed that the algorithm GVNSf obtained better-quality solutions compared with the other algorithms, including an algorithm found in the literature. The algorithms GVNSr and GVNSrf obtained solutions close to the GVNSf, and outperformed the algorithm of the literature, both with respect to the quality of the solutions and the computational times.