Abstract
The supply chain network is usually composed of multiple nodes and paths, and the energy consumption and carbon emissions of each node will change, leading to dynamic changes in the network structure and resource demand. In order to improve the utilization rate and accuracy of dynamic supply chain network resource balanced scheduling, under the current carbon tax policy, a comprehensive study on dynamic supply chain network resource balanced scheduling was carried out. Firstly, the RSUC dynamic supply chain network model is constructed to reflect the operation changes of the dynamic supply chain network under the carbon tax policy in real time through the iterative operation of the model. Secondly, a multi-path link routing algorithm for dynamic supply chain network resource balanced scheduling is designed, and the one with the highest success rate is selected as the transmission path for dynamic supply chain network resource balanced scheduling. Calculate the use of resources in dynamic supply chain network nodes, obtain the use and surplus of dynamic supply chain network resources under the carbon tax policy, and make every node’s resources be used as far as possible. On this basis, according to the actual situation and characteristics of the supply chain network operation, the dynamic quota of network resource balanced scheduling is designed in an all-round way, so as to achieve the goal of dynamic supply chain network resource balanced scheduling under the carbon tax policy. Experimental analysis shows that after the application of the new method, the network resource utilization rate is high under different network workload data segments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yang, Y.: Balanced scheduling method for big data of network traffic based on set-pair analysis strategy. J. Physics: Conference Series 2187(1), 012065 (2022)
Stipanovic, I., Bukhsh, Z.A., Reale, C., et al.: A multiobjective decision-making model for risk-based maintenance scheduling of railway earthworks. Appl. Sci. 11(3), 965 (2021)
Bu, B.: Multi-task equilibrium scheduling of Internet of Things: a rough set genetic algorithm. Comput. Commun. 184, 42–55 (2022)
Wang, C., Wang, Z., Xu, X., et al.: A balanced sensor scheduling for multitarget localization in a distributed multiple-input multiple-output radar network. Int. J. Distrib. Sens. Netw. 17(7), 71–78 (2021)
Yan, H., Liu, P., Lu, X.: Two-agent vehicle scheduling problem on a line-shaped network. J. Industrial and Manage. Optimization 19(7), 4874–4892 (2023)
Wang, J.B., Lv, D.Y., Wang, S.Y., et al.: Resource allocation scheduling with deteriorating jobs and position-dependent workloads. J. Industrial and Manage. Optimization 19(3), 1658–1669 (2023)
Cao, B., Zhang, J., Liu, X., et al.: Edge-cloud resource scheduling in space-air-ground integrated networks for internet of vehicles. IEEE Internet of Things J. 9(8), 5765–5772 (2021)
Alcaraz, J., Anton-Sanchez, L., Saldanha-Da-Gama, F.: Bi-objective resource-constrained project scheduling problem with time-dependent resource costs. J. Manufacturing Syst. 63, 506523 (2022)
Wang, Z., Yao, N., Liu, Z.: Research on key technology of edge-node resource scheduling based on linear programming. J. Adv. Manuf. Syst. 22(01), 85–96 (2023)
Li, F., Wang, C.: Simulation of blockchain resource allocation algorithm based on mobile edge computing. Computer Simulation 39(9), 420–424 (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Zhu, H. (2024). Equilibrium Scheduling of Dynamic Supply Chain Network Resources Under Carbon Tax Policy. In: Yun, L., Han, J., Han, Y. (eds) Advanced Hybrid Information Processing. ADHIP 2023. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 549. Springer, Cham. https://doi.org/10.1007/978-3-031-50549-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-031-50549-2_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-50548-5
Online ISBN: 978-3-031-50549-2
eBook Packages: Computer ScienceComputer Science (R0)