Abstract
The scheduling problem was based on a real welding workshop in a large manufacturing enterprise. A stochastic scheduling problem consisting of m workers and n jobs was dealt with and a mathematic model was developed to minimize maximum expected value and variance of the completion time. In order to solve the problem, Binary Particle Swarm Optimization (BPSO) algorithm was modified, and a dynamic neighborhood strategy, new particle memory updating, and one-dimension optimization method were used to solve two objectives problem. A simulation example was carried out to illustrate that the improved method could efficiently find Pareto front solutions.
| Original language | English |
|---|---|
| Pages (from-to) | 3906-3909+3913 |
| Journal | Xitong Fangzhen Xuebao / Journal of System Simulation |
| Volume | 21 |
| Issue number | 13 |
| State | Published - 5 Jul 2009 |
Keywords
- Binary particle swarm optimization (BPSO)
- Double-objective
- Pareto
- Scheduling
Fingerprint
Dive into the research topics of 'Modeling and simulation of stochastic double-objective scheduling problem in welding workshop'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver