最大化投入與產出目標達成率之封裝測試廠生產排程決策問題

本研究探討最大化投入與產出目標達成率之排程問題，產出要最大化，投入同時也要最大化，要如何提升封測廠投入與產出達成率的相關生產排程問題是本研究之動機。本研究以48 pin四方扁平無引線晶片(Quad Flat No-lead，QFN)為例，以限制理論(Theory of Constraints，TOC)中限制驅導式排程方法(Drum-Buffer-Rope，DBR)找出系統之產能限制資源(Capacity Constraints Resource，CCR)，針對其CCR資源設定細部排程稱為鼓排程(Drum)。本研究主要以彈性流程型工廠之平行機台來做鼓排程，將CCR站有多少工單進行剷平廢墟，可將各工單分配到每一部平行機台，以利封測廠能充分運用限制資源。研究結果可發現使用DBR法則大幅減少總完工時間與總延遲時間，也使得最小化投入達到最大化產出，同時也降低線上在製品之數量。

關鍵字

投入產出；封裝測試廠；生產排程；限制驅導式方法；半導體；蒙地卡羅模擬

並列摘要

This study investigates the production scheduling issues of semiconductor assembly and testing factory. In recent years, with the rapid advancement of technology, the demand for semiconductor chips in people's life is gradually increasing, and the major assembly and testing factory are in a situation where the supply is not enough to meet the demand. This study is motivated by the production scheduling issues related to how to improve the input and output performance of semiconductor assembly and testing factory. This study takes a 48-pin Quad Flat No-lead (QFN) chip as an example, and uses the Theory of Constraints (TOC) Drum-Buffer-Rope (DBR) to find out the Capacity Constraint Resource (CCR) of the system, and sets up a detailed schedule called Drum for the CCR resource, so that the assembly and testing factory can fully utilize the constraint resource.

並列關鍵字

Input and Output ； Assembly and Testing Factory ； Production Scheduling ； Drum-Buffer-Rope ； Semiconductor ； Monte Carlo Simulation

參考文獻

Huang, W. T., Chen, P. S., Chen, G. Y. H., & Dang, J. F. (2022). The Dynamic Flow Shop

Google Scholar

Scheduling Problem with JIT Philosophy and Common Due Date. Mathematical

Google Scholar

Problems in Engineering, 2022.

Google Scholar

Liang, Z., Zhong, P., Liu, M., Zhang, C., & Zhang, Z. (2022). A computational efficient

Google Scholar

optimization of flow shop scheduling problems. Scientific Reports, 12(1), 1-16.

Google Scholar

主題瀏覽