Effective job shop scheduling through active chain manipulation
Computers and Operations Research
A fast taboo search algorithm for the job shop problem
Management Science
An effective hybrid optimization strategy for job-shop scheduling problems
Computers and Operations Research
An Efficient Genetic Algorithm for Job Shop Scheduling Problems
Proceedings of the 6th International Conference on Genetic Algorithms
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
A new particle swarm optimization for the open shop scheduling problem
Computers and Operations Research
A Pareto archive particle swarm optimization for multi-objective job shop scheduling
Computers and Industrial Engineering
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
Expert Systems with Applications: An International Journal
An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm
Applied Soft Computing
International Journal of Swarm Intelligence Research
An improved intelligent water drops algorithm for solving multi-objective job shop scheduling
Engineering Applications of Artificial Intelligence
Computers and Operations Research
Hi-index | 12.06 |
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most production systems requires multi-objective optimization. The aim of this paper is to construct a particle swarm optimization (PSO) for an elaborate multi-objective job-shop scheduling problem. The original PSO was used to solve continuous optimization problems. Due to the discrete solution spaces of scheduling optimization problems, the authors modified the particle position representation, particle movement, and particle velocity in this study. The modified PSO was used to solve various benchmark problems. Test results demonstrated that the modified PSO performed better in search quality and efficiency than traditional evolutionary heuristics.