{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T14:22:00Z","timestamp":1768486920890,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T00:00:00Z","timestamp":1489795200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71102138"],"award-info":[{"award-number":["71102138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10796-017-9743-5","type":"journal-article","created":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T23:53:46Z","timestamp":1489794826000},"page":"1057-1066","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["The resource allocation model for multi-process instances based on particle swarm optimization"],"prefix":"10.1007","volume":"19","author":[{"given":"Weidong","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6268-8953","authenticated-orcid":false,"given":"Qingfeng","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangjian","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,18]]},"reference":[{"key":"9743_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-540-49774-5_2","volume-title":"Particle Swarm optimization in dynamic environments. Evolutionary computation in dynamic and uncertain environments","author":"T Blackwell","year":"2007","unstructured":"Blackwell, T. (2007). Particle Swarm optimization in dynamic environments. Evolutionary computation in dynamic and uncertain environments (pp. 29\u201349). Berlin: Springer."},{"key":"9743_CR2","doi-asserted-by":"crossref","unstructured":"Chen C Y, Chuang C H, Wu M C. (2012). Combining concepts of inertia weights and constriction factors in particle swarm optimization. 2012 I.E. International conference on computational intelligence for measurement systems and applications, Tianjin, China, (pp. 73\u201376).","DOI":"10.1109\/CIMSA.2012.6269606"},{"issue":"1","key":"9743_CR3","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.knosys.2012.08.002","volume":"37","author":"K Cheng","year":"2013","unstructured":"Cheng, K., Zhang, H., & Zhang, R. (2013). A task-resource allocation method based on effectiveness. Knowledge-Based Systems, 37(1), 196\u2013202.","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"9743_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TKDE.2010.113","volume":"23","author":"P Delias","year":"2010","unstructured":"Delias, P., Doulamis, A., Doulamis, N., et al. (2010). Optimizing resource conflicts in workflow management systems. IEEE Transactions on Knowledge & Data Engineering, 23(3), 417\u2013432.","journal-title":"IEEE Transactions on Knowledge & Data Engineering"},{"key":"9743_CR5","series-title":"Evolutionary programming VII (pp. 611\u2013616)","volume-title":"Comparison between genetic algorithms and particle swarm optimization","author":"R Eberhart","year":"1998","unstructured":"Eberhart, R., & Shi, Y. (1998). Comparison between genetic algorithms and particle swarm optimization, Evolutionary programming VII (pp. 611\u2013616). Berlin Heidelberg: Springer."},{"key":"9743_CR6","doi-asserted-by":"crossref","unstructured":"Gao Y, Li S. (2010). Improved particle swarm optimization algorithm. Proceedings of 2010 international conference on computational intelligence and software engineering (pp. 1\u20134), Springer-Verlag NewYork.","DOI":"10.1109\/CISE.2010.5677054"},{"issue":"8","key":"9743_CR7","doi-asserted-by":"crossref","first-page":"9483","DOI":"10.1016\/j.eswa.2011.01.146","volume":"38","author":"Z Huang","year":"2011","unstructured":"Huang, Z., Lu, X., & Duan, H. (2011). Mining association rules to support resource allocation in business process management. Expert Systems with Applications, 38(8), 9483\u20139490.","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"9743_CR8","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1109\/TSMCA.2012.2187889","volume":"42","author":"Z Huang","year":"2012","unstructured":"Huang, Z., Lu, X., & Duan, H. (2012). A task operation model for resource allocation optimization in business process management. IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans, 42(5), 1256\u20131270.","journal-title":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans"},{"issue":"8","key":"9743_CR9","first-page":"1790","volume":"17","author":"XU Jin","year":"2011","unstructured":"Jin, X. U., Fei, S. M., Zhang, S. Y., et al. (2011). Adaptive particle swarm optimization for the project scheduling problem with dynamic allocation of resource. Computer Integrated Manufacturing Systems, 17(8), 1790\u20131797.","journal-title":"Computer Integrated Manufacturing Systems"},{"issue":"4","key":"9743_CR10","first-page":"1","volume":"524","author":"Z Liu","year":"2015","unstructured":"Liu, Z., Zhu, P., Chen, W., et al. (2015). Improved particle swarm optimization algorithm using design of experiment and data mining techniques. Structural & Multidisciplinary Optimization, 524(4), 1\u201314.","journal-title":"Structural & Multidisciplinary Optimization"},{"key":"9743_CR11","first-page":"177","volume-title":"Mining staff assignment rules from event-based data. Lecture Notes in Computer Science","author":"L Ly","year":"2006","unstructured":"Ly, L., Rinderle, S., Dadam, P., et al. (2006). Mining staff assignment rules from event-based data. Lecture Notes in Computer Science (pp. 177\u2013190). Berlin: Springer."},{"issue":"19","key":"9743_CR12","first-page":"182","volume":"36","author":"K-f MAO","year":"2010","unstructured":"MAO, K.-f., Guang-qing, B. A. O., & Chi, X. U. (2010). Particle swarm optimization algorithm based on non-symmetric learning factor adjusting. Computer Engineering, 36(19), 182\u2013184.","journal-title":"Computer Engineering"},{"key":"9743_CR13","first-page":"167","volume-title":"Aspects in workflow management","author":"S Petkov","year":"2005","unstructured":"Petkov, S., Oren, E., & Haller, A. (2005). Aspects in workflow management (pp. 167\u2013178). Galway: National University of Ireland."},{"issue":"2","key":"9743_CR14","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.camwa.2013.01.016","volume":"66","author":"M Pluhacek","year":"2013","unstructured":"Pluhacek, M., Senkerik, R., Davendra, D., et al. (2013). On the behavior and performance of chaos driven PSO algorithm with inertia weight. Computers & Mathematics with Applications, 66(2), 122\u2013134.","journal-title":"Computers & Mathematics with Applications"},{"issue":"8","key":"9743_CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0141-9331(02)00053-4","volume":"26","author":"A Salman","year":"2002","unstructured":"Salman, A., & Ahmad, I. (2002). Particle swarm optimization for task assignment problem. Microprocessor and Microsystems, 26(8), 363\u2013371.","journal-title":"Microprocessor and Microsystems"},{"issue":"5","key":"9743_CR16","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.is.2004.03.003","volume":"30","author":"P Senkul","year":"2005","unstructured":"Senkul, P., & Toroslu, I. H. (2005). An architecture for workflow scheduling under resource allocation constraints. Information Systems, 30(5), 399\u2013422.","journal-title":"Information Systems"},{"issue":"4","key":"9743_CR17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.procs.2011.04.019","volume":"4","author":"S Smanchat","year":"2011","unstructured":"Smanchat, S., Indrawan, M., Ling, S., et al. (2011). A scheduler based on resource competition for parameter sweep workflow. Procedia Computer Science, 4(4), 176\u2013185.","journal-title":"Procedia Computer Science"},{"issue":"6","key":"9743_CR18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","volume":"85","author":"I Trelea","year":"2003","unstructured":"Trelea, I. (2003). The particle swarm optimization algorithm. Information Processing Letters, 85(6), 317\u2013325.","journal-title":"Information Processing Letters"},{"issue":"4","key":"9743_CR19","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1142\/S0218843001000412","volume":"10","author":"WMP Van Der Aalst","year":"2001","unstructured":"Van Der Aalst, W. M. P., Barthelmess, P., Ellis, C. A., et al. (2001). Proclets: A framework for lightweight interacting workflow processes. International Journal of Cooperative Information Systems, 10(4), 443\u2013481.","journal-title":"International Journal of Cooperative Information Systems"},{"issue":"1","key":"9743_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.2528\/PIER11012305","volume":"115","author":"W-B Wang","year":"2011","unstructured":"Wang, W.-B., Feng, Q., & Liu, D. (2011). Application of chaotic particle swarm optimization algorithm to pattern synthesis of antenna arrays. Pier, 115(1), 173\u2013189.","journal-title":"Pier"},{"issue":"5","key":"9743_CR21","doi-asserted-by":"crossref","first-page":"732","DOI":"10.15837\/ijccc.2015.5.2030","volume":"10","author":"XY Wang","year":"2015","unstructured":"Wang, X. Y., Zhang, G. X., Zhao, J. B., et al. (2015). A modified membrane-inspired algorithm based on particle swarm optimization for mobile robot path planning. International Journal of Computers, Communications & Control, 10(5), 732\u2013745.","journal-title":"International Journal of Computers, Communications & Control"},{"key":"9743_CR22","first-page":"228","volume-title":"Business process improvement: How they impact on each other. Procedings of Business Process Management, International Conference, Milan, Italy","author":"J Xu","year":"2008","unstructured":"Xu, J., Liu, C., & Zhao, X. (2008). Resource allocation vs. In Business process improvement: How they impact on each other. Procedings of Business Process Management, International Conference, Milan, Italy (pp. 228\u2013243)."},{"key":"9743_CR23","doi-asserted-by":"crossref","unstructured":"Yang H, Wang C, Liu Y, et al. (2008). An optimal approach for workflow staff assignment based on hidden Markov models: on the move to meaningful Internet systems. Proceedings of 2008 Workshops on OTM. Springer Berlin Heidelberg, pp 24\u201326","DOI":"10.1007\/978-3-540-88875-8_12"},{"key":"9743_CR24","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.neucom.2012.09.019","volume":"103","author":"Y Zhang","year":"2013","unstructured":"Zhang, Y., & Gong, D. W. (2013). Robot path planning in uncertain environment using multi-objective particle swarm optimization. Neurocomputing, 103, 172\u2013185.","journal-title":"Neurocomputing"},{"key":"9743_CR25","unstructured":"Zhao W. (2014). Smart Business Process Management. Shanghai: Fudan University Press. (pp. 10\u201315)"}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10796-017-9743-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-017-9743-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-017-9743-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T12:13:52Z","timestamp":1505132032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10796-017-9743-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,18]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9743"],"URL":"https:\/\/doi.org\/10.1007\/s10796-017-9743-5","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"value":"1387-3326","type":"print"},{"value":"1572-9419","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,18]]}}}