Integrating Particle Swarm Optimization and Honey-bee Mating Optimization for Flexible Job Shop Scheduling Problem
碩士 === 國立臺北科技大學 === 工業工程與管理研究所 === 97 === Most scheduling problems are very complex combinatorial optimization problems and hard to solve. The job-shop scheduling problem (JSP) is one of the problems. In the literature, more and more researchers used different heuristic algorithms to solve combinato...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/qhgr3b |