考量有再回流之總延遲時間最小化的兩製程流程式工廠排程問題

Minimizing total tardiness of two processes re-entrant flowshop problem

陳蔓瑄(Man-Hsuan Chen)

指導教授 ： 蘇玲慧

中原大學/電機資訊學院/工業與系統工程研究所/碩士(2013年)

https://doi.org/10.6840/cycu201300738

摘要

本研究以電子紙製程之生產線為對象，擬針對有回流之兩製程流程式工廠排程問題中改善總延遲時間，目標為最小化總延遲時間，利用貪婪演算法改善傳統EDD派工法則及修正型NEH演算法之總延遲時間，研究中之基礎定理與優先順序關係將由相關文獻中衍生。研究中從實驗得知交期寬鬆程度影響工作交換對目標之改善率，工作數影響目標改善率，機台數影響求解時間，總作業次數多寡將影響交期寬鬆因子是否針對目標有改善。
　　透過案例設計與實驗，得到在製程中降低訂單延遲之影響因子，並提供方法比較以供業界做為改善生產方針之參考。

關鍵字

最小化總延遲時間 ； 再回流 ； 兩製程 ； 流程式工廠 ； 貪婪演算法 ； NEH演算法

並列摘要

This research considers the problem of E-paper production line. The goal is to minimize total tardiness on for a two processes re-entrant flowshop scheduling problem. To increase improvement rate of dispatching rule EDD and NEH algorithm by using Greedy algorithm. The research of Fundamental theorem and priority will be derived from related literature. Study from the experiment that tardiness factor impact work exchange period of target, number of jobs affect the target of improvement rate, number of machine affect the solution time, the total work times will affect the tardiness factor whether change factor in target has
improved.
　　Through case design and experiment, the gain in the process of reducing the impact factor of order delay, and provides the method to compare for the industry as the reference of
improving production policy.

並列關鍵字

Re-entrant ； Minimizing total tardiness ； Two processes ； Flowshop ； NEH algorithm ； Greedy algorithm

參考文獻

Agarwal Anurag, Colak Selcuk, and Eryarsoy Enes (2006), 'Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach', European Journal of Operational Research, 169 (3), 801-15.

Baker Kenneth R. (2013), 'Computational results for the flowshop tardiness problem', Computers & Industrial Engineering, 64 (3), 812-16.

Campbell Herbert G., Dudek Richard A., and Smith Milton L. (1970), 'A Heuristic algorithm for the n job m machine sequencing problem', Management Science, 16 (10), 630-37.

Choi S. W., Kim* Y. D., and Lee G. C. (2005), 'Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop', International Journal of Production Research, 43 (11), 2149-67.

Danping Lin and Lee Carman K. M. (2011), 'A review of the research methodology for the re-entrant scheduling problem', International Journal of Production Research, 49 (8), 2221-42.