A Distributed Particle Swarm Optimization Zlgorithmfor Flexible Job-hop Scheduling Problem
According to the characteristics of the Flexible job shop scheduling problem the minimum makespan as measures we proposed a distributed particle swarm optimization algorithm aiming to solve flexible job shop scheduling problem. The algorithm adopts the method of distributed ideas to solve problems a...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Harbin University of Science and Technology Publications
2017-06-01
|
| Series: | Journal of Harbin University of Science and Technology |
| Subjects: |