A Dual Similar Particle Swarm Optimization Algorithm for Job-Shop Scheduling with Penalty

In production, if manufacturer cannot deliver the goods on due-date, they will be punished according to earliness or tardiness and different products. According to these real situations, a Job-shop scheduling from restrictive due-date with penalty is put forward in this paper, in which the model selectively produce product which can bring maximal profit. Some literatures researching PSO for continuous optimization problems are reported, but studying PSO for discrete scheduling problems is few. In this paper, according to the discrete characteristic of this special JSSP, through the improvement of the option modes of gBest and pBest of PSO algorithm, an effective dual similar particle swarm optimization algorithm (DSPSOA) is presented. Simulation shows the efficiency of the proposed DSPSOA for this special JSSP.