| Summary: | 碩士 === 國立臺灣大學 === 工業工程學研究所 === 106 === 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.
|
|---|
