{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:13:57Z","timestamp":1769282037768,"version":"3.49.0"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 109-2222-E-167-004"],"award-info":[{"award-number":["MOST 109-2222-E-167-004"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10489-022-03701-2","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T20:02:44Z","timestamp":1652299364000},"page":"2593-2615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An evolutionary simulation-optimization approach for the problem of order allocation with flexible splitting rule in semiconductor assembly"],"prefix":"10.1007","volume":"53","author":[{"given":"Chun-Chih","family":"Chiu","sequence":"first","affiliation":[]},{"given":"Chyh-Ming","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Chien-Ming","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"key":"3701_CR1","first-page":"1","volume":"2019","author":"G Ahn","year":"2019","unstructured":"Ahn G, Park M, Park YJ, Hur S (2019) Interactive Q-learning approach for pick-and-place optimization of the die attach process in the semiconductor industry. Math Probl Eng 2019:1\u20138","journal-title":"Math Probl Eng"},{"issue":"2","key":"3701_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TSM.2010.2041399","volume":"23","author":"Y Deng","year":"2010","unstructured":"Deng Y, Bard JF, Chacon GR, Stuber J (2010) Scheduling Back-end operations in semiconductor manufacturing. IEEE Trans Semicond Manuf 23(2):210\u2013220","journal-title":"IEEE Trans Semicond Manuf"},{"issue":"4","key":"3701_CR3","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/TASE.2007.906341","volume":"4","author":"Y Song","year":"2007","unstructured":"Song Y, Zhang MT, Yi J, Zhang L, Zheng L (2007) Bottleneck Station scheduling in semiconductor assembly and test manufacturing using ant Colony optimization. IEEE Trans Autom Sci Eng 4(4):569\u2013578","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"19","key":"3701_CR4","doi-asserted-by":"publisher","first-page":"5729","DOI":"10.1080\/00207540903229181","volume":"48","author":"JC Chen","year":"2010","unstructured":"Chen JC, Su L, Sun C, Hsu M (2010) Infinite capacity planning for IC packaging plants. Int J Prod Res 48(19):5729\u20135748","journal-title":"Int J Prod Res"},{"issue":"2","key":"3701_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/TSM.2011.2114900","volume":"24","author":"M Fu","year":"2011","unstructured":"Fu M, Askin R, Fowler J, Haghnevis M, Keng N, Pettinato JS, Zhang M (2011) Batch production scheduling for semiconductor back-end operations. IEEE Trans Semicond Manuf 24(2):249\u2013260","journal-title":"IEEE Trans Semicond Manuf"},{"issue":"4","key":"3701_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TASE.2007.905977","volume":"4","author":"MT Zhang","year":"2007","unstructured":"Zhang MT, Niu S, Deng S, Zhang Z, Li Q, Zheng L (2007) Hierarchical capacity planning with reconfigurable kits in global semiconductor assembly and test manufacturing. IEEE Trans Autom Sci Eng 4(4):543\u2013552","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"5","key":"3701_CR7","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.engappai.2010.01.008","volume":"23","author":"S Khalouli","year":"2010","unstructured":"Khalouli S, Ghedjati F, Hamzaoui A (2010) A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop. Eng Appl Artif Intell 23(5):765\u2013771","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"3701_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TEPM.2007.899091","volume":"30","author":"WL Pearn","year":"2007","unstructured":"Pearn WL, Chung SH, Lai CM (2007) Scheduling integrated circuit assembly operations on die bonder. IEEE Trans Electron Packag Manufact 30(2):97\u2013105","journal-title":"IEEE Trans Electron Packag Manufact"},{"issue":"1","key":"3701_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/09537287.2011.572090","volume":"23","author":"T Yang","year":"2012","unstructured":"Yang T, Shen YA (2012) Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: integrated-circuit wire bonding. Prod Plan Control 23(1):67\u201378","journal-title":"Prod Plan Control"},{"key":"3701_CR10","doi-asserted-by":"crossref","unstructured":"Appello D, Laurino M, Pranzo M (2017) A mathematical model to assess the influence of parallelism in a semiconductor back-end test floor. International test conference in Asia. 138-143","DOI":"10.1109\/ITC-ASIA.2017.8097129"},{"key":"3701_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.swevo.2017.05.007","volume":"38","author":"HY Sang","year":"2018","unstructured":"Sang HY, Duan PY, Li JQ (2018) An effective invasive weed optimization algorithm for scheduling semiconductor final testing problem. Swarm Evol Comput 38:42\u201353","journal-title":"Swarm Evol Comput"},{"key":"3701_CR12","doi-asserted-by":"crossref","unstructured":"Adan J, Adan I, Akcay A, Stokkermans J, Van den Dobbelsteen R (2018) A hybrid genetic algorithm for parallel machine scheduling at semiconductor back-end production. Twenty-Eighth Int Conf Autom Plan Sched:298\u2013302","DOI":"10.1609\/icaps.v28i1.13913"},{"issue":"8","key":"3701_CR13","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1080\/00207540902744784","volume":"47","author":"D Weigert","year":"2009","unstructured":"Weigert D, Klemmt A, Horn S (2009) Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor backend facility. Int J Prod Res 47(8):2165\u20132184","journal-title":"Int J Prod Res"},{"issue":"8","key":"3701_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1080\/0951192042000237537","volume":"17","author":"Y Xiao-Feng","year":"2004","unstructured":"Xiao-Feng Y, Tay-Jin C, Feng-Yu W, Ming-Wei L, Tian-Xiang C, Wen-Jing Y, Mei-Yoke L (2004) A rule-based heuristic finite capacity scheduling system for semiconductor backend assembly. Int J Comput Integr Manuf 17(8):733\u2013749","journal-title":"Int J Comput Integr Manuf"},{"issue":"1","key":"3701_CR15","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s10696-017-9302-x","volume":"31","author":"JT Lin","year":"2019","unstructured":"Lin JT, Chiu CC, Chang YH (2019) Simulation-based optimization approach for simultaneous scheduling of vehicles and machines with processing time uncertainty in FMS. Flex Serv Manuf J 31(1):104\u2013141","journal-title":"Flex Serv Manuf J"},{"key":"3701_CR16","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.cie.2018.12.073","volume":"128","author":"WT De Sousa Junior","year":"2019","unstructured":"De Sousa Junior WT, Montevechi JAB, de Carvalho MR, Campos AT (2019) Discrete simulation-based optimization methods for industrial engineering problems: a systematic literature review. Comput Ind Eng 128:526\u2013540","journal-title":"Comput Ind Eng"},{"issue":"1","key":"3701_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.5334\/gh.528","volume":"15","author":"A Bahari","year":"2020","unstructured":"Bahari A, Asadi F (2020) A simulation optimization approach for resource allocation in an emergency department healthcare unit. Glob Heart 15(1):14. https:\/\/doi.org\/10.5334\/gh.528","journal-title":"Glob Heart"},{"key":"3701_CR18","unstructured":"Bechhofer RE, Santner TJ, Goldsman DM (1995) Design and analysis of experiments for statistical selection, screening, and multiple comparisons, Wiley, New York"},{"key":"3701_CR19","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1287\/opre.49.5.732.10615","volume":"49","author":"S Chick","year":"2001","unstructured":"Chick S, Inoue K (2001) New two-stage and sequential procedures for selecting the best simulated system. Oper Res 49:1609\u20131624","journal-title":"Oper Res"},{"key":"3701_CR20","first-page":"28","volume":"37B","author":"EJ Dudewicz","year":"1975","unstructured":"Dudewicz EJ, Dalal SR (1975) Allocation of observations in ranking and selection with unequal variances. Sankhya 37B:28\u201378","journal-title":"Sankhya"},{"key":"3701_CR21","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1080\/03610927808827671","volume":"A7","author":"Y Rinott","year":"1978","unstructured":"Rinott Y (1978) On two-stage selection procedures and related probability inequalities. Commun Stat Theory Methods A7:799\u2013811","journal-title":"Commun Stat Theory Methods"},{"key":"3701_CR22","volume-title":"Stochastic simulation optimization \u2013 an optimal computing budget allocation","author":"CH Chen","year":"2011","unstructured":"Chen CH, Lee LH (2011) Stochastic simulation optimization \u2013 an optimal computing budget allocation. World Scientific Publishing Co. Ptd. Ltd, Singapore"},{"key":"3701_CR23","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.asoc.2009.12.020","volume":"11","author":"RJ Kuo","year":"2011","unstructured":"Kuo RJ, Yang CY (2011) Simulation optimization using particle swarm optimization algorithm with application to assembly line design. Appl Soft Compu 11:605\u2013613","journal-title":"Appl Soft Compu"},{"key":"3701_CR24","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.neucom.2017.04.041","volume":"260","author":"CC Chiu","year":"2017","unstructured":"Chiu CC, Lin JT (2017) Novel hybrid approach with elite group optimal computing budget allocation for the stochastic multimodal problem. Neurocomputing 260:449\u2013465","journal-title":"Neurocomputing"},{"key":"3701_CR25","first-page":"908","volume":"181","author":"H Pan","year":"2006","unstructured":"Pan H, Wang L, Liu B (2006) Particle swarm optimization for function optimization in noisy environment. Appl Math Comput 181:908\u2013919","journal-title":"Appl Math Comput"},{"key":"3701_CR26","doi-asserted-by":"publisher","first-page":"11561","DOI":"10.1007\/s10586-017-1420-4","volume":"22","author":"G Zhang","year":"2018","unstructured":"Zhang G, Zhang L, Song X, Wang Y, Zhou C (2018) A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. Clust Comput 22:11561\u201311572. https:\/\/doi.org\/10.1007\/s10586-017-1420-4","journal-title":"Clust Comput"},{"issue":"10","key":"3701_CR27","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1007\/s10489-019-01467-8","volume":"49","author":"BF Gumaida","year":"2019","unstructured":"Gumaida BF, Luo J (2019) A hybrid particle swarm optimization with a variable neighborhood search for the localization enhancement in wireless sensor networks. Appl Intell 49(10):3539\u20133557","journal-title":"Appl Intell"},{"key":"3701_CR28","doi-asserted-by":"publisher","unstructured":"Umam MS, Mustafid M, Suryono S (2021) A hybrid genetic algorithm and tabu search for minimizing makespan inflow shop scheduling problem. J King Saud Univ - Comput Inf Sci. https:\/\/doi.org\/10.1016\/j.jksuci.2021.08.025","DOI":"10.1016\/j.jksuci.2021.08.025"},{"issue":"4","key":"3701_CR29","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/j.cor.2006.07.014","volume":"35","author":"R Ruiz","year":"2008","unstructured":"Ruiz R, \u015eerifo\u011flu FS, Urlings T (2008) Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35(4):1151\u20131175","journal-title":"Comput Oper Res"},{"issue":"1","key":"3701_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1\u201318","journal-title":"Eur J Oper Res"},{"issue":"8","key":"3701_CR31","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas I, Leisten R, Frami\u00f1an JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37(8):1439\u20131454","journal-title":"Comput Oper Res"},{"key":"3701_CR32","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10732-007-9061-z","volume":"15","author":"YD Kim","year":"2009","unstructured":"Kim YD, Joo BJ, Shin JH (2009) Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J Heuristics 15:19\u201342","journal-title":"J Heuristics"},{"key":"3701_CR33","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.cie.2004.09.002","volume":"47","author":"H Allaoui","year":"2004","unstructured":"Allaoui H, Artiba A (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput Ind Eng 47:431\u2013450","journal-title":"Comput Ind Eng"},{"issue":"4","key":"3701_CR34","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1016\/j.rcim.2010.12.006","volume":"27","author":"M Frantz\u00e9n","year":"2011","unstructured":"Frantz\u00e9n M, Ng AH, Moore P (2011) A simulation-based scheduling system for real-time optimization and decision-making support. Robot Cim-Int Manuf 27(4):696\u2013705","journal-title":"Robot Cim-Int Manuf"},{"key":"3701_CR35","doi-asserted-by":"crossref","unstructured":"Behera DK (2012) Complexity on parallel machine scheduling: a review. Emerg Trends Sci Eng Technol:373\u2013381","DOI":"10.1007\/978-81-322-1007-8_34"},{"issue":"6","key":"3701_CR36","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s10845-012-0650-9","volume":"24","author":"JA Ventura","year":"2013","unstructured":"Ventura JA, Yoon SH (2013) A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. J Intell Manuf 24(6):1185\u20131196","journal-title":"J Intell Manuf"},{"issue":"4","key":"3701_CR37","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0278-6125(03)80009-2","volume":"22","author":"DJ Johnson","year":"2003","unstructured":"Johnson DJ (2003) A framework for reducing manufacturing throughput time. J Manuf Syst 22(4):283\u2013298","journal-title":"J Manuf Syst"},{"issue":"23\u201324","key":"3701_CR38","doi-asserted-by":"publisher","first-page":"7023","DOI":"10.1080\/00207543.2013.774506","volume":"51","author":"M Cheng","year":"2013","unstructured":"Cheng M, Mukherjee NJ, Sarin SC (2013) A review of lot streaming. Int J Prod Res 51(23\u201324):7023\u20137045","journal-title":"Int J Prod Res"},{"issue":"4","key":"3701_CR39","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1016\/j.cie.2011.12.032","volume":"62","author":"T Ye","year":"2012","unstructured":"Ye T (2012) Analysis on multi-stage lot streaming: the effect of transfer. Comput Ind Eng 62(4):1046\u20131054","journal-title":"Comput Ind Eng"},{"issue":"2","key":"3701_CR40","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2007.08.030","volume":"19","author":"CT Tseng","year":"2008","unstructured":"Tseng CT, Liao CJ (2008) A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. Eur J Oper Res 19(2):360\u2013373","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3701_CR41","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.omega.2011.05.002","volume":"40","author":"QK Pan","year":"2012","unstructured":"Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2):166\u2013180","journal-title":"Omega"},{"key":"3701_CR42","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1016\/j.ins.2011.04.010","volume":"181","author":"S Balin","year":"2011","unstructured":"Balin S (2011) Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation. Inform Sci 181:3551\u20133569","journal-title":"Inform Sci"},{"key":"3701_CR43","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.simpat.2014.10.008","volume":"51","author":"JT Lin","year":"2015","unstructured":"Lin JT, Chen CM (2015) Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing. Simul Model Pract Theory 51:100\u2013114","journal-title":"Simul Model Pract Theory"},{"issue":"7","key":"3701_CR44","first-page":"452","volume":"30","author":"JT Lin","year":"2013","unstructured":"Lin JT, Chen CM, Chiu CC, Fang HY (2013) Simulation optimization with PSO and OCBA for semiconductor back-end assembly. J Ind Prod Eng 30(7):452\u2013460","journal-title":"J Ind Prod Eng"},{"issue":"12","key":"3701_CR45","doi-asserted-by":"publisher","first-page":"2900","DOI":"10.1109\/TAC.2009.2033847","volume":"54","author":"K Li","year":"2009","unstructured":"Li K, Sava A, Xie X (2009) Simulation-based discrete optimization of stochastic discrete event systems subject to non-closed-form constraints. IEEE Trans Automat Contr 54(12):2900\u20132904","journal-title":"IEEE Trans Automat Contr"},{"issue":"4","key":"3701_CR46","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s10845-015-1144-3","volume":"29","author":"W Qin","year":"2015","unstructured":"Qin W, Zhang J, Song D (2015) An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. J Intell Manuf 29(4):891\u2013904","journal-title":"J Intell Manuf"},{"issue":"7","key":"3701_CR47","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1080\/0740817X.2013.778709","volume":"45","author":"LH Lee","year":"2013","unstructured":"Lee LH, Chew EP, Frazier PI, Jia QS, Chen CH (2013) Advances in simulation optimization and its applications. IIE Trans 45(7):683\u2013684","journal-title":"IIE Trans"},{"key":"3701_CR48","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.asoc.2018.07.017","volume":"71","author":"CC Chiu","year":"2018","unstructured":"Chiu CC, Lin JT (2018) A novel optimal replication allocation strategy for particle swarm optimization algorithms applied to simulation optimization problem. Appl Soft Comput 71:591\u2013607","journal-title":"Appl Soft Comput"},{"issue":"20","key":"3701_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2011.622311","volume":"50","author":"CJ Huang","year":"2012","unstructured":"Huang CJ, Chang KH, Lin JT (2012) Optimal vehicle allocation for an automated materials handling system using simulation optimization. Int J Prod Res 50(20):1\u201313","journal-title":"Int J Prod Res"},{"key":"3701_CR50","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.engappai.2017.07.026","volume":"65","author":"JH Hong","year":"2017","unstructured":"Hong JH, Ryu KR (2017) Simulation-based multimodal optimization of decoy system design using an archived noise-tolerant genetic algorithm. Eng Appl Artif Intell 65:230\u2013239","journal-title":"Eng Appl Artif Intell"},{"issue":"6","key":"3701_CR51","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.engappai.2012.04.001","volume":"25","author":"A Shahzad","year":"2012","unstructured":"Shahzad A, Mebarki N (2012) Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem. Eng Appl Artif Intell 25(6):1173\u20131181","journal-title":"Eng Appl Artif Intell"},{"key":"3701_CR52","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.jmsy.2014.11.010","volume":"34","author":"T Yang","year":"2015","unstructured":"Yang T, Kuo Y, Su C-T, Hou C-L (2015) Lean production system design for fishing net manufacturing using lean principles and simulation optimization. J Manuf Syst 34:66\u201373","journal-title":"J Manuf Syst"},{"key":"3701_CR53","doi-asserted-by":"publisher","first-page":"104276","DOI":"10.1016\/j.engappai.2021.104276","volume":"103","author":"AD De Le\u00f3n","year":"2021","unstructured":"De Le\u00f3n AD, Lalla-Ruiz E, Meli\u00e1n-Batista B, Moreno-Vega JM (2021) A simulation\u2013optimization framework for enhancing robustness in bulk berth scheduling. Eng Appl Artif Intell 103:104276","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"3701_CR54","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1008349927281","volume":"10","author":"CH Chen","year":"2000","unstructured":"Chen CH, Lin JY, Ucesan E, Chick SE (2000) Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dyn S 10(3):251\u2013270","journal-title":"Discrete Event Dyn S"},{"issue":"2","key":"3701_CR55","first-page":"19","volume":"7","author":"LH Lee","year":"2010","unstructured":"Lee LH, Chen CH, Chew EP, Li J, Pujowidianto NA, Zhang S (2010) A review of optimal computing budget allocation algorithms for simulation optimization problem. Int J Oper Res 7(2):19\u201331","journal-title":"Int J Oper Res"},{"issue":"03","key":"3701_CR56","doi-asserted-by":"publisher","first-page":"1550001","DOI":"10.1142\/S0217595915500190","volume":"32","author":"J Xu","year":"2015","unstructured":"Xu J, Huang E, Chen C-H, Lee LH (2015) Simulation optimization: a review and exploration in the new era of cloud computing and big data. Asia-Pac J Oper Res 32(03):1550001\u20131550019","journal-title":"Asia-Pac J Oper Res"},{"issue":"2","key":"3701_CR57","first-page":"115","volume":"5","author":"M Liu","year":"2016","unstructured":"Liu M, Cramer AM (2016) Genetic algorithm with integrated computing budget allocation for stochastic problems. Int J Met 5(2):115\u2013135","journal-title":"Int J Met"},{"key":"3701_CR58","doi-asserted-by":"crossref","unstructured":"Xiao H, Gao F, Lee LH (2019) Optimal computing budget allocation for complete ranking with input uncertainty. IISE Trans:1\u201320","DOI":"10.1080\/24725854.2019.1659524"},{"key":"3701_CR59","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TASE.2013.2239289","volume":"11","author":"H Xiao","year":"2014","unstructured":"Xiao H, Lee LH, Ng KM (2014) Optimal computing budget allocation for complete ranking. IEEE Trans Auto Sci Eng 11:516\u2013524","journal-title":"IEEE Trans Auto Sci Eng"},{"issue":"3","key":"3701_CR60","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TSM.2012.2200266","volume":"25","author":"SC Horng","year":"2012","unstructured":"Horng SC, Yang FY, Lin SS (2012) Applying PSO and OCBA to minimize the overkills and re-probes in wafer probe testing. IEEE Trans Semicond Manuf 25(3):531\u2013540","journal-title":"IEEE Trans Semicond Manuf"},{"issue":"2\u20133","key":"3701_CR61","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1504\/IJSTL.2019.099274","volume":"11","author":"H Hu","year":"2019","unstructured":"Hu H, Chen X, Zhang S (2019) Optimisation for quay crane scheduling problem under uncertainty using PSO and OCBA. Int J Shipp Transp Logist 11(2\u20133):196\u2013213","journal-title":"Int J Shipp Transp Logist"},{"key":"3701_CR62","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TEVC.2016.2592185","volume":"21","author":"S Zhang","year":"2017","unstructured":"Zhang S, Xu J, Lee LH, Wong WP, Chen CH (2017) Optimal computing budget allocation for particle swarm optimization in stochastic optimization. IEEE Trans Evol Comp 21:206\u2013219","journal-title":"IEEE Trans Evol Comp"},{"key":"3701_CR63","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11721-016-0125-2","volume":"10","author":"S Taghiyeh","year":"2016","unstructured":"Taghiyeh S, Xu J (2016) A new particle swarm optimization algorithm for noisy optimization problems. Swarm Intell 10:161\u2013192","journal-title":"Swarm Intell"},{"issue":"3","key":"3701_CR64","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10845-015-1124-7","volume":"29","author":"JT Lin","year":"2018","unstructured":"Lin JT, Chiu CC (2018) A hybrid particle swarm optimization with local search for stochastic resource allocation problem. J Intell Manuf 29(3):481\u2013495","journal-title":"J Intell Manuf"},{"issue":"5","key":"3701_CR65","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1109\/TCYB.2013.2264670","volume":"43","author":"SC Horng","year":"2013","unstructured":"Horng SC, Lin SY, Lee LH, Chen CH (2013) Memetic algorithm for real-time combinatorial stochastic simulation optimization problems with performance analysis. IEEE Trans Cybern 43(5):1495\u20131509","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"3701_CR66","first-page":"133","volume":"20","author":"D He","year":"2010","unstructured":"He D, Lee LH, Chen CH, Fu M, Wasserkrug S (2010) Simulation optimization using the cross-entropy method with optimal computing budget allocation. ACM T Model Comput S 20(1):133\u2013161","journal-title":"ACM T Model Comput S"},{"issue":"4","key":"3701_CR67","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1057\/jos.2016.12","volume":"11","author":"W Liu","year":"2017","unstructured":"Liu W (2017) Optimal computing budget allocation to the differential evolution algorithm for large-scale portfolio optimization. J Simul 11(4):380\u2013390","journal-title":"J Simul"},{"key":"3701_CR68","doi-asserted-by":"publisher","first-page":"107154","DOI":"10.1016\/j.asoc.2021.107154","volume":"103","author":"Y Fu","year":"2021","unstructured":"Fu Y, Xiao H, Lee LH, Huang M (2021) Stochastic optimization using grey wolf optimization with optimal computing budget allocation. Appl Soft Comput 103:107154","journal-title":"Appl Soft Comput"},{"key":"3701_CR69","volume-title":"Adaptation in natural and artificial systems, the University of Michigan Press","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems, the University of Michigan Press. MI, Ann Arbor"},{"key":"3701_CR70","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1016\/j.jmsy.2013.07.001","volume":"32","author":"X Chang","year":"2013","unstructured":"Chang X, Dong M, Yang D (2013) Multi-objective real-time dispatching for integrated delivery in a fab using GA based simulation optimization. J Manuf Syst 32:741\u2013751","journal-title":"J Manuf Syst"},{"issue":"9","key":"3701_CR71","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.ress.2005.11.018","volume":"91","author":"A Konak","year":"2006","unstructured":"Konak A, Coit D, Smith A (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Safe 91(9):992\u20131007","journal-title":"Reliab Eng Syst Safe"},{"key":"3701_CR72","doi-asserted-by":"publisher","unstructured":"Chiu CC, Lin JT (2021) An efficient elite-based simulation\u2013optimization approach for stochastic resource allocation problems in manufacturing and service systems. Asia Pac J Oper Res:2150030. https:\/\/doi.org\/10.1142\/S0217595921500305","DOI":"10.1142\/S0217595921500305"},{"key":"3701_CR73","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.swevo.2019.03.013","volume":"48","author":"A Yadav","year":"2019","unstructured":"Yadav A (2019) AEFA: artificial electric field algorithm for global optimization. Swarm Evol Comput 48:93\u2013108","journal-title":"Swarm Evol Comput"},{"key":"3701_CR74","doi-asserted-by":"publisher","unstructured":"Yeh WC, Tan SY (2021). Simplified swarm optimization for the heterogeneous fleet vehicle routing problem with time-varying continuous speed function. Electronics. 10(15): 1775. https:\/\/doi.org\/10.3390\/electronics10151775","DOI":"10.3390\/electronics10151775"},{"key":"3701_CR75","doi-asserted-by":"publisher","first-page":"100665","DOI":"10.1016\/j.swevo.2020.100665","volume":"54","author":"J Carrasco","year":"2020","unstructured":"Carrasco J, Garc\u00eda S, Rueda MM, Das S, Herrera F (2020) Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: practical guidelines and a critical review. Swarm Evol Comput 54:100665","journal-title":"Swarm Evol Comput"}],"updated-by":[{"DOI":"10.1007\/s10489-022-03915-4","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000}}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03701-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03701-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03701-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T11:36:32Z","timestamp":1673436992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03701-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,11]]},"references-count":75,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["3701"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03701-2","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10489-022-03915-4","asserted-by":"object"}]},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,11]]},"assertion":[{"value":"29 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2022","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10489-022-03915-4","URL":"https:\/\/doi.org\/10.1007\/s10489-022-03915-4","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}