多途程非對稱整備時間及雙顧客類型之最適生產排程研究

A Study on Optimal Production Scheduling Under Asymmetrical Set-Up Time and Multi-Routing for Dual-Type Customers

本研究考量不同產品之生產途程不同，且產品間之轉換需整備時間，然因拆裝困難度導致整備時間不同，因此將非對稱整備時間及生產批量納入生產排程系統中，考慮雙類型之顧客以及緊急插單等功能，使多途程排程系統更符合實務上之需求。本研究提出隨機優化演算法(Random Optimization Algorithm,簡稱ROA)在隨選績效指標下，求解三種績效指標，並比較兩種訂單排序方式(即VIP優先排程法及整合排程法)。結果顯示，使用本演算法求得之排程結果皆優於使用者選擇之初解排程結果，且不同顧客類型之整合排程優於分別排程(即VIP優先排程法)。本研究所提出之隨機優化演算法，可有效提升排程之績效。

This study considers that the production routes of different products are different, and the conversion between products requires set-up time. However, the set-up time is different due to the difficulty of disassembly and assembly, so the asymmetric set-up time and production batch are included in the multi-routing production scheduling system. Due to the practical needs of urgent orders insertion and dual-type customers, this study proposes a Random Optimization Algorithm (ROA) to search for the optimal or near optimal scheduling under three performance indicators on demand and compares the results under two initial scheduling methods. The results show that the scheduling results obtained using the algorithm are better than the initial scheduling results selected by the user, and the integrated scheduling of different customer types is better than the separate scheduling (that is, VIP Priority Scheduling Method). The random optimization algorithm proposed by this research can effectively improve the performance of scheduling.