A Literature Review on Solving Job Shop Scheduling Problem with Particle Swarm Optimization (PSO)
| Author(s) | : | Abhijeet Thakur, Dr. V N Bartaria |
| Institution | : | P.G. Scholar |
| Published In | : | Vol. 2, Issue 5 — May 2015 |
| Page No. | : | 505-511 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimalsolution (e.g., makespan), even though the actual requirement of most production systems requires multi-objectiveoptimization. The aim of this paper is to construct a particle swarm optimization (PSO) for an elaborate multi-objectivejob-shop scheduling problem. The original PSO was used to solve continuous optimization problems. Due to the discretesolution spaces of scheduling optimization problems, the authors modified the particle position representation, particlemovement, and particle velocity in this study. The modified PSO was used to solve various benchmark problems. Testresults demonstrated that the modified PSO performed better in search quality and efficiency than traditionalevolutionary heuristics.
Abhijeet Thakur, Dr. V N Bartaria, “A Literature Review on Solving Job Shop Scheduling Problem with Particle Swarm Optimization (PSO)”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 2, Issue 5, pp. 505-511, May 2015.
