A Taboo Search Guided by Ant Colony Optimization for the Job-Shop Scheduling Problem
碩士 === 國立臺灣科技大學 === 工業管理系 === 92 === Job shop scheduling problem is considered as a particularly hard combinatorial optimization problem. Since its complexity, the problem is not appropriate to develop the time-consuming optimization algorithms, such as branch and bound scheme or mixed-integral prog...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73156851740851426502 |