生產排程對於製造工廠而言是困難且複雜的,除了要考量工廠內部產能狀況,也要考量外部的環境變化,兩者都會影響到排程計劃,但訂單交期是不允許延遲的,否則會造成成本及商譽損失。若能以一套排程管理系統來有效管理,必能將突發的變異有效控制,即時的更新排程計劃,將損失降到最低。 本研究提出以限制理論DBR排程方法來架構排程管理系統,以各機台的稼動率來決定瓶頸,利用實際資料建立受限產能緩衝(CCR Buffer)及出貨緩衝(Shipping Buffer),瓶頸資源的排程則用螞蟻演算法求解,以總延遲時間最小化為目標式,貪婪法則設定為交期減完工時間之倒數,搭配費洛蒙濃計算機率,以「開發」及「探索」決定路徑,求得細部排程(Drum),根據產能緩衝及細部排程回推投料計劃(Rope),再根據出貨緩衝及細部排程推導出貨計劃,架構一套由投入至產出的排程管理系統。
Production scheduling is an NP-hard problem for manufacturing factories. Both the inside capacity conditions and the outside environmental changes can influence the scheduling planning; however, the goods delivery is not allowed to be delayed, which can cause a serious loss of cost and vendor reputation. Therefore, an effective scheduling system for managing unexpected happenings and updating scheduling plans in time is essential to minimize the company’s loss. The theory of constraints and DBR (Drum Buffer Rope) method was used in the research to frame the scheduling managing system, and the machine utilization rate of each bench was used to decide the bottleneck. Authentic data were used to establish CCR buffer and shipping buffer, and the solution of bottleneck resource scheduling was found by ant algorithm. The minimized total tardiness was set as the target value, and greedy method was applied together with pheromone computing to determine the paths by “developing” and “exploring”, and “drum” was obtained. “Rope” was deduced from CCR buffer and drum, and then the shipping plan was generated from shipping buffer and drum to set up a complete input to output scheduling managing system.