非相關平行加工機台與順序相依整備時間之混合型流程式生產排程

Abstract

本論文研究一種混合型流程式生產排程問題其考慮非相關平行加工機台與順序相依整備時間。根據產線特性，我們提出兩種演算法。在相同的參數設定下，數值分析顯示總體訂單派工演算法在總完工時間，平均總訂單延遲，延遲訂單張數皆優於分群訂單派工演算法。最後討論未來研究延伸方向。

In this paper, we study a two-stage hybrid flow shop scheduling problem where unrelated parallel machines and sequence-dependent setup time are considered.We propose two algorithms based on the characteristics of the production line.Under the same parameter settings, our numerical results show that overall order dispatch (OODA) algorithm outforms clustered order dispatching (CODA) algorithm with respect to the makespan, average total tardiness, and the number of delayed orders.In the end, we discuss the future research directions.