解開放式工廠排程問題之兩層式基因區域搜尋法
碩士 === 國立中興大學 === 資訊科學研究所 === 92 === The open shop scheduling problem is an NP-hard combinational problem and has long attracted much attention. In this thesis, we propose a two layered genetic local search algorithm for this problem. The first layer acts as the global search and the second layer ac...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78587740774391575800 |