A heuristic algorithm to minimize the total completion time on the m-machine flowshop.
碩士 === 逢甲大學 === 統計與精算所 === 94 === Thesis this studied theme a scheduling problem with a heuristic algorithm to minimize the total completion time on the m-machine flowshop. There are many this kind of references in scheduling problem, the purpose is looking for minimize the total completion time, bu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/77758649675067999825 |