Integrating Particle Swarm Optimization and Simulated Annealing for Flexible Job Shop Scheduling Problems
碩士 === 國立臺北科技大學 === 工業工程與管理系所 === 94 === Scheduling problems is the most difficult and important problems in the production management. Most scheduling problems are complex combinatorial optimization problems and hard to solve. The job-shop scheduling problem (JSP) is a branch of production scheduli...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/v4de7z |