{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:17:30Z","timestamp":1749010650239,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319410081"},{"type":"electronic","value":"9783319410098"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41009-8_3","type":"book-chapter","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T04:49:28Z","timestamp":1465879768000},"page":"19-27","source":"Crossref","is-referenced-by-count":5,"title":["Solving the Test Task Scheduling Problem with a Genetic Algorithm Based on the Scheme Choice Rule"],"prefix":"10.1007","author":[{"given":"Jinhua","family":"Shi","sequence":"first","affiliation":[]},{"given":"Hui","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Kefei","family":"Mao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.cie.2015.12.012","volume":"92","author":"S Kir","year":"2016","unstructured":"Kir, S., Yazgan, H.R.: A sequence dependent single machine scheduling problem with fuzzy axiomatic design for the penalty costs. Comput. Ind. Eng. 92, 95\u2013104 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"3_CR2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Xu, H.: Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12(1), 336\u2013353 (2015)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"5","key":"3_CR3","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1080\/0951192X.2014.880808","volume":"28","author":"M Rohaninejad","year":"2015","unstructured":"Rohaninejad, M., Kheirkhah, A.S., Nouri, B.V., Fattahi, P.: Two hybrid tabu search\u2013firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost. Int. J. Comput. Integr. Manuf. 28(5), 470\u2013487 (2015)","journal-title":"Int. J. Comput. Integr. Manuf."},{"issue":"5","key":"3_CR4","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/s10766-009-0107-8","volume":"37","author":"MR Bonyadi","year":"2009","unstructured":"Bonyadi, M.R., Moghaddam, M.E.: A bipartite genetic algorithm for multi-processor task scheduling. Int. J. Parallel Prog. 37(5), 462\u2013487 (2009)","journal-title":"Int. J. Parallel Prog."},{"issue":"3","key":"3_CR5","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1080\/00207543.2011.644819","volume":"51","author":"J Gao","year":"2013","unstructured":"Gao, J., Chen, R., Deng, W.: An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int. J. Prod. Res. 51(3), 641\u2013651 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"3_CR6","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1016\/j.cor.2010.12.003","volume":"39","author":"T Keskinturk","year":"2012","unstructured":"Keskinturk, T., Yildirim, M.B., Barut, M.: An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times. Comput. Oper. Res. 39(6), 1225\u20131235 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"3_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s10696-010-9067-y","volume":"23","author":"N Al-Hinai","year":"2011","unstructured":"Al-Hinai, N., ElMekkawy, T.Y.: An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem. Flex. Serv. Manuf. J. 23(1), 64\u201385 (2011)","journal-title":"Flex. Serv. Manuf. J."},{"issue":"3","key":"3_CR8","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Syst. Appl. 38(3), 1313\u20131320 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"3_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10479-012-1080-y","volume":"219","author":"D Fotakis","year":"2012","unstructured":"Fotakis, D., Sidiropoulos, E.: Combined land-use and water allocation planning. Ann. Oper. Res. 219(1), 169\u2013185 (2012)","journal-title":"Ann. Oper. Res."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jclepro.2016.02.041","volume":"121","author":"P Paulo","year":"2016","unstructured":"Paulo, P., Branco, F., Brito, J., de Silva, A.: BuildingsLife \u2013 the use of genetic algorithms for maintenance plan optimization. J. Clean. Prod. 121, 94\u201398 (2016)","journal-title":"J. Clean. Prod."},{"issue":"2","key":"3_CR11","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s00500-014-1539-7","volume":"20","author":"NK Pareek","year":"2016","unstructured":"Pareek, N.K., Patidar, V.: Medical image protection using genetic algorithm operations. Soft Comput. 20(2), 763\u2013772 (2016)","journal-title":"Soft Comput."},{"issue":"1","key":"3_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10951-015-0457-6","volume":"19","author":"H Li","year":"2016","unstructured":"Li, H., Demeulemeester, E.: A genetic algorithm for the robust resource leveling problem. J. Sched. 19(1), 43\u201360 (2016)","journal-title":"J. Sched."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.cor.2015.10.005","volume":"67","author":"M Kurdi","year":"2016","unstructured":"Kurdi, M.: An effective new island model genetic algorithm for job shop scheduling problem. Comput. Oper. Res. 67, 132\u2013142 (2016)","journal-title":"Comput. Oper. Res."},{"key":"3_CR14","unstructured":"Sels, V., Gheysen, N., Vanhoucke, M.: A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. Int. J. Prod. Res., 1\u201316 (2011)"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1016\/j.cor.2006.07.014","volume":"35","author":"R Ruiz","year":"2008","unstructured":"Ruiz, R., Serifo\u011flu, F.S., Urlings, T.: Modeling realistic hybrid flexible flowshop scheduling problems. Comput. Oper. Res. 35, 1151\u20131175 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"3_CR16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10951-010-0173-1","volume":"15","author":"J Xu","year":"2012","unstructured":"Xu, J., Zhang, Z.: A fuzzy random resource-constrained scheduling model with multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project. J. Sched. 15(2), 253\u2013272 (2012)","journal-title":"J. Sched."},{"issue":"5","key":"3_CR17","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/s00170-004-2223-3","volume":"27","author":"L Zhang","year":"2006","unstructured":"Zhang, L., Wang, L., Zheng, D.-Z.: An adaptive genetic algorithm with multiple operators for flowshop scheduling. Int. J. Adv. Manuf. Technol. 27(5), 580\u2013587 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"3_CR18","first-page":"1788","volume":"35","author":"ZX Guo","year":"2007","unstructured":"Guo, Z.X., Wong, W.K., Leung, S.Y.S., Fan, J.T., Chan, S.F.: Genetic optimization of order scheduling with multiple uncertainties. Expert Syst. Appl. 35(4), 1788\u20131801 (2007)","journal-title":"Expert Syst. Appl."},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10710-009-9096-z","volume":"11","author":"JLJ Laredo","year":"2010","unstructured":"Laredo, J.L.J., Eiben, A.E., Steen, M., Merelo, J.J.: EvAg: a scalable peer-to-peer evolutionary algorithm. Genet. Program Evolvable Mach. 11, 227\u2013246 (2010)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"5","key":"3_CR20","doi-asserted-by":"crossref","first-page":"2790","DOI":"10.1016\/j.asoc.2012.10.001","volume":"13","author":"H Lu","year":"2013","unstructured":"Lu, H., Niu, R., et al.: A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem. Appl. Soft Comput. 13(5), 2790\u20132802 (2013)","journal-title":"Appl. Soft Comput."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Lu, H., Zhu, Z., et al.: A variable neighborhood MOEA\/D for multiobjective test task scheduling problem. Math. Probl. Eng. 2014 (2014). 423621","DOI":"10.1155\/2014\/423621"},{"issue":"1","key":"3_CR22","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00170-009-2388-x","volume":"49","author":"FM Defersha","year":"2010","unstructured":"Defersha, F.M., Chen, M.: A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups. Int. J. Adv. Manuf. Technol. 49(1), 263\u2013279 (2010)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Xia, R., Xiao, M.Q., Cheng, J.J., Fu, X.H.: Optimizing the multi-UUT parallel test task scheduling based on multi-objective GASA. In: The 8th International Conference on Electronic Measurement and Instruments, Xi\u2019an, vol. 4, pp. 839\u2013844 (2007)","DOI":"10.1109\/ICEMI.2007.4351273"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41009-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T21:38:26Z","timestamp":1748986706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41009-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319410081","9783319410098"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41009-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}