本研究著眼於單一自動化測試機台的變數設置的問題，許多變量值變化會影響機器性能，產品循環時間和生產成本的問題。 根據這些變量的不同設置，就像每種不同種類的產品都應在不同的處理時間中進行測試一樣，不同的單一機台可能會發生不同的錯位頻率，這可能是不確定的。 然而，目的是最小化完工時間，即減少週期時間並降低生產成本。 通過使用模擬軟體Flexsim來執行單一機台模擬。 通過對不同參數，變量和設備狀態設置的分析，可以找到適合每種產品類型的更好配置，並在單台機器上找到準確的循環時間計算，從而提高生產測試效率。然而，本研究透過Flexsim進行模擬與實驗分析後，得出每種產品最合適的測試環境，包含在哪個機台進行測試，其機台的測試孔數量分別為多少。並考量到如果將測試孔擴增後，機台的測試環境會有何變化。同時也考量產品在進行測試時，可能會發生錯位，針對這個不確性因素發生的頻率與造成的影響進行描述與分析。此外，針對每個單一產品，根據機器循環時間的定義，除了產品在測試孔內進行測試所耗費的加工(處理)時間，亦可得出每個產品在機器手臂運送時所耗費的運送時間，以及在測試過程中因為錯位的發生所造成的等待時間與閒置時間。
最後，根據得出產品運送時間與等待時間的資訊以及歷史產品測試資料，可用來推估新產品的加工(處理)時間。此外，當已知每種產品最合適的測試孔數量設置，也考慮了錯位可能造成的影響。針對每個客戶訂單中有不同種類的產品，能給予最合適的測試環境配置，以達到最佳化與最有效率的運作。

This research focus on the problem that the variables setting of auto test handler single machine, the value variations of many variables will affect the performance of machine, the production cycle time, and the production cost. According to the different setting with these variables, like every different item types of products should be tested in different process time, and the different single machine may happen different frequency of misplacement, which may be uncertain. However, the objective is to minimize makespan, that is, to reduce cycle time and to reduce production costs. By using simulation software, Flexsim, to perform single machine simulation. The analysis of different parameters, variables and equipment condition settings is used to find the better configurations that fit each product type and find the accurate cycle time computing in single machine to improve the production efficiency. However, after conducting simulation and experimental analysis through Flexsim, this research obtained the most suitable testing environment for each product, including test in which machine, and the number of testing slots of the machine. Also consider how the testing environment of the machine will change if the testing slot is expanded. At the same time, it also considers that when the product is tested, misplacement may occur. The frequency and impact of this uncertainty factor will be described and analyzed. In addition, for each single piece product, according to the definition of machine cycle time, besides the process time spent by the product in the testing slot, the traveling time spent by each product with the robot arm transportation, and the waiting time and idle time caused by misplacement during the testing process. Finally, it can be used to estimate the process time of new products based on the information of product traveling time, waiting time, and historical product testing data. In addition, when it is known that the most suitable setting of the testing slots number for each product, the limitation of the number of machines, and the possible impact of misplacement is also considered. For each customer order, there are different types of products, and the most suitable testing environment configuration can be given to achieve optimized and most efficient operation.

