政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/31054

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/31054

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113318/144297 (79%)
造訪人次 : 51095331 線上人數 : 1030

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 商學院 > 資訊管理學系 > 學位論文 > Item 140.119/31054

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/31054

題名:	印刷電路板工廠現場排程之研究 A Study of Shop Floor Scheduling on a PCB Manufacturing System
作者:	黃萱懿 Huang, Shuan-yi
貢獻者:	陳春龍 Chen, Chuen-lung 黃萱懿 Huang, Shuan-yi
關鍵詞:	印刷電路板印刷電路板生產工廠流程型工廠排程現場排程禁忌搜尋法 printed circuit board PCB manufacturing flow shop scheduling shop floor scheduling tabu search
日期:	2002
上傳時間:	2009-09-14 09:10:00 (UTC+8)
摘要:	近年來，印刷電路板(printed circuit board, PCB)產業在台灣蓬勃發展，對台灣經濟表現有相當重要的影響；與此同時，產業內各廠商卻因內外環境變異等因素，而面臨日益激烈的競爭壓力。本研究針對產業前段的生產工廠(PCB manufacturing)從管理面探討問題來源，發現各廠商所導入的管理系統(MRP、ERP、SCM等)均缺乏現場排程(shop floor scheduling)功能，因此造成排程結果不具可行性，連帶導致管理系統的績效也未如預期理想。　　為解決該產業所面臨的現場排程問題，本研究透過個案訪談方式，對產業特性深入了解，歸類此類問題為排程領域中的流程型工廠排程問題(flow shop scheduling)。　　在求解過程中，本研究以總延遲時間(total tardiness)最小化為目標，並以禁忌搜尋法(tabu search)作為最佳化過程的演算法。於理論探討後，本研究亦實際建置一套排程系統，並以來自個案工廠的訂單資料實際求解，以評估此系統績效。
參考文獻:	英文文獻　　[01] Maimon, O.Z., Dar-El, E.M., Carmon, T.F., “Set-up saving schemes for printed circuit boards assembly,” European Journal of Operational Research, 70, pp.177-190, 1993 　　[02] Yih, Y., “AN algorithm for hoist scheduling problems,” International Journal of Production Research, 32 (3), pp.501-516, 1994 　　[03] Kim, Yeong-Dae, Lim, Hyeong-Gyu, Park, Moon-Won, “Search heuristics for a flow shop scheduling problem in a printed circuit board assembly process,” European Journal of Operational Research, 91, pp.124-143, 1996 　　[04] Garetti, M., Pozzetti, A., Tavecchio, R., “Production scheduling in SMT electronic boards assembly,” Production Planning & Control, 7(2), pp.197-204, 1996 　　[05] Bhaskar, G., Narendran T.T., “Grouping PCBs for set-up reduction: a maximum spanning tree approach,” International Journal of Production Research, 34(3), pp.621-632, 1996 　　[06] Lin, Fu-Ren, Shaw, M.J., “Scheduling printed circuit board production systems using the two-level scheduling approach,” Journal of Manufacturing Systems, 16(2), pp.129-149, 1997 　　[07] Lim, J.M., “A genetic algorithm for a single hoist scheduling in the printed-circuit-board electroplating line,” Computers & Industrial Engineering, 33 (3-4), pp.789-792, 1997 　　[08] Rajkumar, K., Narendran, T.T., “A bi-criteria model for loading on PCB assembly machines,” Production Planning & Control, 8(8), pp.743-752, 1997 　　[09] Maimon, O.Z., Braha D., “A genetic algorithm approach to scheduling PCBs on a single machine,” International Journal of Production Research, 36 (3), pp.761-784, 1998 　　[10] Mak, R.W.T., Lam, K.K., Gupta, S.R., “A practical algorithm for cyclic hoist scheduling in a PCB manufacturing facility,” Journal of Electronics Manufacturing, 8 (3-4), pp.193-207, 1998 　　[11] Chen, H.X., Chu, C.B., Proth, J.M., “Cyclic scheduling of a hoist with time window constraints,” IEEE transactions on robotics and automation, 14 (1), pp.144-152, 1998 　　[12] Gunther, H.O., Gronalt, M., Zeller, R., “Job sequencing and component set-up on a surface mount placement machine,” Production Planning & Control, 9(2), pp.201-211, 1998 　　[13] Yohanan, A., Raviv, D., “Dispatching in a workstation belonging to a re-entrant production line under sequence-dependent set-up times,” Production Planning & Control, 9(7), pp.690-699, 1998 　　[14] Croci, F., Perono, M., Pozzetti, A., “PCB assembly scheduling through kit concept,” Production Planning & Control, 11(2), pp.141-152, 2000 　　[15] Che A., Chu C.B., Chu F., “Multicyclic hoist scheduling with constant processing times,” IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 18 (1), pp.69-80, 2002 　　[16] Hsieh, J.C., Chang, P.C., Hsu, L.C., “Scheduling of drilling operations in printed circuit board factory,” Computers & Industrial Engineering, 44(3), pp.461-473, 2003 　　[17] Glover, F., “Tabu search-partⅠ,” Operations Research Society of America Journal on Computing, 1(3), pp.190-206, 1989 　　[18] Glover, F., “Tabu search-partⅡ,” Operations Research Society of America Journal on Computing, 2(1), pp.4-32, 1990 　　[19] Glover, F., Laguna, M., “Tabu search,” Kluwer Academic Publishers, 1997 　　[20] Glover, F., “Tabu search fundamentals and uses,” 1994 　　[21] Glover, F., Laguna, M., “Tabu search,” Blackwell Scientific Publications, Oxford, 1993 　　[22] Ben-Daya, M., Al-Fawzan,M., “A tabu search approach for the flow shop scheduling problem,” European Journal of Operational Research, 109, pp.88-95, 1998 　　[23] Wen, U.P., Yeh, I.C., “Tabu search methods for the flow shop sequencing problem,” Journal of Chinese Institute of Engineers, 20, pp.465-470, 1997 　　[24] Moccellin, J.V., Nagano, M.S., “Evaluating the performance of tabu search procedures for flow shop scheduling,” Journal of the Operational Research Society, 49, pp.1296-1308, 1998 　　[25] Geiger, C.D., Kempf, K.G., Uzsoy, R., “A tabu search approach to scheduling an automated wet etch station,” Journal of Manufacturing System, 16, pp.102-116, 1997 　　　　[26] Armentano V.A., Ronconi, D.P., “Tabu search for total tardiness minimization in flow shop scheduling problems,” Computers and Operations Research, 26, pp.219-235, 1999 　　[27] Barnes, J.W., Laguna, M., “A tabu search experience in production scheduling,” Annals of Operation Research, 41, pp.141-156, 1993 中文文獻　　[28] 王彥文，[印刷電路板鑽孔作業生產排程之研究]，元智大學工業工程與管理學系，2002 　　[29] 王立志，[系統化運籌與供應鏈管理]，滄海書局，1999 　　[30] 國立中央大學管理學院ERP中心，[ERP企業資源規劃導論]， 2002 　　[31] 白蓉生，[台灣印刷電路板業之簡介(上)]，電子檢測與品管季刊，第28期，1996年10月，頁74-79 　　[32] 白蓉生，[台灣印刷電路板業之簡介(中)]，電子檢測與品管季刊，第29期，1997年1月，頁82-86 　　[33] 白蓉生，[台灣印刷電路板業之簡介(下)]，電子檢測與品管季刊，第30期，1997年4月，頁72-76 網站資料　　[34] 台灣電路板協會 http://www.tpca.org.tw/
描述:	碩士國立政治大學資訊管理研究所 90356008 91
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0090356008
資料類型:	thesis
顯示於類別:	[資訊管理學系] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML2	292	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