未來方向

首先，由於在本問題中未考慮測試項目可能會測試失敗，而導致要重測或找出測 試失敗原因所額外花費時間的機率，所以將問題簡化成需要測完該優先權中所有測試

項目，才能進行下一階段優先權的測試，其目的是預留如果測試失敗後所要花費的驗

證時間。在未來會將測試項目可能會測試失敗的機率考慮進來，並只預留該測試項目 重測的時間，可使得每段優先權的測試項目可以接續測試，以縮短總測試時間。

另外會將本研究所使用的多目標遺傳演算法及數學模型加以改良，使得非支配解 集合分佈情形更加均勻，以及更快速、準確地找出更多組的非支配解，並應用在其它 類型的多台平行機台上。

參考文獻 參考文獻 參考文獻 參考文獻

[1] J. Blazewicz, J. K. Lenstra and A. Kan, "Scheduling subject to resource constraints:

Classification and complexity," Discrete Applied Mathematics, vol. 5, pp. 11-24, 1983.

[2] B. Chen, C. N. Potts and G. J. Woeginger, "A review of machine scheduling:

Complexity, algorithms and approximability," Handbook of Combinatorial Optimization, vol. 3, pp. 21-169, 1998.

[3] S. Eilon., “Production Scheduling”, in K.B. Haley, (ed.), Operation Research ’78, pp.

237-266, 1979.

[4] T.C.E. Cheng, and C.C.S. SIN, ”A State-of -the-Art Review of Parallel-Machine Scheduling Research”, European Journal of Operational Research, Vol. 47, pp. 271-292, 1990

[5] T. Tozawa, R. Cheng and M. Gen, "Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms," Computers & Industrial Engineering, vol. 29, pp. 513-517, 1995.

[6] L. Min and W. Cheng, "A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines," Artificial Intelligence in Engineering, vol. 13, pp. 399-403, 1999.

[7] I. A. Chaudhry, S. Mahmood and R. Ahmad, "Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA," Lecture Notes in Engineering and Computer Science, vol. 2185, 2010.

[8] P-C. Hu, Online research data set available at

http://sparc.nfu.edu.tw/~pchu/research_data.htm.

[9] V. A. Armentano and D. S. Yamashita, "Tabu search for scheduling on identical parallel machines to minimize mean tardiness," Journal of Intelligent Manufacturing, vol. 11, pp. 453-460, 2000.

[10] M. W. Park and Y. D. Kim, “Search heuristics for a parallel machine scheduling problem with ready times and due dates”, Computers & Industrial Engineering, vol. 33, pp. 793-796, 1997.

[11] A. Allahverdi, J. N. D. Gupta, T. Aldowaisan, “A review of scheduling research involving setup considerations”, Omega, Vol. 27, pp. 219-239, 1999.

[12] S. Panwalkar, R. Dudek and M. Smith, "Sequencing research and the industrial

scheduling problem,” in Symposium on the Theory of Scheduling and its Applications, pp. 29–38, 1973.

[13] J. D. Marsh and D. C. Montgomery, “Optimal Procedures For Scheduling Jobs With Sequence-Dependent Changeover Times On Parallel Processors,” AIIE Technical Papers, Vol.1, 279-286, 1973.

[14] K. Tan and R. Narasimhan, "Minimizing tardiness on a single processor with sequence dependent setup times: a simulated annealing approach," Omega, Vol.25, pp.619-634, 1997.

[15] R. Ruiz and C. Maroto, “A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility,” European Journal of Operational Research, Vol. 169, pp. 781-800, 2006.

[16] P. A. Rubin and G. L. Ragatz, “Scheduling in a Sequence Dependent Setup Environment with Genetic Search,” Computers & operations research, Vol.22, pp.85-99, 1995.

[17] T. P. Hong, P. C. Sun and S. S. Jou, “Evolutionary computation for minimizing makespan on identical machines with mold constraints,” WSEAS Transactions on Systems and Control, Vol. 4, pp. 339-348, 2009.

[18] 葉子嘉,“整備資源有限下之平行機台排程方法研究,” 成功大學工業與資訊 管理學系碩士論文, 2007.

[19] C. L. Li, “Scheduling to minimize the total resource consumption with a constraint on the sum of completion times,” European Journal of Operational research, Vol. 80, pp.

381-388, 1995.

