DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Morrison, James R. | - |
dc.contributor.advisor | 모리슨, 제임스 | - |
dc.contributor.author | Lee, Jiyoon | - |
dc.date.accessioned | 2019-09-03T02:42:32Z | - |
dc.date.available | 2019-09-03T02:42:32Z | - |
dc.date.issued | 2018 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=733844&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/266268 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업및시스템공학과, 2018.2,[i, 49 p. :] | - |
dc.description.abstract | Recently, research about modeling of semiconductor production process has been actively developed. There are four equipment models which are affine models, exit recursion models, flow line models and detailed models. They know the physics of the production process and predict cycle time, lot residency time and throughput time of the semiconductor production. However, there are certain settings in which these equipment models show bad performance. In addition to that, to endure the randomness of the system, some learning-based models have been considered. In this paper, neural network, random forest, and XGBoost models are newly revised and applied to predict cycle time, lot residency time and throughput time of the semiconductor production. Then, the performance of learning-based models and the equipment models are compared based on mean value, mean absolute error, and percent error. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | semiconductor production process▼aneural network▼arandom forest▼aXGBoost | - |
dc.subject | 반도체 생산 공정▼a모델링▼a인공 신경망▼a랜덤 포레스트▼aXGBoost | - |
dc.title | Numerical study on the applicability of learning methods to equipment models for fab-level simulation | - |
dc.title.alternative | 팹 레벨 시뮬레이션을 위한 모델의 러닝 기법 적용 가능성에 관한 수치적 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :산업및시스템공학과, | - |
dc.contributor.alternativeauthor | 이지윤 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.