具有迴流之生產系統,其排程更為動態複雜度,傳統派工法則多以優先權數值決定工單加工的優先順序。本研究以模擬方式建構迴流型流線生產系統模式,於瓶頸機台使用一層級式派工法則,決定工單加工的優先順序,以期縮短生產週期時間,降低生產週期時間變異。本研究層級式派工法則(Category-Based, CB)係先以同族派工法則(family-based, FB)排程,收集各工單到各製程之累積週期時間範圍,及各工作站之在製品工作量範圍,將該範圍分三層級,前者稱緩急值等級,後者稱飢餓值等級。工單依在系統內累積週期時間分類到該緩急值等級別,而工單後續製程之機台依在製品多寡分類到該飢餓值等級別,由當下該工單之緩急值等級與後續製程機台之飢餓值等級,對應優先層級矩陣判斷其優先層級。實驗結果顯示,本研究提出之層級式派工法則組合,可有效縮短生產週期時間與降低生產週期時間。我們嘗試不同緩級值等級與飢餓值等級的界線、產品組合與抵達過程。當實驗之生產系統採FB+CB(433,433)派工法則組合時,平均生產週期時間減少約7.69%,生產週期時間變異減少約31.36%,最大78.27%。
Scheduling of production systems with reentrant characteristic is often more complicate and dynamic. Most of dispatching rules use numerical value as the priority value. In this study, we construct a simulation model for a experimental reentrant production system and a category-based dispatching rule is developed for the bottleneck station. The category-based dispatching rule is based on family-based rule. At first, family-based rule is applied and the range of accumulated cycle time of jobs at bottleneck work station and the WIP of each succeeding work station is collected. Then, we divided the range into three categories. The jobs in the queue of the bottleneck station are classified to one of the three urgent categories according to its accumulated cycle time. Each work station is classified to the three hungry categories according to its current WIP in queue. Each job is assigned one of three priority classes in the priority matrix which is based on the job’s urgent category and the hungry category of job’s succeeding work station. The result indicates that category-based dispatching rule is quite effective in minimizing the mean cycle time and variance of cycle time. We tried for different boundary setting of urgent categories and hungry categories and different product mix scenarios and different inter-arrival times. When the FB+CB(433,433) rule is applied to the experimental production system, the mean cycle time decreases about 7% while the variance of cycle time decreases about 31% to 78%.