Minimizing makespan subject to minimize total absolute deviation of completion time in an identical parallel machine system
碩士 === 中原大學 === 工業與系統工程研究所 === 98 === This study addresses the identical parallel machine scheduling problem in which makespan are minimized subject to minimize TADC, denoted as P||TADC/ΣCmax . An optimal algorithm is first proposed to solve TADC on identical parallel machine, then a binary integer...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13566588065249963538 |