Minimizing makespan in three machine flowshop with machine eligibility
碩士 === 中原大學 === 工業工程研究所 === 95 === This research explores the three-machines flow shop with machine eligibility and the main purpose is to develop the minimum makespan. The approaches include a optimization algorithm and one heuristic algorithm. The optimization algorithm is the branch and bound alg...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69746752715322114145 |