半導體製造產業作業複雜,製造方面依技術需求有迴流製程作業與設備機台昂貴等特性,在此生產環境中,生產排程規劃複雜許多。派工法則是一種方便且有效地協助排程規劃的常用手法,但於有迴流製程作業之生產環境,常伴隨有瓶頸問題,常用的瓶頸派工法則主要針對特定瓶頸站排程,一旦有新瓶頸發生,原先針對特定瓶頸站的派工法則的效果便立即會受到影響,使得生產績效較差。本研究利用模擬方式建構迴流型流線生產系統,考慮瓶頸漂移現象的發生,在每一個新瓶頸站使用層級式派工法則,決定工單加工的優先順序,而非瓶頸機台使用同族派工法則,以縮短生產週期時間,降低生產週期時間變異,減少設置次數。實驗結果顯示,本研究提出的考慮瓶頸漂移之層級式派工若與同族派工相比較,有顯著的改善,平均生產週期時間最高改善率為17.73%,生產週期變異最高改善率可達66.16%。若瓶頸漂移之層級式派工與特定站之層級式派工相比較,平均生產週期時間最高改善率為8.90%,生產週期變異最高改善率可達57.75%。
The manufacturing processes of semiconductor industry are known to be quite complex, Characteristics of reentrant processes and the costly equipment are present. The production scheduling and planning for the complicated processes in semiconductor industry is a challenging task. Dispatching rule is a convenient and common approach to assist scheduling and planning. However, the characteristics of reentrant processes in semiconductor industry often accompanies with bottlenecks. In the literature, the dispatching rules concerning bottleneck only consider the special bottleneck. When the bottlenecks shift during production cycles, the performance of these dispatching rules may decay. This research applies the simulation approach to construct the reentrant flow shop system and develop dispatching rule to treating shifting bottleneck. We adopt the category-based dispatching rule to set the priority of orders to reduce the mean cycle time, the variance of cycle time and the set up times. As the results, the category-based dispatching rule does show significant improvement compared to family-based dispatching. In different experiment scenarios, the biggest improvement rates of mean cycle time and the variance of cycle time are 17.73% and 66.16% respectively. On the other hand, the category-based dispatching considering the shifting bottleneck also has significant improvement compared to the category-based dispatching with the specific bottleneck. The biggest improvement rates of mean cycle time and the variance of cycle time are 8.9% and 57.75% respectively.