未來研究方向

而最直接可以延伸的未來研究方向就是在搭配不同的進化演算法或混合進 化演算法，進而了解此新舊表達法的現象是不是在所有的進化演算法之中都有一 樣的結果。

未來研究也可以經由本研究的分析來針對本研究的排程問題做相關的調整。

在本研究的分析中，可以發現此問題有「主導區段」的現象發生；因此可以著重 在先搜尋主導區段之後，在搜尋其他區段的排序。然而在此流程上必須考慮搜尋 主導區段時，其他區段該如何調整，而這部分可做為未來研究的重要議題。

而針對不同的進化演算法搭配 Sold時，也有不同的研究方向。在禁忌搜尋法 中，可以設計避免迴圈發生的演算流程，來使其解品質可以獲得改善。而在基因 演算法中，可考慮如何設計流程可以避免同質化的產生，進而改善解品質。最後

64

在蟻群最佳化進化演算法中，如何以避免掉入區域最佳解為研究的重點。

而本研究以一個順序相依整備時間且固定序列之流線型單元製造系統的排 程規劃問題為案例做研究。未來可以針對不同的問題，設計解的許多不同種新表 達法，將可能會發現較好的績效表現，而不需要使用更複雜的進化演算法進化機 制。

65

參考文獻

英文文獻

Brindle, A., Genetic algorithms for function optimization. Doctoral dissertation, University of Alberta, Edmonton, Canada. Unpublished doctoral dissertation;

1981.

Chan, F.T.S., Choy, K.L., Bibhushan, A genetic algorithm-based scheduler for multiproduct parallel machine sheet metal job shop. Expert Systems with Applications; 2011; 38: 8703-8715.

Chang, P.C., Chen, S.H., Fan, C.Y., Mani, V., Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems.

Annals of Operations Research; 2008: 1-15.

Chen, C.F., Wu M.C., Li Y.H., Tai P.H., Chiou C.W., A comparison of two chromosome representation schemes used in solving a family-based scheduling problem. Robotics and Computer-Integrated Manufacturing; 2012:

doi:10.1016/j.rcim.2012.04.009.

Cordeau, J.F., Maischberger M., A parallel iterated tabu search heuristic for vehicle routing problems. Computers & Operations Research; 2012; 39: 2033-2055.

Demir, L., Tunalı, S., Eliiyi, D.T., An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines. Computers &

Operations Research; 2012; 39: 1477-1486.

Dorigo, M., Gambardella, L.M., Ant colony system: A cooperative learning approach to the traveling salesman problem. Evolutionary Computation, IEEE Transactions on; 2002; 1(1): 53-66.

Dorigo, M., Maniezzo, V., Colorni, A., Ant system: optimization by a colony of cooperating agents. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on; 2002; 26(1): 29-41.

Franca, P.M., Gupta, J.N.D, Mendes, A.S., Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers and Industrial Engineering; 2005; 48 (3): 491–506.

66

Gajpal, Y., Rajendran, C., An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics; 2006; 101(2): 259-272.

Glover, F., Tabu search Part I. ORSA Journal of Computing; 1989; 1: 190-206.

Glover, F., Tabu search Part II. ORSA Journal of Computing; 1990; 2: 4-32.

Hendizadeh, S.H., Faramarzi, H., Mansouric, S.A., Gupta J.N.D., ElMekkawy T.Y., Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times. International Journal of Production Economics;

2008; 111 (2): 593–605.

Holland J.H., Adaptation in Neural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan; 1975.

Kim, Y.K., Kim, J.Y., Kang, S.S., A Tabu search Approach for Designing a Non-Hierarchical Video-on-Demand Network Architecture. Computers industrial Engineering; 1997; 33 (3-4): 837-840.

Lin, S.W., Ying, K.C., Lee, Z.J., Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times.

Computers & Operations Research; 2009a; 36: 1110-1121.

Lin, S.W., Gupta, J.N.D., Ying, K.C., Lee, Z. J., Using simulated annealing to schedule a flowshop manufacturing cell with sequence dependent family setup times. International Journal of Production Research; 2009b; 47 (12): 3205-3217.

Logendran, R., deSzoeke, P., Barnard, F., Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics;

2006; 102 (1): 66–86.

Merkle, D., Middendorf, M., On solving permutation scheduling problems with ant colony optimization. International Journal of Systems Science; 2005; 36(5):

255-266.

M’Hallah, R., Al-Khamis, T., Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic. International Journal of Production

67

Research; 2011; 1: 1-26.

Reddy, V., Narendran, T.T., Heuristics for scheduling sequence-dependent set-up jobs in flow line cells. International Journal of Production Research; 2003; 41 (1):

193–206.

Schaller, J.E., Gupta, J.N.D., Vakharia, A.J., Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research; 2000; 125 (2): 324–339.

Syswerda, G., Uniform crossover in genetic algorithms, in: J.D. Schaffer (Ed.), Proceeding of the 3rd International Conference on Genetic Algorithms; 1989: 2–

9.

Tavakkoli-Moghaddam, R., Taheri, F., Bazzazi, M., Izadi, M., Sassani, F., Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers

&Operations Research; 2009; 36: 3224-3230.

Wen, U.P., Huang, A.D., A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem. European Journal of Operational Research;

1996; 88: 563-571.

Yagmahan, B., Yenisey, M. M. A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Systems with Applications; 2010; 37(2):

1361-1368.

中文文獻

戴邦豪，「應用混合式染色體表達法漁具順序相依家族整備時間之流線型製造單 元排程」，國立交通大學工業工程與管理學系，碩士論文，2010。

林耿漢，「以塔布搜尋法求解流線型製造單元排程」，國立交通大學工業工程與 管理學系，碩士論文，2011。

68

李奕勳，「以蟻群最佳化演算法求解流線型製造單元排程」，國立交通大學工業 工程與管理學系，碩士論文，2011。

巫木誠，「以進化搜尋演算法求解流線群組排程問題」，國科會專題研究計畫申請 書，計畫編號：99-2221-E-009-110-MY3，2010。