分派式多階段混合流程型工廠排程

在現今全球化的環境當中，單一工廠已經不能應付所有的需求，產品在不同地點進行各個階段的製造已經是全球的趨勢，因此分派式排程問題越來越受重視；多階段混合流程型工廠排程在實務上相當受到重視，因此，本研究將多階段流程型工廠排程問題擴充至分派式多階段流程型工廠排程問題並進行求解方法的探討。近年來許多文獻皆證明反覆貪婪演算法對於求解流程型工廠排程問題具有優異的績效，因此本研究以反覆貪婪演算法為基礎提出一個修正反覆貪婪演算法，求解分派式多階段混合流程型工廠排程，並以最小化最大完工時間為目標，利用測試題庫進行反覆貪婪演算法與修正反覆貪婪演算法的比較，經由實驗結果證實，本研究所提出之修正反覆貪婪演算法較現存的反覆貪婪演算法為佳。

關鍵字

排程；分派式多階段混合流程型工廠；反覆貪婪演算法

並列摘要

In todays globalized environment, Producing products in different locations is a global trend, therefore the DFSP is increasing attention. In practice, MSHF problem is more impotant then before, The purpose of this study is to solve distributed multi-stage flexible flowshop scheduling problems with Iterated greedy heuristic.In view of the the strongly NP-hard nature of this problem, Iterated greedy heuristic has better experimental results then other heuristics. In this paper, we compared the revised IG with basic ICA for the DMFSP with makespan criterion. As our experimental results, the revised IG is better than the basic ICA.

並列關鍵字

Scheduling ； Distributed multi-stage flexible flowshop ； Iterated greedy heuristic

參考文獻

[8] S. L. Narasimhan and S. S. Panwalkar, "Scheduling in a two stage manufacturing process," International Journal of Production Research, vol. 22, no. 4, pp. 555-564.

[1] 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, vol. 5, 1979, pp. 287-326.

[2] S.M. Johnson, "Optimal two stage and three stage production schedules with setup times included," Naval Research Logistics, vol. 1, 1954, pp. 61-68.

[3] H. G. Campbell, R. A. Dudek, H .L. Smith, "A heuristic algorithm for the n-job M-machine sequencing problem," Management Science, vol.16, 1970, pp. 630-637.

[4] M. Nawaz, E. E. Enscore and I. Ham, "A heuristic algorithm for the m-machine, n-job sequencing problem," Omega-International Journal of Management Science, vol. 11, 1983, pp. 91-95.

國際替代計量

分派式多階段混合流程型工廠排程

未授權

主題瀏覽