Particle swarm optimization algorithm for single machine total weighted tardiness problem

In this paper we. present a particle swarm optimization algorithm to solve the single machine total weighted tardiness problem. A heuristic rule, the Smallest Position Value (SPV) rule, is developed to enable the continuous particle swarm optimization algorithm to be applied to all classes of sequencing problems, which are NP-hard in the literature. A simple but very efficient local search method is embedded in the particle swarm optimization algorithm. The computational results show that the particle swarm algorithm is able to find the optimal and best-known solutions on all instances of widely used benchmarks from the OR libary.