Optimization of pick-and-place in die attach process using a genetic algorithm
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, You-Jin | - |
dc.contributor.author | Ahn, Gilseung | - |
dc.contributor.author | Hur, Sun | - |
dc.date.accessioned | 2021-06-22T11:43:01Z | - |
dc.date.available | 2021-06-22T11:43:01Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2018-07 | - |
dc.identifier.issn | 1568-4946 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/5809 | - |
dc.description.abstract | The entire semiconductor manufacturing process can be largely divided into two sequential subprocesses that are commonly referred to as front-end and back-end production. Both production processes involve many complicated and elaborate steps for wafer fabrication, probe testing and sorting, assembly, final test, etc. The front-end process refers to wafer fabrication process, whereas the back-end process refers to the assembly, packaging, and testing of individual semiconductor devices. Once the front-end process is complete, the wafers are transferred to the back-end process in order to facilitate its integration into electronic devices and to take final performance test. In back-end production process, based on quality and location information of individual chip (die) derived from the EDS process, only good semiconductor chips (dies) are individually picked up by an automatic robot arm and then attached to the support structure (e.g., the lead frame) on a strip. This process is called die attach process. In order to improve the production efficiency of die attach process, it is necessary to evaluate various robot arm operation methods (rules) and then to provide the most efficient operation method since the total transfer distance (or total transfer time) considerably depends on the robot arm operation methods as well as the distribution of good chips on wafers. Thus, in this research, a pick-and-place problem of the die attach process is mathematically formulated and several transfer methods are compared. (C) 2016 Elsevier B.V. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Optimization of pick-and-place in die attach process using a genetic algorithm | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hur, Sun | - |
dc.identifier.doi | 10.1016/j.asoc.2016.12.050 | - |
dc.identifier.scopusid | 2-s2.0-85009724097 | - |
dc.identifier.wosid | 000433155300063 | - |
dc.identifier.bibliographicCitation | APPLIED SOFT COMPUTING, v.68, pp.856 - 865 | - |
dc.relation.isPartOf | APPLIED SOFT COMPUTING | - |
dc.citation.title | APPLIED SOFT COMPUTING | - |
dc.citation.volume | 68 | - |
dc.citation.startPage | 856 | - |
dc.citation.endPage | 865 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.subject.keywordPlus | GRAVITATIONAL SEARCH ALGORITHM | - |
dc.subject.keywordPlus | MACHINE | - |
dc.subject.keywordPlus | TIME | - |
dc.subject.keywordPlus | OPERATIONS | - |
dc.subject.keywordAuthor | Semiconductor | - |
dc.subject.keywordAuthor | Back-end manufacturing | - |
dc.subject.keywordAuthor | Die attach process | - |
dc.subject.keywordAuthor | Robot arm | - |
dc.subject.keywordAuthor | Integer programming | - |
dc.subject.keywordAuthor | Heuristic approach | - |
dc.identifier.url | https://www.scopus.com/record/display.uri?eid=2-s2.0-85009724097&origin=inward&txGid=61ee921d2de9dd3f125f1795bae813ef | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.