具有順序相依整備時間之流程型製造單元重工排程

本次研究是首次對於具有順序相依整備時間之流程型製造單元重工排程進行研究。單元式製造排程在原始條件下已為一NP-hard問題，加入重工條件使我們的問題能更符合在現實的生產環境，但也使問題求解的複雜度增加。近年來有研究學者觀察人類歷史中帝國與殖民地之資源競爭現象，進而提出了帝國主義競爭演算法(Imperialist Competitive Algorithm, ICA)，其求解的表現也相當優越，但ICA的主要問題在於常陷於區域最佳解。本研究將對ICA的移動方式進行修改，並運用修改型帝國主義演算法求解允許重工之流程型製造單元排程問題，經由實驗比較本修改型帝國主義演算法與原始帝國主義演算法之間的優劣。

關鍵字

帝國主義競爭演算法；重工；單元式製造排程

並列摘要

This thesis examined the flowshop manufacturing cell reworking scheduling problem (FMCRSP) with sequence-dependent family setup times. The present study is among the first to investigate flowshop manufacturing cell scheduling problem with reworking consideration, though it is a necessary production constraint in many real-world applications. In view of the strongly NP-hard nature of this problem, a new nature-inspired optimization method, called Imperialist Competition Algorithm (ICA), was proposed to solve it. In this paper, we compared the revised ICA with basic ICA for the FMCRSP with makespan criterion.

並列關鍵字

Imperialist competitive algorithm(ICA) ； Sequence-dependent family setup times ； SDFSTs ； Flowshop manufacturing cell ； Rework

參考文獻

[1] 李朝源，改良式帝國主義競爭演算法，碩士論文，元智大學資訊管理學系，桃園，2011。

[2] R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: a survey," Annals of Discrete Mathematics, 1979, pp. 287–325.

[3] A. Allahverdi and J. N. D. Gupta and T. Aldowaisan, "A review of scheduling research involving setup considerations," OMEGA, International Journal of Management Science, Vol. 27, No. 2, 1999, pp. 219–239.

[4] S. H. Hendizadeh, T. Y. ElMekkawy and G.G. Wang, "Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times," European Journal of Industrial Engineering, Vol. 1, No. 4, 2007, pp. 391–413.

[5] J. N. D. Gupta and W. P. Darrow, "The two-machine sequence dependent flowshop scheduling problem," European Journal of Operational Research, Vol. 24, No. 3, 1986, pp. 439–446.

國際替代計量

具有順序相依整備時間之流程型製造單元重工排程

未授權

主題瀏覽