Solving Job-Shop Scheduling Problems by Boltzmann Genetic Algorithm
碩士 === 國立臺灣科技大學 === 工業管理系 === 97 === Job-shop scheduling problem (JSP), which was wildly used in industries, plays a vital role in manufacture scheduling. Many of the high-tech industries such as semiconductor industries, TFT-LCD industries belong to the Job-shop scheduling. Nevertheless, due to t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63294904306332949902 |