A heuristic based on NEH for the flow shop scheduling problem
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 100 === This study considers a permutation flow shop scheduling problem and explores the total completion time of this problem. Because it is NP-complete problem, the optimal solution can be obtained in a short period of time only in the case of small number of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13118609999037337807 |