A New Approach Based On Global Velocity Particle Swarm Optimization To Solve Job-Shop Scheduling Problems, Pso-Vg-Jssp

This paper deals with the Job-shop scheduling problem. We propose to solve this problem by exploiting the Particle Swarm Optimization Global Velocity (PSOVG) algorithm. The PSOVG by its nature focus on the global optimum within a given set of solutions. In this paper a solution is PSO particle, it consists in a possible scheduling solution for the given problem. The PSO-VG-JSSP is a PSO-VGO with a constraints control policy embedded in, allowing to detect and remove non admissible solutions. In this paper the particle representing a non admissible solution is simply removed and replaced by a new random particle.