An improved PSO algorithm with genetic and neighborhood-based diversity operators for the job shop scheduling problem
The job shop scheduling problem (JSSP) is an important NP-hard practical scheduling problem that has various applications in the fields of optimization and production engineering. In this paper an effective scheduling method based on particle swarm optimization (PSO) for the minimum makespan problem...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-05-01
|
| Series: | Applied Artificial Intelligence |
| Online Access: | http://dx.doi.org/10.1080/08839514.2018.1481903 |