[20] 練俊原, “平行機製程在資源限制下之排程問題,” 中原大學工業工程研究所碩士 論文, 2003.

[21] J. Gupta and A. Ruiz-Torres, “A LISTFIT heuristic for Minimizing Makespan on Identical Parallel Machines,” Production Planning and Control Journal, Vol.12, pp.28-36, 2001.

[22] Z. L. Chen, “Simultaneous job scheduling and resource allocation on parallel machines,” Annals of Operations Research, Vol.129, pp.135 - 153, 2004.

[23] P. C. Chu, J. Beasley, ”A genetic algorithm for the generalised assignment problem,”

Computers and Operations Research, vol.24, pp.17-23, 1997.

[24] P. Hajela and C. Y. Lin, “Genetic search strategies in multicriterion optimal design,”

Structural and Multidisciplinary Optimization, vol. 4, pp. 99-107, 1992.

[25] T. Murata, H. Ishibuchi and H. Tanaka, “Multi-Objective Genetic Algorithm and Its Applications to Flowshop Scheduling,” International Journal of Computers and Industrial Engineering, 30, pp.957-968, 1996.

[26] J. H. Holland, “Adaptation in Natural and Artificial Systems,” University of Michigan Press, 1975.

[27] G. Syswerda, “Uniform Crossover in Genetic Algorithms,” In Proceedings of the Third International Conference on Genetic Algorithms, J. Schaffer(ed.), Morgan Kaufmann, pp. 2-9, 1989.

[28] T. Murata and H. Ishibuchi, “MOGA: Multi-Objective Genetic Algorithms,” IEEE International Conference on Evolutionary Computation, pp. 289, 1995.

[29] K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, “A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II,” Lecture Notes in Computer Science, Vol. 1917, pp. 849-858, 2000.

[30] S. Y. Ho, L. S. Shu and J. H. Chen, “Intelligent evolutionary algorithms for large parameter optimization problems,” IEEE Transactions on Evolutionary Computation, Vol. 8, pp. 522–541, 2004.

[31] D. Whitley and J. Kauth, “GENITOR: A Different Genetic Algorithm”, In Proceedings of the Rocky Mountain Conference on Artificial Intelligence, pp. 118-130, 1988.

[32] D. M. Tate and A. E. Smith, “A genetic approach to the quadratic assignment problem,” Computers and Operations Research, Vol. 22, pp.73-83, 1995.

[33] D. Jakobovi´c, L. Jelenkovi´c, and L. Budin, ”Genetic programming heuristics for multiple machine scheduling.”, In Proc. of the 10th European Conference on Genetic Programming, pp.321-330, 2007.

附錄 附錄 附錄 附錄

附錄 附錄

附錄 附錄 A、 、 、 、測試計畫排程 測試計畫排程 測試計畫排程 測試計畫排程圖 圖 圖-組合 圖 組合 組合 1 組合

1. 總測試時間優先:

優先權 High 完成時間:59，Medium 完成時間:65，Low 完成時間:64

2. 隨機任選一解:

優先權 High 完成時間:76，Medium 完成時間:76，Low 完成時間:74

3. 總使用零組件優先:

優先權 High 完成時間:80，Medium 完成時間:87，Low 完成時間:90

附錄 附錄

附錄 附錄 B、 、 、測試計畫排程 、 測試計畫排程 測試計畫排程圖 測試計畫排程 圖 圖 圖-組合 組合 組合 組合 2

1. 總測試時間優先:

優先權 High 完成時間:79，Medium 完成時間:81，Low 完成時間:71

2. 隨機任選一解:

優先權 High 完成時間:75，Medium 完成時間:89，Low 完成時間:80

3. 總使用零組件優先:

優先權 High 完成時間:80，Medium 完成時間:97，Low 完成時間:100

附錄 附錄

附錄 附錄 C、 、 、 、測試計畫排程圖 測試計畫排程圖 測試計畫排程圖 測試計畫排程圖-組合 組合 組合 3 組合

1. 總測試時間優先:

優先權 High 完成時間:81，Medium 完成時間:84，Low 完成時間:82

2. 隨機任選一解:

優先權 High 完成時間:75，Medium 完成時間:102，Low 完成時間:86

3. 總使用零組件優先:

優先權 High 完成時間:120，Medium 完成時間:104，Low 完成時間:100