A job-shop scheduling algorithm based on hybrid bees algorithm combined with tabu search
碩士 === 國立臺灣科技大學 === 資訊工程系 === 98 === The job-shop scheduling problem is one of the most NP-Hard problems and has attracted many researchers to develop new algorithm based on heuristic or meta-heuristic approach. Many algorithms based on Genetic Algorithm, Particle Swarm Optimization, Ant Colony Opti...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/98841233860316804705 |