Job-shop scheduling optimization with routing and process plan flexibility by parallel computing
碩士 === 東海大學 === 工業工程與經營資訊學系 === 101 === Today for solving NP-hard scheduling problem, there are many outstanding achievements. In the past, many researchers mainly focused on proposing different heuristic algorithms, but studies of flexible job-shop scheduling based on mathematical planning were rar...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/28089582144503679900 |