多產線多段式交期多產品雙屬性生產排程之研究－以某科技工廠為例

A STUDY OF SCHEDULING FOR MULTI-PRODUCTION LINES MULTI-DELIVERY DATES AND MULTI-PRODUCT WITH TWO ATTRIBUTES-TAKING AN IT FACTORY AS EXAMPLE

黃允成(Yun-Cheng Huang) ； 江旻倩(Min-Qian Jiang)

《技術學刊》 37卷2期 (2022/06) Pp. 111-128

摘要

以實際案例公司原始排程系統為基礎，加入產品特性之判斷與計算、處理多段式交期之訂單式生產排程系統之優化，另增系統無限擴充訂單筆數之功能，整合產品資訊，建立產品基本資料表，供使用者快速查詢。亦在考量多產線、多段式交期、多產品、雙屬性之情境下，改善原始生產排程系統缺失，將多項生產評估指標整合成單一指標，含總加班成本、總切線成本、總生產成本、總延遲成本，並以總成本最小化為目標，求解最符合實務之生產排程規劃及生產線組合。將排程結果與原始排程系統之結果進行比較分析，結果顯示，本研究將系統優化後，每年可降低總成本約34,400,000元，平均總成本改善率為7.34%，平均特殊品庫存量改善率為100%，證明本研究之排程方法優於原始排程系統。

關鍵字

生產排程系統 ； 多生產線 ； 多段式交期

並列摘要

Based on the original scheduling system of the actual case company, this study adds the judgment and calculation of product characteristics to search for the optimal production scheduling with multi-delivery dates. In addition, the system expands the order function, integrates product information, and creates a product data sheet for users to quickly query. In the context of multiple production lines, multiple delivery dates, multiple products, and dual attributes, the original production scheduling system was improved, and multiple production evaluation indicators were integrated into a single indicator, including total overtime cost, total cutting-line cost, total production cost, and total delay cost, and with the goal of minimizing total cost, this study solves the optimal production schedule and production line combination. Comparing the results of the scheduling with the results of the original scheduling system, the results show that the optimization of the system in this study can reduce the total cost by about NT$ 34,400,000 per year, with the average total cost improvement rate of 7.34%, and the average special product inventory improvement rate of 100%, which proves that the scheduling method proposed by this study is better than the original scheduling system.

並列關鍵字

production scheduling system ； multi-production lines ； multi-delivery days

參考文獻

Loukil, T. M., J. Teghem, and P. Fortemps. 2007. “A Multi Objective Production Scheduling Case Study Solved by Simulated Annealing.” European Journal of Operational Research 179 (3): 709-722. doi: 10.1016/j.ejor.2005.03.073.

Liu, M., F. Chu, J. He, D. Yang, and C. Chu. 2019. “Coke Production Scheduling Problem: A Parallel Machine Scheduling with Batch Preprocessing and Location Dependent Processing Times.” Computers & Operations Research 104: 37-48. doi: 10.1016/j.cor.2018.12.002.

Wang, H., and B. Alidaee. 2019. “Effective Heuristic for Large-Ccale Unrelated Parallel Machines Scheduling Problems.” Omega 83: 261-274. doi: 10.1016/j.omega.2018.07.005.

Ghedjati, F. 1999. “Genetic Algorithms for the Job-Shop Scheduling Problem with Unrelated Parallel Constraints: Heuristic Mixing Method Machines and Precedence.” Computers & Industrial Engineering 37(1-2): 39-42. doi: 10.1016/S0360-8352(99)00019-4.

Chand, S., H. Singh, and T. Ray. 2019. “Evolving Heuristicsfor the Resource Constrained Project Scheduling Problem with Dynamic Resource Disruptions.” Swarm and Evolutionary Computation 44: 897-912. doi: 10.1016/j.swevo.2018.09.007.