Particle swarm optimization and opposite-based particle swarm optimizations for scheduling two-agent customer order problem
碩士 === 逢甲大學 === 統計學系 === 104 === We consider two-agent customer order scheduling on multiple machines. There are n orders, each of which consists of m components of different types to be processed on m different machines. Each machine is capable of processing the components of a single type. The dif...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/y46vx4 |