1 / 13

演算法於 LED 封裝最適排程之應用

演算法於 LED 封裝最適排程之應用. 工管專班 指導老師 : 黃悅民 教授 研究生 : N07941021 林俊成. 2007/9/28. outline. LED 封裝流程 Scheduling Problem Problem Formulation 演算法最佳化求解 結語 Reference. LED 封裝流程. 晶片檢驗. 固晶. 點膠. 烘烤. 焊線. 封膠. 螢光粉塗佈. 烘烤. 測試. 包裝. Scheduling Problem.

lynton
Download Presentation

演算法於 LED 封裝最適排程之應用

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 演算法於LED封裝最適排程之應用 工管專班 指導老師:黃悅民 教授 研究生: N07941021 林俊成 2007/9/28

  2. outline • LED封裝流程 • Scheduling Problem • Problem Formulation • 演算法最佳化求解 • 結語 • Reference

  3. LED封裝流程 晶片檢驗 固晶 點膠 烘烤 焊線 封膠 螢光粉塗佈 烘烤 測試 包裝

  4. Scheduling Problem • Flow shop:直線式生產線,每加工站只有單機作業,產品皆需相同的製程程序.如半導體,光電產業排程 • Job Shop:每個工件製程程序不一定相同,有自己的加工順序,排程重點是決定各機台處理工件的加工順序.如模具廠 • Open shop:產品加工路徑無限制,可任意加工.如汽車維修廠作業

  5. Literature Problem formulation Total make-span: (1) δ = the min. difference between the start time of the two jobs A sequence｛p(1),p(2),p(3),…….p (n)｝

  6. Definition: A sequence can always start from job 0,end at jobn+1 Objective function of the problem: For total flow time:

  7. Tardiness: To minimize tardiness:

  8. 演算法最佳化求解 • 基因演算法:設計染色體編碼，藉由交配突變與適應函數的萃取，優化求解 交配 突變 重組

  9. 螞蟻演算法:問題路徑化,藉由費洛蒙濃度,螞蟻搜尋求得最佳路徑解螞蟻演算法:問題路徑化,藉由費洛蒙濃度,螞蟻搜尋求得最佳路徑解

  10. 退火演算法:模仿金屬物質退火過程 加熱到一定溫度 否,重新設定 緩慢冷卻 是否為可行加熱溫度 最佳退火溫度

  11. 粒子群優演算法:模仿鳥(魚)群補食的行為

  12. 結語 • 傳統搜尋法:保證找到最佳解 • 啟發式搜尋:不保證得最佳解 • 文獻多以單一基因演算法,或螞蟻演算法求解 • 擷取FUZZY模糊理論模式與人工免疫演算法結合 求解LED封裝排程問題

  13. Reference • F.T.S.C.CHAN,T.C. WONG AND L.Y.CHAN, Flexible_job-shop_scheduling_problem_under_resource,International Jouurnal of Production Reserch, June, 2006 • Akhilesh Kumar, Anuj Prakash, Ravi Shanker, M.K. Tiwari, Psycho-Clonal algorithm based approach to solve continuous flow shop scheduling problem, Expert System with Applications, 2006 • Ruey-Maw, Shih-Tang Lo, Yueh-Min Huang, Combining competitive scheme with slack neurons to solve real-time job scheduling problem, Expert System with Applications, 2007

More Related