Tabu Search Method for Flexible Job
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 91 === Nowicki and Smutnicki【1996】reported an improved tabu search method called fast tabu search algorithm to solve job shop scheduling problem. When the definition of move is that x and y are successive operations on certain machine, and x and y are on...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69677365782555015794 |