[1] Y. Koren, et al., (1999). CIRP Annals, 48, 527-540.
[2] K. H. Han, et al., (2015). Recent Advances on Electroscience and Computers, 3, 26-29.
[3] K. Udeda, (1993). Journal of the Japan Society of Precision Engineering, 5, 5-10.
[4] H. Hvolby, K. Steger-Jensen, (2010). Computers in Industry, 61, 845-851.
[5] A. Lupeikiene, et al., (2014). Informatica, 25, 581-616.
[6] PSLX Consortium, (2005). Advanced Planning and Scheduling (APS) Conceptual Definition and Implementation, PSLX White Paper.
[7] R. A. E. Montesco, et al., (2015). IFAC-PapersOnline, 48, 2273-2280.
[8] Deloitte. (2020). Consumer Product Trends: Navigating 2020. Deloitte University Press
[9] Stamatis, D.H., 2011, The OEE Primer: Understanding Overall Equipment Effectiveness, Reliability and Maintainability, Boca Raton (FL, USA)
[10] MarkRHamel (2013, May 22). Machine Cycle Time. LeanMath. Retrieved March 15, 2020, from http://www.leanmath.com/blog-entry/machine-cycle-time
[11] Marx, K. Capital, vol. 2. In K. Marx and F. Engels, Soch., 2nd ed., vol. 24, chs. 5, 12, 13.
[12] Mou, J., Gao, L., Li, X., Pan, Q., & Mu, J. (2017). Multi-objective inverse scheduling optimization of single-machine shop system with uncertain due-dates and processing times. Cluster Computing, 20(1), 371–390.
[13] E.M. Gonzalez-Neira, D. Ferone, S. Hatami and A.A. Juan, A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simul. Model. Pract. Theory 79 (2017) 23–36.
[14] K. Wang and S.H. Choi, A decomposition-based approach to flexible flow shop scheduling under machine breakdown. Int. J. Prod. Res. 50 (2012) 215–234.
[15] P. Tayanithi, S. Manivannan, and J. Banks. A knowledge-based simulation architecture to analyze interruptions in a flexible manufacturing system. J. Manuf. Syst. 11 (1992) 195–214.
[16] Hardas CS, Doolen TL, Jensen DH (2008) Development of a genetic algorithm for component placement sequence optimization in printed circuit board assembly. Comput Ind Eng 55(1):165–182.
[17] Kasperski, A., & Zieliński, P. (2015). Single machine scheduling problems with uncertain parameters and the OWA criterion. Journal of Scheduling, 19(2), 177–190.
[18] Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems. Upper Saddle River, NJ: Prentice Hall.
[19] Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. London: Kluwer Academic Publishers.
[20] Ragatz, G.L. and Mabert, V.A. (1988). An evaluation of order release mechanisms in a job-shop environment. Decision Sciences, 19, 167–189.
[21] Rohleder, T. R. and Scudder, G. (1993). A comparison of order-release and dispatching rules for the dynamic weighted early/tardy problem. Production and Operations Management, 2, 221–239.
[22] Frazier, G. V. (1996). An evaluation of group scheduling heuristics in a flow-line manufacturing cell. International Journal of Production Research, 34, 959–976.
[23] Mahmoodi, F., Mosier, C. T. and Guerin, R. E. (1996). The effect of combining simple priority heuristics in flow-dominant shops. International Journal of Production Research, 34, 819–839.
[24] Wein, L.M. and Chevalier, P.B. (1992). A broader view of the job-shop scheduling problem. Management Science, 38, 1018–1033.
[25] Melnyk, S. A., Ghosh, S. and Ragatz, G. L. (1989). Tooling constraints and shop floor scheduling: a simulation study. Journal of Operations Management, 8, 69–89.
[26] Ishii, N. and Muraki, M. (1996). An extended dispatching rule approach in an on-line scheduling framework for batch process management. International Journal of Production Research, 34, 329–348.
[27] Baker, C. T. and Dzielinski, B. P. (1960). Simulation of a simplified job shop. Management Science, 6, 311–323.
[28] Robb, D. J. and Silver, E. (1993). Scheduling in a management context: uncertain processing times and non-regular performance measures. Decision Sciences, 24, 1085–1107.
[29] Daniels, R. L. and Kouvelis, P. (1995). Robust scheduling to hedge against processing time uncertainty in single-stage production. Management, 41, 363–376.
[30] Wein, L. M. and Ou, J. (1991). Scheduling in a management context: uncertain processing times and non-regular performance measures. Decision Sciences, 24, 1085–1107.
[31] Lawrence, S. R. and Sewell, E. C. (1997). Heuristic, optimal static, and dynamic schedules when processing times are uncertain. Journal of Operations Management, 15, 71–82.
[32] He, Y., Smith, M. L. and Dudek, R. A. (1994). Effects of inaccuracy of processing time estimation on effectiveness of dispatching rules. Proceedings of 3rd Industrial Engineering Research Conference, Atlanta, GA, pp. 308–313.