Common due date scheduling problem on single machine based on PSO-H algorithm

The classical particle swarm optimization (PSO) is a powerful method to find the minimum for a function optimization problem, especially with a continuous solution space. So far, it is seldom used to solve those problems with discrete features. The problem of scheduling jobs on a single machine against common due dates with respect to earliness and tardiness (E/T) penalties was dealt. At the same time, a PSO strategy integrated with a kind of heuristic algorithm was proposed, where the heuristic information is composed of the processing time and tardiness penalty for each job. It is indicated that such strategy can significantly improve the performance of the solutions. Benchmark testing from OR-Library demonstrates that the algorithm is both effective and efficient in achieving satisfied solutions for scheduling problems with earliness and tardiness penalties.