{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:15:20Z","timestamp":1771002920875,"version":"3.50.1"},"reference-count":32,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T00:00:00Z","timestamp":1745452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:p>In the context of increasing environmental challenges and the demand for sustainable development, traditional resource scheduling models in business management often fail to balance economic efficiency with environmental constraints. To address this gap, this study proposes an enhanced Particle Swarm Optimization (PSO) algorithm, termed OBLPSO, which integrates Opposition-Based Learning (OBL) and a perturbation mechanism. First, OBL generates a high-quality initial population to improve solution diversity, while a cosine curve adaptive strategy dynamically adjusts inertia weights to balance global exploration and local exploitation. Additionally, a perturbation mechanism expands the search range, preventing premature convergence. A multi-objective optimization model is established, incorporating task time, economic cost, and environmental impact (e.g., energy consumption and pollutant emissions) to maximize resource utilization and minimize ecological harm. Experimental results demonstrate that OBLPSO reduces task processing time by 29.7% and energy consumption by 16.1% compared to benchmark algorithms (e.g., ACO, GA, and standard PSO) under large-scale tasks (2000 tasks). The proposed method provides a robust solution for sustainable resource scheduling in an enterprise management environment with economic constraints.<\/jats:p>","DOI":"10.1177\/14727978251337955","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:36:42Z","timestamp":1745516202000},"page":"4020-4031","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Economic optimization of business administration resources: Multi-objective scheduling method based on improved PSO"],"prefix":"10.1177","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7803-5585","authenticated-orcid":false,"given":"Sizheng","family":"Li","sequence":"first","affiliation":[{"name":"School of Management Engineering, Jiangxi Vocational College of Mechanical &amp; Electrical Technology, Nanchang, China"}]}],"member":"179","published-online":{"date-parts":[[2025,4,24]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.envdev.2015.09.002"},{"key":"e_1_3_3_3_2","first-page":"17","article-title":"Optimization of enterprise labor resource allocation based on quality optimization model","volume":"20","author":"Liang G","year":"2021","unstructured":"Liang G, Xu L, Chen L. Optimization of enterprise labor resource allocation based on quality optimization model. Complexity 2021; 20: 17\u201325.","journal-title":"Complexity"},{"key":"e_1_3_3_4_2","first-page":"642","article-title":"Resource mobilization and technology adoption by small firms to co-create opportunities in uncertain environments","volume":"26","author":"Karami M","year":"2024","unstructured":"Karami M, Hossain M, Ojala A, et al. Resource mobilization and technology adoption by small firms to co-create opportunities in uncertain environments. J Res Mark Entrep 2024; 26: 642\u2013667.","journal-title":"J Res Mark Entrep"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-021-09562-1"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1080\/17517575.2015.1078913"},{"key":"e_1_3_3_7_2","first-page":"42","article-title":"A Resource scheduling method for enterprise management based on artificial intelligence deep learning","volume":"12","author":"Zhu L","year":"2022","unstructured":"Zhu L, Huang L. A Resource scheduling method for enterprise management based on artificial intelligence deep learning. Mob Inf Syst 2022; 12: 42\u201349.","journal-title":"Mob Inf Syst"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1515\/acsc-2016-0007"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1186\/s43088-023-00460-y"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJMOR.2024.142447"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1080\/002075499191896"},{"key":"e_1_3_3_12_2","first-page":"66","article-title":"Qualitative simulation algorithm for resource scheduling in enterprise management cloud mode","volume":"21","author":"Yu J","year":"2021","unstructured":"Yu J Qualitative simulation algorithm for resource scheduling in enterprise management cloud mode. Complexity 2021; 21: 66\u201376.","journal-title":"Complexity"},{"key":"e_1_3_3_13_2","first-page":"14","article-title":"Optimal allocation of enterprise resources based on the intelligent algorithm from the perspective of multidimensional dynamic innovation","volume":"20","author":"Song W","year":"2022","unstructured":"Song W, Lin Z. Optimal allocation of enterprise resources based on the intelligent algorithm from the perspective of multidimensional dynamic innovation. Comput Intell Neurosci 2022; 20: 14\u201326.","journal-title":"Comput Intell Neurosci"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3226444"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-018-9300-5"},{"key":"e_1_3_3_16_2","first-page":"17","article-title":"Optimization of management mode of small\u2010and medium\u2010sized enterprises based on decision tree model","volume":"14","author":"Diao Y","year":"2021","unstructured":"Diao Y, Zhang Q. Optimization of management mode of small\u2010and medium\u2010sized enterprises based on decision tree model. J Math 2021; 14: 17\u201328.","journal-title":"J Math"},{"key":"e_1_3_3_17_2","first-page":"2094","article-title":"A survey on decision tree algorithms of classification in data mining","volume":"5","author":"Sharma H","year":"2016","unstructured":"Sharma H, Kumar S. A survey on decision tree algorithms of classification in data mining. Int J Sci Res 2016; 5: 2094\u20132097.","journal-title":"Int J Sci Res"},{"key":"e_1_3_3_18_2","first-page":"2739","article-title":"A graph based approach for an extended resource planning and line balancing problem","volume":"86","author":"Miyamoto T","year":"2003","unstructured":"Miyamoto T, Yamashita S, Kumagai S, et al. A graph based approach for an extended resource planning and line balancing problem. IEICE Trans Fund Electron Commun Comput Sci 2003; 86: 2739\u20132746.","journal-title":"IEICE Trans Fund Electron Commun Comput Sci"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492913000032"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124765"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1520\/JTE20220129"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.08.034"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.resconrec.2020.104985"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-169389"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2974-0"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sasc.2024.200151"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8551.12817"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-021-09694-4"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroscience.2016.03.021"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-03980-x"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-017-1329-z"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2020.103244"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251337955","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/14727978251337955","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251337955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:31:01Z","timestamp":1771000261000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/14727978251337955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,24]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10.1177\/14727978251337955"],"URL":"https:\/\/doi.org\/10.1177\/14727978251337955","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,24]]}}}