CN115357367B - Expense payment task scheduling method and computer equipment - Google Patents
Expense payment task scheduling method and computer equipment Download PDFInfo
- Publication number
- CN115357367B CN115357367B CN202211277772.0A CN202211277772A CN115357367B CN 115357367 B CN115357367 B CN 115357367B CN 202211277772 A CN202211277772 A CN 202211277772A CN 115357367 B CN115357367 B CN 115357367B
- Authority
- CN
- China
- Prior art keywords
- payment
- task
- queuing
- paths
- tasks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/405—Establishing or using transaction specific rules
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention relates to a fee payment task scheduling method and computer equipment, wherein the method comprises the following steps: receiving a fee payment task; selecting N available payment paths with the lowest transaction rate or the shortest queuing time as queuing channels according to the ratio of the number of the fee payment tasks to the number of the available payment paths; respectively arranging each received expense payment task in a payment task queue of N queuing channels; when any payment task in the payment task queues of the N queuing channels enters a pre-payment state, the same payment tasks in other payment task queues are removed; and executing the payment task of entering the pre-payment state to complete the payment. The method can select different payment paths according to the congestion degree of the current task. And when the current payment task is not crowded, selecting a payment path with lower transaction rate to complete the payment, and when the current payment task is crowded, selecting a payment path with shorter queuing time to quickly complete the payment.
Description
Technical Field
The application relates to the technical field of internet finance, in particular to a fee payment task scheduling method and computer equipment.
Background
With the spread of card-swipe payments and various electronic payments, transactions between consumers and merchants are increasingly using card-swipe payments and various electronic payments instead of cash payments. When a consumer conducts card swiping payment or electronic payment, money is not directly transferred to a bank account number of a merchant from a bank account of the consumer, but deduction of the bank account number of the consumer is initiated by the merchant through an acquiring mechanism on a T day (transaction day), and a total receivable item (sum of deductions of all transactions of the previous transaction day minus a commission charge) of the merchant on the previous transaction day is paid to the merchant by the acquiring mechanism in a certain time period after the T +1 day.
A single acquirer will serve a large number of merchants at the same time, and payment is a very complicated process due to the varying nature, transaction conditions, and account transfer requirements of each merchant. In order to smoothly pay the merchants, the acquirer transfers money to the merchants through a plurality of payment paths. The settlement channels have different characteristics, and the transaction rate, the maximum transfer amount, the processing time and the processing capacity are different. The existing payment method only considers the payment speed and ignores the influence of transaction rate, thereby increasing the transaction cost meaninglessly.
Disclosure of Invention
Therefore, a need exists for a fee payment task scheduling method and computer device with low transaction cost and high transaction speed.
One aspect of the embodiments of the present invention provides a method for scheduling a task of paying a fee, including the following steps:
s1: receiving fee payment tasks, and calculating the number of the fee payment tasks, the number of available payment paths and the queuing time of each available payment path which are currently queued;
s2: judging whether the ratio of the number of the expense payment tasks to the number of the available payment paths is smaller than a preset value or not, if so, entering a step S3, and otherwise, entering a step S4;
s3: selecting the first N available payment paths with the transaction rates from low to high as queuing channels, wherein N is greater than or equal to 2;
s4: selecting the first N available payment paths sequenced from short to long in queuing time length as a queuing channel;
s5: respectively arranging each received expense payment task in a payment task queue of N queuing channels, wherein the same expense payment tasks arranged in different payment task queues have the same task code;
s6: when any charge payment task in the payment task queues of the N queuing channels enters a pre-payment state, removing the charge payment tasks which have the same task codes and do not enter the pre-payment state in other payment task queues from the payment task queues in which the charge payment tasks are located;
s7: and executing the payment task of entering the pre-payment state to complete the payment.
In a preferred embodiment, in step S5, the arrangement order of the fee payment tasks with the same task code in different payment task queues is adjusted, so that the arrangement order of the fee payment tasks with the same task code in different payment task queues is different.
In a preferred embodiment, in step S5, the arrangement order of the fee payment tasks with the same task code in different payment task queues is adjusted, so that the arrangement order of the fee payment tasks with the same task code in different payment task queues is different and the difference between the sequence numbers of adjacent sequence numbers is greater than a preset value.
In a preferred embodiment, in step S1, the transaction speed, the account balance status, and the number of queued tasks of each payment path are obtained, the payment path for which the transaction speed is greater than the preset speed value and the account balance is normal is recorded as an available payment path, and the queuing duration of each available payment path is a quotient obtained by dividing the number of queued tasks by the transaction speed.
In a preferred embodiment, in step S3, a queuing channel is selected by:
s31: selecting N available payment paths as alternative channels in the M available payment paths, wherein M is larger than N;
s32: determining the maximum value of the transaction rates of the N alternative channels;
s33: comparing transaction rates of the M-N remaining available payment paths in sequence with the transaction rate maximum;
s34: if the transaction rate of the currently compared remaining available payment path is less than the maximum transaction rate, replacing the alternative channel with the maximum transaction rate by the remaining available payment path, and returning to the step S32;
s35: and if the transaction rates of all the remaining available payment paths are greater than or equal to the maximum value of the transaction rates of the N alternative channels, taking the N alternative channels as the first N available payment paths with the transaction rates sorted from low to high, namely queuing channels.
In a preferred embodiment, in step S4, a queuing channel is selected by:
s41: selecting N available payment paths as alternative channels in the M available payment paths, wherein M is larger than N;
s42: determining the maximum value of the queuing time length of the N alternative channels;
s43: sequentially comparing the queuing time lengths of the M-N remaining available payment paths with the maximum value of the queuing time lengths;
s44: if the queuing time length of the currently compared remaining available payment path is less than the maximum queuing time length, replacing the alternative channel with the maximum queuing time length by the remaining available payment path, and returning to the step S42;
s45: and if the queuing time lengths of all the remaining available payment paths are greater than or equal to the maximum value of the queuing time lengths of the N alternative channels, taking the N alternative channels as the first N available payment paths with the queuing time lengths sorted from low to high, namely the queuing channels.
In a preferred embodiment, in step S7, when executing the payment task entering the pre-payment state, it is first queried whether there is a payment task having the same task code that has completed payment, if so, the execution of the payment task entering the pre-payment state is terminated, and if not, the execution is continued.
In a preferred embodiment, in step S1, an available payment path corresponding to the payable amount is screened according to the payable amount in the fee payment task.
The embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements the steps of the fee payment task scheduling method according to any of the above embodiments.
The fee payment task scheduling method can select different payment paths according to the congestion degree of the current task. When the current payment task is not crowded, a payment path with lower transaction rate is selected to complete payment, so that the transaction cost is reduced, and when the current payment task is crowded, a payment path with shorter queuing time is selected to complete payment quickly, so that the customer experience is improved.
Drawings
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of preferred embodiments of the invention, as illustrated in the accompanying drawings. Like reference numerals refer to like parts throughout the drawings, and the drawings are not intended to be drawn to scale in actual dimensions, emphasis instead being placed upon illustrating the principles of the invention.
FIG. 1 is a flowchart of a task scheduling method for payment, according to an embodiment of the present invention.
FIG. 2 is a schematic diagram of a fee payment task queued for multiple payment paths.
Detailed Description
The following detailed description of the present invention is provided in connection with the accompanying drawings and specific embodiments for the purpose of better understanding and enabling those skilled in the art to practice the present invention, which are not intended to limit the present invention.
Referring to fig. 1, an embodiment of the present invention provides a method for scheduling a task of paying a fee, including the following steps:
s1: and receiving the fee payment tasks, and calculating the number of the currently queued fee payment tasks, the number of the available payment paths and the queuing time of each available payment path. The number of the currently queued payment tasks is the sum of the payment tasks currently queued for all the payment paths, and is used for reflecting the total number of the current tasks. The number of available payment paths is the total number of payment paths (e.g., settlement lanes) available for performing the fee payment task. If a payment path is offline, or the transaction is very slow, or the account balance is insufficient, the system marks the payment path as an unavailable payment path. The length of the queue for each available payment path depends on the one hand on the transaction speed (number of tasks completed per unit time) of the available payment path and on the other hand on the number of queued tasks for the channel.
S2: and judging whether the ratio of the number of the expense payment tasks to the number of the available payment paths is smaller than a preset value or not, if so, entering a step S3, and otherwise, entering a step S4. The ratio of the number of the fee payment tasks to the number of the available payment paths reflects the congestion degree of the current tasks, the higher the ratio is, the more congested the ratio is, the longer the completion time of a single fee payment task is, and the experience of the customer is affected, so a preset value (for example, 300) is set, when the ratio of the number of the fee payment tasks to the number of the available payment paths is smaller than the preset value, the current payment task is not congested, at the moment, a mode of low transaction rate can be selected to complete payment, the transaction cost is reduced, when the ratio is larger than the preset value, the current payment task is congested, at the moment, a mode of short queuing time (fast transaction) is selected to complete payment, and the experience of the customer is improved.
S3: and selecting the first N available payment paths with the transaction rates from low to high as a queuing channel, wherein N is greater than or equal to 2. When the payment tasks are not congested, the fee payment tasks are scheduled to be queued to the N available payment paths for which the transaction rate is lowest. N is generally between 2 and 5.
S4: and selecting the first N available payment paths with the queuing time length sorted from short to long as a queuing channel. And when the payment tasks are crowded, scheduling the payment tasks to N available payment paths with the shortest queuing time for queuing.
S5: referring to fig. 2, each received payment task is arranged in a payment task queue of N queuing channels, and the same payment tasks arranged in different payment task queues all have the same task code. In the prior art, for each payment task, polling is generally performed in all payment paths to select a payment path suitable for the payment task, when a plurality of settlement tasks need to be processed, the processing time is long, a part of merchants can obtain money late, and the user experience is poor. Therefore, in the invention, each expense payment task is queued in the N payment task queues respectively, so that each expense payment task does not need to be polled in each available payment path in sequence, the completion speed of each expense payment task can be increased, and the customer experience is improved. The same expense payment task is endowed with the same task code in different payment task queues, so that economic loss caused by repeated payment of the same expense payment task in different payment paths can be avoided. It should be noted that only four payment paths are illustrated in fig. 2, and actually, the payment paths of the acquirer may reach tens of payment paths or even hundreds of payment paths, and the cost payment task processed each day may reach millions.
S6: when any one of the payment tasks in the payment task queues of the N queuing channels enters the pre-payment state, the payment tasks which have the same task codes and do not enter the pre-payment state in other payment task queues are removed from the payment task queue where the payment tasks are located. Because the server needs a certain processing time to search and delete the expense payment tasks with the same task code from other payment task queues, if a certain expense payment task is completed and then other expense payment tasks with the same task code are deleted, other expense payment tasks with the same task code can be repeatedly executed in other queuing channels, and economic loss is caused. Therefore, the invention eliminates the same task from other payment task queues when the expense payment task enters the pre-payment state, thereby avoiding the problem of repeated payment. When the queue number of the charge payment task becomes a predetermined number X (i.e., only X-1 tasks are waiting before it), it is considered that the charge payment task enters a pre-payment state. The value may be 5, 10, 50, etc.
S7: and executing the payment task of entering the pre-payment state to complete the payment. And sequentially executing the payment tasks in the pre-payment state to complete the payment tasks. Steps S1 to S7 are repeated in this manner until all the fee payment tasks are performed.
In a preferred embodiment, in step S5, the arrangement order of the fee payment tasks with the same task code in different payment task queues is adjusted, so that the arrangement order of the fee payment tasks with the same task code in different payment task queues is different. For example, the queue number of the charge payment task may be moved forward (sequence number decreasing) in some of the payment task queues, and moved backward (sequence number increasing) in other of the payment task queues for the same task code. The payment tasks with the same task code are arranged in different payment task queues in different orders, so that a time difference is formed when the payment tasks enter the pre-payment state, and repeated payment is prevented.
In a preferred embodiment, in step S5, the arrangement order of the fee payment tasks with the same task code in different payment task queues is adjusted, so that the arrangement order of the fee payment tasks with the same task code in different payment task queues is different and the difference between the sequence numbers of adjacent sequence numbers is greater than a preset value. Similar to the above embodiment, the difference is that the difference between the sequence numbers of the adjacent sequence numbers is further limited to be larger than the preset value. The adjacent serial number refers to the serial number adjacent to the expense payment task of the same task code in the sequence number queue arranged in different payment task queues. For example, if the arrangement numbers of the payment task queues of the payment task a on the payment routes 1, 2, 3, and 4 are 1000, 1080, 1030, and 1090, the arrangement number queues formed are 1000, 1030, 1080, and 1090, and the minimum value of the number difference between adjacent numbers is 10. In the present embodiment, the preset value may be determined according to the processing time of the server for searching and deleting the charge payment task having the same task code from the other payment task queue and the speed of processing the charge payment task per payment path, and may be 10, 50, 100, etc. to avoid the duplicate payment.
In a preferred embodiment, in step S1, the transaction speed, the account balance status, and the number of queued tasks of each payment path are obtained, a payment path for which the transaction speed is greater than a preset speed value and the account balance is normal is recorded as an available payment path, and the queuing time of each available payment path is a quotient obtained by dividing the number of queued tasks by the transaction speed. The transaction speed refers to the number of completed fee payment tasks per unit time. If a certain payment path has too slow a transaction rate or if the account balance is too low (below the alert balance), it is listed as an unavailable payment path on which no charge payment task is scheduled.
In a preferred embodiment, in step S3, a queuing channel is selected by:
s31: selecting N available payment paths as alternative channels in the M available payment paths, wherein M is larger than N;
s32: determining the maximum value of the transaction rates of the N alternative channels;
s33: comparing transaction rates of the M-N remaining available payment paths in sequence with the transaction rate maximum;
s34: if the transaction rate of the currently compared remaining available payment path is less than the maximum transaction rate, replacing the alternative channel with the maximum transaction rate by the remaining available payment path, and returning to the step S32;
s35: and if the transaction rates of all the remaining available payment paths are greater than or equal to the maximum value of the transaction rates of the N alternative channels, taking the N alternative channels as the first N available payment paths with the transaction rates sorted from low to high, namely queuing channels.
In a preferred embodiment, in step S4, the queuing channel is selected by:
s41: selecting N available payment paths as alternative channels in the M available payment paths, wherein M is larger than N;
s42: determining the maximum value of the queuing time length of the N alternative channels;
s43: sequentially comparing the queuing time lengths of the M-N remaining available payment paths with the maximum value of the queuing time lengths;
s44: if the queuing time length of the currently compared remaining available payment path is less than the maximum queuing time length, replacing the alternative channel with the maximum queuing time length by the remaining available payment path, and returning to the step S42;
s45: and if the queuing time lengths of all the remaining available payment paths are greater than or equal to the maximum value of the queuing time lengths of the N alternative channels, taking the N alternative channels as the first N available payment paths with the queuing time lengths sorted from low to high, namely the queuing channels.
By the method, the available payment paths with the transaction rates ranging from low to N before the ranking or the queuing time ranging from low to N before the ranking are selected as the queuing channel, all M available payment paths do not need to be sequenced in sequence, the calculation amount can be greatly reduced, and particularly when M is large, the calculation speed is improved.
In a preferred embodiment, in step S7, when executing the task of paying fees for entering the pre-paid state, it is first queried whether any task of paying fees having the same task code has completed payment, if yes, the execution of the task of paying fees for entering the pre-paid state is terminated, and if not, the execution is continued. In this way, repeated payments may be avoided.
In a preferred embodiment, in step S1, the available payment path corresponding to the payable amount is screened according to the payable amount in the fee payment task. The payment amount limits (including upper limit, lower limit, etc.) defined for different available payment paths are different, so in step S1, the available payment path corresponding to the amount to be paid may be first screened according to the amount to be paid in the payment task. For example, if the payment limit of the payment path 1 is 5 ten thousand yuan at the upper limit, the payment limit of the payment path 2 is 10 ten thousand yuan at the upper limit, 100 yuan at the lower limit, the payment amount of the fee payment task 1 is 6 ten thousand yuan, and the payment amount of the fee payment task 2 is 50 yuan, the payment path 1 is not the available payment path for the fee payment task 1, and the payment path 2 is not the available payment path for the fee payment task 2.
The fee payment task scheduling method can select different payment paths according to the congestion degree of the current task. When the current payment task is not crowded, a payment path with lower transaction rate is selected to complete payment, so that the transaction cost is reduced, and when the current payment task is crowded, a payment path with shorter queuing time is selected to complete payment quickly, so that the customer experience is improved.
The embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements the steps of the fee payment task scheduling method according to any of the above embodiments.
The computer device may be a smart phone, a tablet computer, a notebook computer, a desktop computer, a rack server, a blade server, a tower server or a cabinet server (including an independent server or a server cluster composed of a plurality of servers) capable of executing programs, and the like. The computer device of the embodiment at least includes but is not limited to: a memory and a processor communicatively coupled to each other via a system bus.
In this embodiment, the memory (i.e., the readable storage medium) includes a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the memory may be an internal storage unit of the computer device, such as a hard disk or a memory of the computer device. In other embodiments, the memory may be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, provided on the computer device. Of course, the memory may also include both internal and external storage units of the computer device. In this embodiment, the memory is generally used for storing an operating system, various types of application software, and the like installed in the computer device. In addition, the memory may also be used to temporarily store various types of data that have been output or are to be output.
The processor may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor is typically used to control the overall operation of the computer device. In this embodiment, the processor is configured to run a program code stored in the memory or process data to implement the steps of the community discovery method described in the above embodiments.
Embodiments of the present invention further provide a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the steps of the above-mentioned method. The computer-readable storage medium may be a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, a server, an App application mall, etc.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (2)
1. A fee payment task scheduling method is characterized by comprising the following steps:
s1: receiving fee payment tasks, and calculating the number of the fee payment tasks, the number of available payment paths and the queuing time of each available payment path which are currently queued;
s2: judging whether the ratio of the number of the expense payment tasks to the number of the available payment paths is smaller than a preset value or not, if so, entering a step S3, and otherwise, entering a step S4;
s3: selecting the first N available payment paths with the transaction rates sorted from low to high as a queuing channel, wherein N is greater than or equal to 2;
s4: selecting the first N available payment paths sequenced from short to long in queuing time length as a queuing channel;
s5: respectively arranging each received expense payment task in a payment task queue of N queuing channels, wherein the same expense payment tasks arranged in different payment task queues have the same task code;
s6: when any one of the payment tasks in the payment task queues of the N queuing channels enters a pre-payment state, removing the payment tasks which have the same task codes and do not enter the pre-payment state in other payment task queues from the payment task queue where the payment tasks are located;
s7: executing the payment task entering the pre-payment state to complete the payment;
in step S3, a queuing channel is selected by:
s31: selecting N available payment paths as alternative channels in the M available payment paths, wherein M is larger than N;
s32: determining the maximum value of the transaction rates of the N alternative channels;
s33: comparing transaction rates of the M-N remaining available payment paths in sequence with the transaction rate maximum;
s34: if the transaction rate of the currently compared remaining available payment path is less than the maximum transaction rate, replacing the alternative channel with the maximum transaction rate by the remaining available payment path, and returning to the step S32;
s35: if the transaction rates of all the remaining available payment paths are greater than or equal to the maximum value of the transaction rates of the N alternative channels, taking the N alternative channels as the first N available payment paths with the transaction rates sorted from low to high, namely queuing channels;
in step S4, a queuing channel is selected by:
s41: selecting N available payment paths as alternative channels in the M available payment paths, wherein M is larger than N;
s42: determining the maximum value of the queuing time length of the N alternative channels;
s43: sequentially comparing the queuing time lengths of the M-N remaining available payment paths with the maximum value of the queuing time lengths;
s44: if the queuing time length of the remaining available payment path compared currently is smaller than the maximum queuing time length, replacing the alternative channel with the maximum queuing time length by the remaining available payment path, and returning to the step S42;
s45: if the queuing time lengths of all the remaining available payment paths are greater than or equal to the maximum value of the queuing time lengths of the N alternative channels, taking the N alternative channels as the first N available payment paths which are ranked from low queuing time lengths to high queuing time lengths, namely queuing channels;
in step S5, adjusting the arrangement sequence of the expense payment tasks with the same task code in different payment task queues to ensure that the arrangement sequence of the expense payment tasks with the same task code in different payment task queues is different and the difference of the sequence numbers of adjacent sequence numbers is larger than a preset value;
in the step S1, the transaction speed, the account balance state and the number of queuing tasks of each payment path are obtained, the payment path with the transaction speed larger than the preset speed value and the normal account balance is marked as an available payment path, and the queuing time of each available payment path is the quotient of the number of queuing tasks divided by the transaction speed;
in step S7, when executing the task of paying the fee to enter the pre-paid state, it is first inquired whether the task of paying the fee with the same task code has been completed, if yes, the execution of the task of paying the fee to enter the pre-paid state is terminated, and if not, the execution is continued;
in step S1, an available payment path corresponding to the amount to be paid is screened according to the amount to be paid in the payment task.
2. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor when executing the computer program performs the steps of the fee payment task scheduling method of claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211277772.0A CN115357367B (en) | 2022-10-19 | 2022-10-19 | Expense payment task scheduling method and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211277772.0A CN115357367B (en) | 2022-10-19 | 2022-10-19 | Expense payment task scheduling method and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115357367A CN115357367A (en) | 2022-11-18 |
| CN115357367B true CN115357367B (en) | 2023-03-14 |
Family
ID=84007667
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211277772.0A Active CN115357367B (en) | 2022-10-19 | 2022-10-19 | Expense payment task scheduling method and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115357367B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106033304A (en) * | 2015-03-19 | 2016-10-19 | 阿里巴巴集团控股有限公司 | Data interaction method and device |
| CN109784713A (en) * | 2019-01-09 | 2019-05-21 | 拉卡拉支付股份有限公司 | Form method, settlement method and the device of clearing task queue |
| CN114581094A (en) * | 2022-03-05 | 2022-06-03 | 浙江保融科技股份有限公司 | Payment channel dynamic decision method, server and computer readable medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110377433A (en) * | 2019-06-04 | 2019-10-25 | 威富通科技有限公司 | Asynchronous notification method, device and payment gateway, the storage medium of payment result |
-
2022
- 2022-10-19 CN CN202211277772.0A patent/CN115357367B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106033304A (en) * | 2015-03-19 | 2016-10-19 | 阿里巴巴集团控股有限公司 | Data interaction method and device |
| CN109784713A (en) * | 2019-01-09 | 2019-05-21 | 拉卡拉支付股份有限公司 | Form method, settlement method and the device of clearing task queue |
| CN114581094A (en) * | 2022-03-05 | 2022-06-03 | 浙江保融科技股份有限公司 | Payment channel dynamic decision method, server and computer readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115357367A (en) | 2022-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108711047B (en) | Automatic repayment method, system and terminal equipment | |
| CN106886847A (en) | A kind of method for processing resource and device | |
| US8146810B1 (en) | Systems and methods for automated reward redemption | |
| US20210081910A1 (en) | Systems, methods and apparatus for variable settlement accounts | |
| WO2007103940A2 (en) | Least cost network routing for electronic transactions | |
| CN109191090A (en) | Means of payment recommended method, device, equipment and computer readable storage medium | |
| US20150019393A1 (en) | Information processing apparatus and method, and non-transitory computer readable medium | |
| JP2018073249A (en) | Data checking program and data checking method | |
| CN111709777A (en) | Payment mode recommendation method, system, terminal device and storage medium | |
| CN107025137A (en) | A kind of resource query method and device | |
| CN109886676A (en) | Method of payment, calculating equipment, storage medium for block chain network | |
| EP1669919A1 (en) | A data processing system and data processing method | |
| US9830667B2 (en) | Computerized invoice record and receipt record matching with automatic discrepancy resolution | |
| CN115357367B (en) | Expense payment task scheduling method and computer equipment | |
| CN111311215A (en) | E-commerce platform settlement method and device, storage medium and settlement equipment | |
| US7708193B1 (en) | Systems and methods for automated reward redemption | |
| JP2002163458A (en) | Account transfer management method and device | |
| US11587092B2 (en) | System for dynamic prediction of interchange rates for credit card transaction processing | |
| CN115860952A (en) | Transaction processing method and device | |
| US11775969B2 (en) | Low latency bank card type prediction system for estimation of interchange codes during transaction processing | |
| US20220327546A1 (en) | Interchange code prediction system for processing credit card transactions | |
| CN109272321B (en) | Quick payment method, device, equipment and computer readable storage medium | |
| CN111192113A (en) | Order processing method, device, equipment and storage medium | |
| US11861666B2 (en) | Stochastic apparatus and method for estimating credit card type when predicting interchange code to process credit card transactions | |
| JP7383331B1 (en) | Information processing device and information processing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |