{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:11:30Z","timestamp":1760609490993,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:00:00Z","timestamp":1669248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:00:00Z","timestamp":1669248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Key Research and Development Project of Guangdong Province","award":["2021B0101420003"],"award-info":[{"award-number":["2021B0101420003"]}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["L201003"],"award-info":[{"award-number":["L201003"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11227-022-04943-0","type":"journal-article","created":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T10:05:03Z","timestamp":1669370703000},"page":"7206-7227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimization of parallel test task scheduling with constraint satisfaction"],"prefix":"10.1007","volume":"79","author":[{"given":"Jinsheng","family":"Gao","sequence":"first","affiliation":[]},{"given":"Xiaomin","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Runtong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,24]]},"reference":[{"issue":"8","key":"4943_CR1","doi-asserted-by":"publisher","first-page":"3013","DOI":"10.1021\/ie9807809","volume":"38","author":"V Jain","year":"1999","unstructured":"Jain V, Grossmann IE (1999) Resource-constrained scheduling of tests in new product development. Ind Eng Chem Res 38(8):3013\u20133026. https:\/\/doi.org\/10.1021\/ie9807809","journal-title":"Ind Eng Chem Res"},{"key":"4943_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/3785452","volume":"2021","author":"Z Yang","year":"2021","unstructured":"Yang Z, Xiao H-S, Guan R, Yang Y, Ji H-L (2021) Task scheduling for multiunit parallel test using mixed-integer linear programming. Math Probl Eng 2021:1\u201313. https:\/\/doi.org\/10.1155\/2021\/3785452","journal-title":"Math Probl Eng"},{"issue":"9","key":"4943_CR3","doi-asserted-by":"publisher","first-page":"10252","DOI":"10.1007\/s11227-021-03685-9","volume":"77","author":"M Sulaiman","year":"2021","unstructured":"Sulaiman M, Halim Z, Waqas M, Ayd\u0131n D (2021) A hybrid list-based task scheduling scheme for heterogeneous computing. J Supercomput 77(9):10252\u201310288. https:\/\/doi.org\/10.1007\/s11227-021-03685-9","journal-title":"J Supercomput"},{"issue":"1","key":"4943_CR4","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1007\/s11227-020-03306-x","volume":"77","author":"R Sharma","year":"2021","unstructured":"Sharma R, Nitin N, AlShehri MAR, Dahiya D (2021) Priority-based joint EDF\u2013RM scheduling algorithm for individual real-time task on distributed systems. J Supercomput 77(1):890\u2013908. https:\/\/doi.org\/10.1007\/s11227-020-03306-x","journal-title":"J Supercomput"},{"key":"4943_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/9615463","volume":"2021","author":"X Liao","year":"2021","unstructured":"Liao X, Zhang H, Koshimura M, Huang R, Yu W, Li F (2021) Modeling and solving scheduling in overloaded situations with weighted partial MaxSat. Math Probl Eng 2021:1\u201317. https:\/\/doi.org\/10.1155\/2021\/9615463","journal-title":"Math Probl Eng"},{"key":"4943_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/423621","volume":"2014","author":"H Lu","year":"2014","unstructured":"Lu H, Zhu Z, Wang X, Yin L (2014) A variable neighborhood moea\/d for multiobjective test task scheduling problem. Math Probl Eng 2014:1\u201314. https:\/\/doi.org\/10.1155\/2014\/423621","journal-title":"Math Probl Eng"},{"key":"4943_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/640764","volume":"2014","author":"H Lu","year":"2014","unstructured":"Lu H, Yin L, Wang X, Zhang M, Mao K (2014) Chaotic multiobjective evolutionary algorithm based on decomposition for test task scheduling problem. Math Probl Eng 2014:1\u201325. https:\/\/doi.org\/10.1155\/2014\/640764","journal-title":"Math Probl Eng"},{"key":"4943_CR8","doi-asserted-by":"publisher","unstructured":"Lu H, Xu X, Zhang M, Yin L (2015) Dynamic multi-objective evolutionary algorithm based on decomposition for test task scheduling problem. In: 2015 Sixth International Conference on Intelligent Control and Information Processing (ICICIP), IEEE, Wuhan, China, pp 11\u201318. https:\/\/doi.org\/10.1109\/ICICIP.2015.7388136","DOI":"10.1109\/ICICIP.2015.7388136"},{"issue":"5","key":"4943_CR9","doi-asserted-by":"publisher","first-page":"2790","DOI":"10.1016\/j.asoc.2012.10.001","volume":"13","author":"H Lu","year":"2013","unstructured":"Lu H, Niu R, Liu J, Zhu Z (2013) A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem. Appl Soft Comput 13(5):2790\u20132802. https:\/\/doi.org\/10.1016\/j.asoc.2012.10.001","journal-title":"Appl Soft Comput"},{"key":"4943_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.infsof.2016.08.006","volume":"80","author":"H Wu","year":"2016","unstructured":"Wu H, Nie C, Kuo F-C (2016) The optimal testing order in the presence of switching cost. Inf Softw Technol 80:57\u201372. https:\/\/doi.org\/10.1016\/j.infsof.2016.08.006","journal-title":"Inf Softw Technol"},{"key":"4943_CR11","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.asoc.2018.02.050","volume":"66","author":"H Lu","year":"2018","unstructured":"Lu H, Zhou R, Fei Z, Shi J (2018) A multi-objective evolutionary algorithm based on pareto prediction for automatic test task scheduling problems. Appl Soft Comput 66:394\u2013412. https:\/\/doi.org\/10.1016\/j.asoc.2018.02.050","journal-title":"Appl Soft Comput"},{"issue":"4","key":"4943_CR12","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1080\/00207543.2013.838327","volume":"52","author":"A-D Do Ngoc","year":"2014","unstructured":"Do Ngoc A-D, Lee S-H, Moon I (2014) Hybrid genetic algorithm for test bed scheduling problems. Int J Prod Res 52(4):1074\u20131089. https:\/\/doi.org\/10.1080\/00207543.2013.838327","journal-title":"Int J Prod Res"},{"key":"4943_CR13","doi-asserted-by":"publisher","unstructured":"Lu H, Zhang M (2015) Non-integrated algorithm based on eda and tabu search for test task scheduling problem. In: 2015 IEEE AUTOTESTCON, IEEE, National Harbor, MD, USA, pp 261\u2013268. https:\/\/doi.org\/10.1109\/AUTEST.2015.7356500","DOI":"10.1109\/AUTEST.2015.7356500"},{"key":"4943_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-41009-8_3","volume-title":"Advances in swarm intelligence","author":"J Shi","year":"2016","unstructured":"Shi J, Lu H, Mao K (2016) Solving the test task scheduling problem with a genetic algorithm based on the scheme choice rule. In: Tan Y, Shi Y, Li L (eds) Advances in swarm intelligence, vol 9713. Springer, Cham, pp 19\u201327. https:\/\/doi.org\/10.1007\/978-3-319-41009-8_3. https:\/\/data.mendeley.com\/datasets\/bp8gf34wnm"},{"issue":"12","key":"4943_CR15","doi-asserted-by":"publisher","first-page":"4239","DOI":"10.1007\/s00500-018-3077-1","volume":"23","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Jiang S, Wang X, Chen R, Zhang M (2019) An optimization algorithm applied to the class integration and test order problem. Soft Comput 23(12):4239\u20134253. https:\/\/doi.org\/10.1007\/s00500-018-3077-1","journal-title":"Soft Comput"},{"issue":"6","key":"4943_CR16","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/0097-8493(95)00055-0","volume":"19","author":"M Dohmen","year":"1995","unstructured":"Dohmen M (1995) A survey of constraint satisfaction techniques for geometric modeling. Comput Graph 19(6):831\u2013845. https:\/\/doi.org\/10.1016\/0097-8493(95)00055-0","journal-title":"Comput Graph"},{"issue":"3","key":"4943_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(95)00089-U","volume":"55","author":"W Hower","year":"1995","unstructured":"Hower W (1995) Constraint satisfaction-algorithms and complexity analysis. Inf Process Lett 55(3):171\u2013178. https:\/\/doi.org\/10.1016\/0020-0190(95)00089-U","journal-title":"Inf Process Lett"},{"issue":"3","key":"4943_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10601-011-9109-4","volume":"16","author":"R Bart\u00e1k","year":"2011","unstructured":"Bart\u00e1k R, Salido MA (2011) Constraint satisfaction for planning and scheduling problems. Constraints 16(3):223\u2013227. https:\/\/doi.org\/10.1007\/s10601-011-9109-4","journal-title":"Constraints"},{"issue":"8","key":"4943_CR19","doi-asserted-by":"publisher","first-page":"766","DOI":"10.3390\/e21080766","volume":"21","author":"B Guan","year":"2019","unstructured":"Guan B, Zhao Y, Li Y (2019) An ant colony optimization based on information entropy for constraint satisfaction problems. Entropy 21(8):766. https:\/\/doi.org\/10.3390\/e21080766","journal-title":"Entropy"},{"issue":"11","key":"4943_CR20","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1134\/S0005117921110059","volume":"82","author":"BV Kupriyanov","year":"2021","unstructured":"Kupriyanov BV, Lazarev AA (2021) Optimization of a recursive conveyor by reduction to a constraint satisfaction problem. Autom Remote Control 82(11):1892\u20131906. https:\/\/doi.org\/10.1134\/S0005117921110059","journal-title":"Autom Remote Control"},{"issue":"12","key":"4943_CR21","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/ab371f","volume":"2019","author":"A Grover","year":"2019","unstructured":"Grover A, Achim T, Ermon S (2019) Streamlining variational inference for constraint satisfaction problems. J Stat Mech Theory Exp 2019(12):124006. https:\/\/doi.org\/10.1088\/1742-5468\/ab371f","journal-title":"J Stat Mech Theory Exp"},{"key":"4943_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103550","volume":"300","author":"B Bogaerts","year":"2021","unstructured":"Bogaerts B, Gamba E, Guns T (2021) A framework for step-wise explaining how to solve constraint satisfaction problems. Artif Intell 300:103550. https:\/\/doi.org\/10.1016\/j.artint.2021.103550","journal-title":"Artif Intell"},{"issue":"6","key":"4943_CR23","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1007\/s10732-021-09475-z","volume":"27","author":"D Habet","year":"2021","unstructured":"Habet D, Terrioux C (2021) Conflict history based heuristic for constraint satisfaction problem solving. J Heuristics 27(6):951\u2013990. https:\/\/doi.org\/10.1007\/s10732-021-09475-z","journal-title":"J Heuristics"},{"issue":"4","key":"4943_CR24","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10732-019-09434-9","volume":"26","author":"H Li","year":"2020","unstructured":"Li H, Feng G, Yin M (2020) On combining variable ordering heuristics for constraint satisfaction problems. J Heuristics 26(4):453\u2013474. https:\/\/doi.org\/10.1007\/s10732-019-09434-9","journal-title":"J Heuristics"},{"issue":"5","key":"4943_CR25","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1007\/s11227-018-2626-9","volume":"75","author":"J Meshkati","year":"2019","unstructured":"Meshkati J, Faramarz S-E (2019) Energy-aware resource utilization based on particle swarm optimization and artificial bee colony algorithms in cloud computing. J Supercomput 75(5):2455\u20132496. https:\/\/doi.org\/10.1007\/s11227-018-2626-9","journal-title":"J Supercomput"},{"issue":"8","key":"4943_CR26","doi-asserted-by":"publisher","first-page":"5189","DOI":"10.1007\/s11227-019-02786-w","volume":"75","author":"Z Du","year":"2019","unstructured":"Du Z, Han D, Li K-C (2019) Improving the performance of feature selection and data clustering with novel global search and elite-guided artificial bee colony algorithm. J Supercomput 75(8):5189\u20135226. https:\/\/doi.org\/10.1007\/s11227-019-02786-w","journal-title":"J Supercomput"},{"issue":"6\u20137","key":"4943_CR27","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1016\/j.compchemeng.2003.09.019","volume":"28","author":"CT Maravelias","year":"2004","unstructured":"Maravelias CT, Grossmann IE (2004) Optimal resource investment and scheduling of tests for new product development. Comput Chem Eng 28(6\u20137):1021\u20131038. https:\/\/doi.org\/10.1016\/j.compchemeng.2003.09.019","journal-title":"Comput Chem Eng"},{"key":"4943_CR28","doi-asserted-by":"publisher","unstructured":"Christos MT, Ignacio GE (2006) Logic inference and a decomposition algorithm for the resource-constrained scheduling of testing tasks in the development of new pharmaceutical and agrochemical products. In: Handbook on Modelling for Discrete Optimization. International Series in Operations Research & Management Science, vol 88. Springer, New York, pp 265\u2013289. https:\/\/doi.org\/10.1007\/0-387-32942-0_9","DOI":"10.1007\/0-387-32942-0_9"},{"issue":"5","key":"4943_CR29","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s00500-015-1852-9","volume":"21","author":"S Sundar","year":"2017","unstructured":"Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21(5):1193\u20131202. https:\/\/doi.org\/10.1007\/s00500-015-1852-9","journal-title":"Soft Comput"},{"key":"4943_CR30","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2021.1886368","author":"J Gao","year":"2021","unstructured":"Gao J, Zhu X, Bai K, Zhang R (2021) New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2021.1886368","journal-title":"Int J Prod Res"},{"key":"4943_CR31","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13110","author":"J Gao","year":"2022","unstructured":"Gao J, Zhu X, Zhang R (2022) A branch-and-price approach to the multitasking scheduling with batch control on parallel machines. Int Trans Oper Res. https:\/\/doi.org\/10.1111\/itor.13110","journal-title":"Int Trans Oper Res"},{"key":"4943_CR32","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.cie.2019.07.054","volume":"136","author":"H Samarghandi","year":"2019","unstructured":"Samarghandi H (2019) Solving the no-wait job shop scheduling problem with due date constraints: a problem transformation approach. Comput Ind Eng 136:635\u2013662. https:\/\/doi.org\/10.1016\/j.cie.2019.07.054","journal-title":"Comput Ind Eng"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04943-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04943-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04943-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T09:10:48Z","timestamp":1679562648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04943-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,24]]},"references-count":32,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["4943"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04943-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,11,24]]},"assertion":[{"value":"8 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}