A Two Phase Ant Colony Optimization Method for Flexible Job Shop Scheduling Problems
碩士 === 國立臺北科技大學 === 工業工程與管理研究所 === 95 === Traditional job-shop scheduling problem (JSP) has been investigated more than half centuries. In the literature, many researchers used different approaches to obtain good solution for solving JSP, especially in heuristic algorithm. The heuristic algorithm us...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/467q3s |