以派工法則求解彈性流程式生產排程問題

Abstract

隨著科技的日新月異，製造業面臨到產品生命週期縮短、需求不確定及產品多樣化的挑戰，因此如何有效的利用生產規劃和現場排程來幫助企業達到較高的訂單達成率和即時反應現場產能一直是製造業努力的目標。常見的汽車製造廠、電子印刷電路板工廠及IC組裝等生產類型都被歸類成彈性流程式生產，這些工廠中的平行機器大都為非等效平行機器，而過去研究中主要利用啟發式演算法解決彈性流程式生產中其平行機器為完全相同的機器問題或是解決單一工作站非等效平行機器的問題，甚少著墨於多階段的非等效平行機器上的問題。 本研究將考慮彈性流程式生產及非等效機器處理工件時間不同的差異，發展三種新的派工法則，並且利用前瞻式方法發展六種前瞻式派工法則，在實驗結果中顯示，三種新的派工法則在最大流程時間、最大延遲時間及平均延遲時間上都有不錯的表現。而六種前瞻式派工法則在上述四種績效指標及在平均延遲工件及平均流程時間上都有良好的表現，實驗結果並顯示當非等效機器差異越大時，其前瞻式派工法則表現越好。

As technology advances, to assist the businesses who are in face with shortened product life cycle, ambiguous demand level, and challenges from the diversification of product offering, the manufacturers have consistently strived for efficient production planning and shop floor scheduling, so that businesses can attain a higher order fulfillment and real time production of shop floor capacity. The automobile manufacture, printed circuit board manufacture and IC packing are categorized as flexible flow shop. There are many unrelated pareall machines at each stage, but in past studies, the focues have been on the indentical machines in the flexible flow shop or the unrelated machines at individual stage by using huristic methods; very few studies discussed about the scheduling for the unrelated machine at mutilple stages. This paper considers the the special features of the unrelated machines in flexible flow shop, then proposes three new dispatching rules and six look-ahead dispatching rules by using the look-ahead method. The results indicate the three new dispatching rules product good results on maximum flow, mean flow time criterias and the six look-ahead dispatching rules product excellent result on all criterias. In addition, we observe the look-ahead dispatching rule will product better when the unrelated machines are more different.