完整後設資料紀錄
DC 欄位語言
dc.contributor.author朱家德en_US
dc.contributor.authorChu, Jia-Deren_US
dc.contributor.author許錫美en_US
dc.contributor.author洪暉智en_US
dc.contributor.authorHsu,Hsi-Meien_US
dc.contributor.authorHung, Hui-Chihen_US
dc.date.accessioned2014-12-12T02:41:03Z-
dc.date.available2014-12-12T02:41:03Z-
dc.date.issued2013en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT070153348en_US
dc.identifier.urihttp://hdl.handle.net/11536/74640-
dc.description.abstractThis study addresses the allocation of photoresists’ nozzles problem. Wen proposed a mathematical model to solve this problem in 2011. However, we find there are some errors in her mathematical model for some cases and we revised her model in this study. Given the demands of the products in the planning period, the allocation of the photoresist nozzle in previous period and the relationship among each type of photoresist, considered the constraints of machine capacity and the processing quantity of photoresist related to the relationships among each type of photoresist, we formulate a linear integer programming (IP) model for minimizing the non-productive consumption costs we consider in this study to determine the allocation of the photoresist nozzle in the planning period. The non-productive consumption costs include dummy cost of photoresist nozzles, maintenance cost and purge cost. We use LINGO to solve this linear IP mathematical model. The computational time is in exponentially growing with the number of machine and photoresist. In order to reduce the computational time, we propose a heuristic by adding some additional constraints to the IP model to reduce the computational time. Then we verify the accuracy of the heuristic. The worst relative error in testing cases is no more than 4%.zh_TW
dc.description.abstractThis study addresses the allocation of photoresists’ nozzles problem. Wen proposed a mathematical model to solve this problem in 2011. However, we find there are some errors in her mathematical model for some cases and we revised her model in this study. Given the demands of the products in the planning period, the allocation of the photoresist nozzle in previous period and the relationship among each type of photoresist, considered the constraints of machine capacity and the processing quantity of photoresist related to the relationships among each type of photoresist, we formulate a linear integer programming (IP) model for minimizing the non-productive consumption costs we consider in this study to determine the allocation of the photoresist nozzle in the planning period. The non-productive consumption costs include dummy cost of photoresist nozzles, maintenance cost and purge cost. We use LINGO to solve this linear IP mathematical model. The computational time is in exponentially growing with the number of machine and photoresist. In order to reduce the computational time, we propose a heuristic by adding some additional constraints to the IP model to reduce the computational time. Then we verify the accuracy of the heuristic. The worst relative error in testing cases is no more than 4%.en_US
dc.language.isoen_USen_US
dc.subjectnozzle allocationzh_TW
dc.subjectHeuristic Algorithmzh_TW
dc.subjectnozzle allocationen_US
dc.subjectHeuristic Algorithmen_US
dc.title光阻噴管配置模型之構建zh_TW
dc.titleA Revised Model of Photoresist Nozzle Allocationen_US
dc.typeThesisen_US
dc.contributor.department工業工程與管理系所zh_TW
顯示於類別:畢業論文