A Cut-Based Heuristic for Solving Bidirectional Single-Row Layout Problem
碩士 === 國立成功大學 === 工業與資訊管理學系 === 104 === A bidirectional single-row machine layout problem is investigated in this thesis. Part enters the system from the input station which is located at one end of the layout, traverses to some workstation based on routing sequence, and leaves the output station at...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/32201369722737563453 |