Open Shop Scheduling With No-Wait In Process
碩士 === 長庚大學 === 資訊管理學系 === 99 === This research is object to solve open shop scheduling problem with no-wait in process. Using three genetic algorithms and three simulated annealing algorithms to solve the problem and the key indicator is minimum of total completion time. We also observe and compare...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/03900429380530962412 |