In the credit cloud, credit services are sold to applications for credit computing, credit fusion and credit risk estimates. Plenty of services with different performance for the same task may have different execution time and charged by various ways. The users have specific requirements for the workflow completion time or cost. Hence, to meet the user’s satisfaction is an important challenge. In this paper, we propose heuristic scheduling methods for credit workflow with total cost minimization, and the deadline should be satisfied. The problem can be divided into two sub-problems, task-mode mapping and task tabling on renting service instances. For the task-mode mapping problem, a recursive heuristic method is constructed to select appropriate service for each task of the workflow. Then another heuristic algorithm based is established to get a final schema with deadline constraint. We discussed the service instance rented in shareable manner and compared with un-shareable manner. Three renting strategies are discussed in detail. Experimental results show the effectiveness and efficiency of the proposed algorithm.
In the credit cloud, credit services are sold to applications for credit computing, credit fusion and credit risk estimates. Plenty of services with different performance for the same task may have different execution time and charged by various ways. The users have specific requirements for the workflow completion time or cost. Hence, to meet the user’s satisfaction is an important challenge. In this paper, we propose heuristic scheduling methods for credit workflow with total cost minimization, and the deadline is satisfied. The problem has already proved to be NP-hard. For the mode assignment problem, a recursive heuristic method is constructed to select appropriate service for each task in the workflow. Then another heuristic algorithm based on problem characteristic is established to get a final schema with deadline constraint. We discussed the service instance rented in shareable manner with traditional un-shareable manner, which has fewer studies before. Three renting manners are discussed in detail. Experimental results show the effectiveness and efficiency of the proposed algorithm.
Credit risk transmission between cross-platforms is an important issue in the construction of a credit service system. The effect of credit risk transmission between credit entities (nodes) is analyzed in this paper. A heuristic algorithm based on hybrid strategies (HAHS) is proposed to find risk transmission paths and calculate the influence of nodes. Besides, a novel community model is applied to predict the credit risk areas in advance. In detail, the mathematical association structure between credit entities is firstly given in the algorithm, and the breadth first search algorithm is used to find the hierarchical nodes on the credit risk transmission paths. Then, the characteristics of credit risk transmission are analyzed, and the calculation methods of single-path and multipath influence are proposed. Finally, the credit entities are divided into communities based on a greedy strategy considering the characteristics of the credit entity association structure. The threshold control strategy is adopted to find global key nodes among all of the entities and local key nodes in communities, respectively, so as to realize the early warning of credit risk.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.