Minimizing the total completion time of parallel machines with machine and chamber eligibilities
碩士 === 中原大學 === 工業與系統工程研究所 === 106 === The goal of this study is to consider the scheduling problem of minimizing the total completion time of machine eligibility and chamber eligibility of parallel machine. This study is aimed to investigate the etch process in semiconductors.Suppose that there are...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/wp829s |