CN112598447A - Order information processing method and device, electronic equipment and processor - Google Patents
Order information processing method and device, electronic equipment and processor Download PDFInfo
- Publication number
- CN112598447A CN112598447A CN202011589303.3A CN202011589303A CN112598447A CN 112598447 A CN112598447 A CN 112598447A CN 202011589303 A CN202011589303 A CN 202011589303A CN 112598447 A CN112598447 A CN 112598447A
- Authority
- CN
- China
- Prior art keywords
- order
- target
- amount
- information
- module
- 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.)
- Granted
Links
Images
Classifications
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0249—Advertisements based upon budgets or funds
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0251—Targeted advertisements
- G06Q30/0269—Targeted advertisements based on user profile or attribute
- G06Q30/0271—Personalized advertisement
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0277—Online advertisement
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Abstract
The invention discloses a method and a device for processing order information, a nonvolatile storage medium and a processor. Wherein, the method comprises the following steps: receiving a push request sent by a media side, wherein the push request comprises: the order collection of the self-media information to be pushed; reading the order information of each order in the order set of the self-media information in sequence, wherein the order information of each order comprises: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount; screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority; and adjusting the schedule of the target order based on the order amount floating value of the target order. The invention solves the technical problems of inaccurate scheduling of advertisement putting orders and low order processing efficiency in the prior art.
Description
Technical Field
The invention relates to the field of information processing, in particular to a method and a device for processing order information, a nonvolatile storage medium and a processor.
Background
In the related art, before advertisement placement, each self-media generally has a fixed budget that is preset according to the known media flow and the client purchasing crowd.
Because the budget is fixed, sometimes the exposure target can not be finished frequently due to the pushing amount of partial media advertisement spots, and some media advertisement spots with more suitable flow rate and sufficient flow rate can not continue to receive the amount after reaching the scheduling upper limit. Resulting in a situation where the completion rate of the wave-shaping activity is not high or the budget is not spent at a given time.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
The embodiment of the invention provides a method and a device for processing order information, a nonvolatile storage medium and a processor, which are used for at least solving the technical problems of inaccurate scheduling of advertisement putting orders and low order processing efficiency in the prior art.
According to an aspect of the embodiments of the present invention, there is provided a method for processing order information, including: receiving a push request sent by a media side, wherein the push request comprises: the order collection of the self-media information to be pushed; reading the order information of each order in the order set of the self-media information in sequence, wherein the order information of each order comprises: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount; screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority; and adjusting the schedule of the target order based on the order amount floating value of the target order.
Optionally, screening out the target order with the highest priority from the order set includes: acquiring a first group of orders of which the order budgets exceed a lower limit interval in the order set and a second group of orders of which the order budgets do not exceed the lower limit interval; obtaining a first remaining amount of the order budget for the first set of orders and a second remaining amount of the order budget for the second set of orders; and if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold value, acquiring the order with the highest order priority in the order set as the target order.
Optionally, if the total remaining amount of the first remaining amount and the second remaining amount does not exceed the threshold, the push request is returned.
Optionally, adjusting the schedule of the target order based on the order amount floating value of the target order includes: acquiring the order payment state of the target order and an upper limit difference value of the target order, wherein the upper limit difference value is determined by an order amount floating value of the target order; if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the scheduling of the target order is increased; otherwise, the scheduling of the target order is reduced.
Optionally, after adjusting the schedule of the target order based on the floating value of the order amount of the target order, the method further includes: removing the target orders with the regulated scheduling from the order set to generate a residual order set; wherein, the target order is a first order in the order set; returning to continuously and sequentially reading the order information of each order in the residual order set; and obtaining the order with the highest order priority from the residual order set to obtain a second order in sequence, wherein the second order in sequence is the order with the highest priority which needs to be scheduled in the residual order set.
According to another aspect of the embodiments of the present invention, there is also provided an order information processing apparatus, including: a receiving module, configured to receive a push request sent by a media side, where the push request includes: the order collection of the self-media information to be pushed; a reading module, configured to read order information of each order in the order set of the self-media information in sequence, where the order information of each order includes: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount; the screening module is used for screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority; and the adjusting module is used for adjusting the schedule of the target order based on the order amount floating value of the target order.
Optionally, the screening module includes: a first sub-obtaining module, configured to obtain a first group of orders in the order set whose order budget exceeds a lower limit interval, and a second group of orders whose order budget does not exceed the lower limit interval; a second sub-obtaining module, configured to obtain a first remaining amount of the order budget of the first group of orders and a second remaining amount of the order budget of the second group of orders; and a third sub-obtaining module, configured to, if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold, obtain an order with a highest order priority in the order set as the target order.
Optionally, the screening module further includes: and the returning module is used for returning the pushing request if the total remaining amount of the first remaining amount and the second remaining amount does not exceed a threshold value.
Optionally, the adjusting module includes: a third sub-obtaining module, configured to obtain the order payment status of the target order and an upper limit difference of the target order, where an order amount floating value of the target order determines the upper limit difference; the heightening module is used for heightening the schedule of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value; and the reduction module is used for reducing the scheduling of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity does not exceed the upper limit difference.
Optionally, the apparatus further comprises: a generating module, configured to remove the target order with the schedule adjusted from the order set, and generate a remaining order set; wherein, the target order is a first order in the order set; a returning module, configured to return to continue to sequentially read the order information of each order in the remaining order sets; and the obtaining module is used for obtaining the order with the highest order priority from the residual order set to obtain a second order, wherein the second order is the order with the highest priority, the scheduling of which needs to be adjusted, in the residual order set.
According to another aspect of the embodiments of the present invention, there is also provided a non-volatile storage medium, where the non-volatile storage medium stores a plurality of instructions, and the instructions are adapted to be loaded by a processor and execute any one of the above processing methods for order information.
According to another aspect of the embodiments of the present invention, there is also provided a processor, configured to execute a program, where the program is configured to execute any one of the processing methods of the order information when running.
According to another aspect of the embodiments of the present invention, there is also provided an electronic device, including a memory and a processor, where the memory stores a computer program, and the processor is configured to execute the computer program to perform any one of the above processing methods for order information.
In the embodiment of the present invention, a push request sent by a media side is received, where the push request includes: the order collection of the self-media information to be pushed; reading the order information of each order in the order set of the self-media information in sequence, wherein the order information of each order comprises: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount; screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority; based on the order amount floating value of the target order, the schedule of the target order is adjusted, and the purpose of improving the schedule accuracy of the advertisement putting order is achieved, so that the technical effect of improving the order processing efficiency is achieved, and the technical problems that the schedule of the advertisement putting order is inaccurate and the order processing efficiency is low in the prior art are solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
fig. 1 is a flowchart of a method for processing order information according to an embodiment of the present invention;
FIG. 2 is a flow chart of an alternative method of processing order information according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an order information processing apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
In accordance with an embodiment of the present invention, there is provided an embodiment of a method for processing order information, it should be noted that the steps illustrated in the flowchart of the drawings may be performed in a computer system such as a set of computer executable instructions, and that although a logical order is illustrated in the flowchart, in some cases the steps illustrated or described may be performed in an order different than that presented herein.
Fig. 1 is a flowchart of a method for processing order information according to an embodiment of the present invention, and as shown in fig. 1, the method includes the following steps:
step S102, receiving a push request sent by a media side, wherein the push request comprises: the order collection of the self-media information to be pushed;
step S104, sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order includes: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount;
step S106, screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority;
and step S108, adjusting the schedule of the target order based on the order amount floating value of the target order.
In the embodiment of the present invention, a push request sent by a media side is received, where the push request includes: the order collection of the self-media information to be pushed; reading the order information of each order in the order set of the self-media information in sequence, wherein the order information of each order comprises: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount; screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority; based on the order amount floating value of the target order, the schedule of the target order is adjusted, and the purpose of improving the schedule accuracy of the advertisement putting order is achieved, so that the technical effect of improving the order processing efficiency is achieved, and the technical problems that the schedule of the advertisement putting order is inaccurate and the order processing efficiency is low in the prior art are solved.
In this embodiment, the above order amount floating value refers to that budget allocation automatically floats among media in percentage, the traffic pushing is in accordance with the amount of large transmission and can allocate budgets for multiple times, the budget floats up until reaching the set floating value, otherwise, the traffic is less and only the budget floating value can be received, that is, the budget allocation automatically floats among the media in percentage, and the total budget is not changed.
Optionally, in this embodiment of the present application, the total budget is obtained by relying on the CPM prices of each media from the media client and the CPM amount bought by the client, and each media budget is automatically floated (1 +/-set floating percentage) after controlling the total budget.
In the embodiment of the application, the CPM of each self-media is set, the price and the floating percentage are set, the cost of each media is calculated according to the following algorithm within 5 minutes, the more suitable media are received by the upper floating value of 1+, and the less media are received by the lower floating value of 1 till the budget is spent.
Through the embodiment of the application, budget allocation automatically floats among media according to percentage, so that budget is allocated reasonably and better, and the problem that fixed budget cannot be spent in specified time can be solved; budget allocations automatically float between media by percentage, floating on their own without exceeding the total budget.
As an alternative example, assume that a particular placement campaign contains orders as shown in Table 1 below:
TABLE 1
Wherein, the unit price of the advertisement space is: refers to the unit price of a certain advertising position of a certain media in a certain charging mode.
Original scheduling budget: refers to the initial budget cost that a particular delivery activity sets for each order involved when it was initially created.
Upper float value: refers to the percentage of spending that a particular delivery campaign, when initially created, sets the allowance for each included order to exceed the original scheduling budget.
Lower float value: refers to the percentage of spending that a particular delivery campaign, when initially created, places on each of the orders involved with a lower allowance than the original scheduling budget.
Current cost: refers to the real-time cost of each order contained in a put for a certain placement activity.
The current state is as follows: refers to the magnitude relationship between the difference between the current spending and the original scheduling budget and the upper and lower float values.
In an optional embodiment, screening out the target order with the highest priority from the order set includes:
step S202, a first group of orders in the order set with the order budgets exceeding a lower limit interval and a second group of orders with the order budgets not exceeding the lower limit interval are obtained;
step S204, acquiring a first residual amount of the order budget of the first group of orders and a second residual amount of the order budget of the second group of orders;
step S206, if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold, acquiring an order with the highest order priority in the order set as the target order.
In an alternative embodiment, the push request is returned if the total remaining amount of the first remaining amount and the second remaining amount does not exceed a threshold.
In the embodiment of the present application, as shown in fig. 2, first, it is determined whether all the orders spend exceeding a lower limit, and if the orders spend exceeding the lower limit, the remaining allocable budget and X of the orders whose budgets exceed the lower limit are calculated in a manner that: the remaining allocable budget for the exceeded lower bound order and the original installment budget for each order-the current cost, i.e., X ═ (a1-D1) + (a2-D2) + (A3-D3); if the lower limit is not exceeded, calculating the residual allocable budget and Y of the order with the budget not exceeding the lower limit, wherein the calculation mode is as follows: the remaining allocable budget for the non-exceeded lower limit order and the floating value under each order original scheduling budget, i.e., Y ═ a4 × C4) + (a5 × C5).
In an alternative embodiment, adjusting the schedule of the target order based on the floating value of the order amount of the target order comprises:
step S302, obtaining the order payment state of the target order and the upper limit difference value of the target order, wherein the upper limit difference value is determined by the order amount floating value of the target order;
step S304, if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the scheduling of the target order is increased;
step S306, otherwise, the scheduling of the target order is reduced.
In the embodiment of the present application, as also shown in fig. 2, it is determined whether the sum of the remaining allocable budget sum of the exceeded lower limit order and the remaining allocable budget sum of the non-exceeded lower limit order is greater than or equal to the order yield upper limit difference, that is, Z < ═ X + Y. If so, the order is set to A X (1+ B) and the value of X + Y is refreshed to X + Y-Z. Judging whether a next order is available according to the unit price ordering of the advertisement space, if so, returning to execute to judge whether the cost of the first order selected in the previous step reaches the lower limit, otherwise, ending; if not, the new ranking of the order is set to D + X + Y, and the new ranking of the remaining order is set to A (1-C), and the process is finished.
In an optional embodiment, after adjusting the schedule of the target order based on the floating value of the order amount of the target order, the method further comprises:
step S402, removing the target orders with the regulated scheduling from the order set, and generating a residual order set; wherein, the target order is a first order in the order set;
step S404, returning to continuously and sequentially reading the order information of each order in the residual order set;
step S406, obtaining an order with the highest order priority from the remaining order set to obtain a second order in rank, where the second order in rank is the order with the highest priority that needs to adjust the ranking in the remaining order set.
In the embodiment of the application, if it is determined whether the sum of the remaining allocable budget sum of the exceeded lower limit order and the remaining allocable budget sum of the un-exceeded lower limit order is less than or equal to 0, that is, X + Y < 0. If X + Y is 0, directly returning the flow (namely directly returning without receiving when the media side sends an advertisement request); if X + Y >0, then the first in-order is selected according to the advertising spot unit price ordering.
As an alternative embodiment, by determining whether the cost of the first in-line order selected in the previous step has reached the lower limit, if not, setting the new ranking of the order to a (1-C), then determining whether there is a next in-line order according to the unit price ranking of the advertisement space, if so, repeatedly executing the process to determine whether the cost of the first in-line order selected in the previous step has reached the lower limit, otherwise, ending the process, and if so, entering the process to determine whether the order has reached the upper limit.
In the embodiment of the application, whether the order reaches the upper limit is judged, if the order reaches the upper limit, the new scheduling of the order is set as A (1+ B), whether the next in-order exists according to the unit price ranking of the advertisement space is judged, if the next in-order exists, the execution is returned to judge whether the cost of the first in-order selected in the previous step reaches the lower limit, and if not, the execution is ended; if the upper limit is not reached, calculating the difference value Z of the upper limit of the order yield, wherein the calculation mode is as follows: the order upper limit yield difference is the order original scheduling budget (1+ floating value on the order) -the current cost, i.e., Z is a (1+ B) -D.
As an alternative embodiment, the following description is made by taking a certain delivery activity as an example:
as shown in table 2 below, the present delivery activity includes 5 orders, D1, D2, D3, D4 and D5, the original scheduling budgets (i.e., budgets in the upper graph) are 1000, 4000, 9000, 16000 and 25000, the upper float values are 0.05, 0.04, 0.03, 0.02 and 0.01, the lower float values are 0.01, 0.02, 0.03, 0.04 and 0.04, and the current costs (i.e., actual costs in the upper graph) are 1010, 4000, 9000, 15000 and 25000, respectively.
TABLE 2
Respectively calculating the upper limit and the lower limit of the five orders, judging whether the upper limit and the lower limit are exceeded or not, and calculating the lower limit allocable value condition of the orders to obtain the results shown in the following table 3:
TABLE 3
From table 3 above, it can be calculated that orders D1, D2, D3, and D5 have exceeded the lower limit, and order D4 has not exceeded the lower limit, so the remaining allocable budget sum X of the budget exceeded the lower limit order is-10 +0+0+0, that is, X is-10; the remaining allocable budget sum Y of the non-overrun order is 16000 × 0.04, i.e., Y is 640; further, X + Y-10 + 640-630.
Obviously, X + Y > 630, the slot unit price sorting selects the first in-order D1, determines whether the order cost of D1 has reached the lower limit, obviously, the order cost of D1 has reached the lower limit, and then determines whether the order cost of D1 has reached the upper limit, obviously, the order cost of D1 has not reached the upper limit. Therefore, the D1 order yield upper limit difference Z is calculated to be 1000 (1+0.05) -1010, i.e., Z is 40, and obviously Z < X + Y, the D1 order schedule is updated to be 1000 (1+0.05), i.e., 1050, and X + Y is updated to be X + Y-Z, i.e., 590. By analogy, the calculated new scheduling budget for all orders is shown in table 4 below:
TABLE 4
As can be seen from the above, by the order information processing method provided in the embodiment of the present application, it is possible to dynamically and reasonably allocate each order budget according to the actual yield situation, and control the overall budget error within a reasonable range.
Example 2
According to an embodiment of the present invention, an embodiment of an apparatus for implementing the method for processing order information is further provided, fig. 3 is a schematic structural diagram of an order information processing apparatus according to an embodiment of the present invention, and as shown in fig. 3, the order information processing apparatus includes: a receiving module 300, a reading module 302, a screening module 304, and an adjusting module 306, wherein:
a receiving module 300, configured to receive a push request sent by a media side, where the push request includes: the order collection of the self-media information to be pushed; a reading module 302, configured to read order information of each order in the order set of the self-media information in sequence, where the order information of each order includes: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount; a screening module 304, configured to screen out a target order with a highest priority from the order set, where the target order represents self-media information with a highest scheduling priority; the adjusting module 306 is configured to adjust the schedule of the target order based on the order amount floating value of the target order.
It should be noted that the receiving module 300, the reading module 302, the filtering module 304 and the adjusting module 306 correspond to steps S102 to S108 in embodiment 1, and the modules are the same as the corresponding steps in the implementation example and application scenarios, but are not limited to the disclosure in embodiment 1. It should be noted that the modules described above may be implemented in a computer terminal as part of an apparatus.
In an optional embodiment, the screening module includes: a first sub-obtaining module, configured to obtain a first group of orders in the order set whose order budget exceeds a lower limit interval, and a second group of orders whose order budget does not exceed the lower limit interval; a second sub-obtaining module, configured to obtain a first remaining amount of the order budget of the first group of orders and a second remaining amount of the order budget of the second group of orders; and a third sub-obtaining module, configured to, if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold, obtain an order with a highest order priority in the order set as the target order.
In an optional embodiment, the screening module further includes: and the returning module is used for returning the pushing request if the total remaining amount of the first remaining amount and the second remaining amount does not exceed a threshold value.
In an optional embodiment, the adjusting module includes: a third sub-obtaining module, configured to obtain the order payment status of the target order and an upper limit difference of the target order, where an order amount floating value of the target order determines the upper limit difference; the heightening module is used for heightening the schedule of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value; and the reduction module is used for reducing the scheduling of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity does not exceed the upper limit difference.
In an optional embodiment, the apparatus further comprises: a generating module, configured to remove the target order with the schedule adjusted from the order set, and generate a remaining order set; wherein, the target order is a first order in the order set; a returning module, configured to return to continue to sequentially read the order information of each order in the remaining order sets; and the obtaining module is used for obtaining the order with the highest order priority from the residual order set to obtain a second order, wherein the second order is the order with the highest priority, the scheduling of which needs to be adjusted, in the residual order set.
It should be noted that the above modules may be implemented by software or hardware, for example, for the latter, the following may be implemented: the modules can be located in the same processor; alternatively, the modules may be located in different processors in any combination.
It should be noted that, reference may be made to the relevant description in embodiment 1 for alternative or preferred embodiments of this embodiment, and details are not described here again.
The above processing apparatus for order information may further include a processor and a memory, where the receiving module 300, the reading module 302, the filtering module 304, the adjusting module 306, and the like are all stored in the memory as program units, and the processor executes the program units stored in the memory to implement corresponding functions.
The processor comprises a kernel, and the kernel calls a corresponding program unit from the memory, wherein one or more than one kernel can be arranged. The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
According to an embodiment of the present application, there is also provided an embodiment of a non-volatile storage medium. Optionally, in this embodiment, the nonvolatile storage medium includes a stored program, and the apparatus where the nonvolatile storage medium is located is controlled to execute the processing method of any one of the order information when the program runs.
Optionally, in this embodiment, the nonvolatile storage medium may be located in any one of a group of computer terminals in a computer network, or in any one of a group of mobile terminals, and the nonvolatile storage medium includes a stored program.
Optionally, the apparatus in which the non-volatile storage medium is controlled to perform the following functions when the program is executed: receiving a push request sent by a media side, wherein the push request comprises: the order collection of the self-media information to be pushed; reading the order information of each order in the order set of the self-media information in sequence, wherein the order information of each order comprises: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount; screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority; and adjusting the schedule of the target order based on the order amount floating value of the target order.
Optionally, the apparatus in which the non-volatile storage medium is controlled to perform the following functions when the program is executed: acquiring a first group of orders of which the order budgets exceed a lower limit interval in the order set and a second group of orders of which the order budgets do not exceed the lower limit interval; obtaining a first remaining amount of the order budget for the first set of orders and a second remaining amount of the order budget for the second set of orders; and if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold value, acquiring the order with the highest order priority in the order set as the target order.
Optionally, the apparatus in which the non-volatile storage medium is controlled to perform the following functions when the program is executed: and returning the push request if the total remaining quantity of the first remaining quantity and the second remaining quantity does not exceed a threshold value.
Optionally, the apparatus in which the non-volatile storage medium is controlled to perform the following functions when the program is executed: acquiring the order payment state of the target order and an upper limit difference value of the target order, wherein the upper limit difference value is determined by an order amount floating value of the target order; if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the scheduling of the target order is increased; otherwise, the scheduling of the target order is reduced.
Optionally, the apparatus in which the non-volatile storage medium is controlled to perform the following functions when the program is executed: removing the target orders with the regulated scheduling from the order set to generate a residual order set; wherein, the target order is a first order in the order set; returning to continuously and sequentially reading the order information of each order in the residual order set; and obtaining the order with the highest order priority from the residual order set to obtain a second order in sequence, wherein the second order in sequence is the order with the highest priority which needs to be scheduled in the residual order set.
According to an embodiment of the present application, there is also provided an embodiment of a processor. Optionally, in this embodiment, the processor is configured to execute a program, where the program executes the processing method of any one of the order information.
According to an embodiment of the present application, there is further provided an embodiment of an electronic device, including a memory and a processor, where the memory stores a computer program, and the processor is configured to execute the computer program to perform any one of the above order information processing methods.
According to an embodiment of the present application, there is also provided an embodiment of a computer program product, which is adapted to execute a program that initializes the steps of the processing method with any of the above-mentioned order information when executed on a data processing device.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
In the above embodiments of the present invention, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units may be a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable non-volatile storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a non-volatile storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned nonvolatile storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.
Claims (13)
1. A processing method of order information is characterized by comprising the following steps:
receiving a push request sent by a media side, wherein the push request comprises: the order collection of the self-media information to be pushed;
sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount;
screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority;
and adjusting the schedule of the target order based on the order amount floating value of the target order.
2. The method of claim 1, wherein screening the highest priority target order from the set of orders comprises:
acquiring a first group of orders of which the order budgets exceed a lower limit interval in the order set and a second group of orders of which the order budgets do not exceed the lower limit interval;
obtaining a first remaining amount of an order budget for the first set of orders and a second remaining amount of an order budget for the second set of orders;
and if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold value, acquiring the order with the highest order priority in the order set as the target order.
3. The method of claim 2, wherein the push request is returned if the total remaining amount of the first remaining amount and the second remaining amount does not exceed the threshold.
4. The method of claim 2, wherein adjusting the rank of the target order based on the floating value of the order amount of the target order comprises:
acquiring the order payment state of the target order and an upper limit difference value of the target order, wherein the upper limit difference value is determined by an order amount floating value of the target order;
if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the scheduling of the target order is increased;
otherwise, the scheduling of the target order is reduced.
5. The method of any of claims 1 to 4, wherein after adjusting the schedule of the target order based on the floating value of the order amount of the target order, the method further comprises:
removing the target orders with the regulated scheduling from the order set to generate a residual order set; wherein the target order is a first order in the order set;
returning and continuously reading the order information of each order in the remaining order set in sequence;
and obtaining the order with the highest order priority from the residual order set to obtain a second order, wherein the second order is the order with the highest priority, of which the scheduling needs to be adjusted, in the residual order set.
6. An order information processing apparatus, comprising:
a receiving module, configured to receive a push request sent by a media side, where the push request includes: the order collection of the self-media information to be pushed;
a reading module, configured to read order information of each order in the order set of the self-media information in sequence, where the order information of each order includes: order identification, order payment state, order priority, order budget, order amount and floating value of the order amount;
the screening module is used for screening out a target order with the highest priority from the order set, wherein the target order represents self-media information with the highest scheduling priority;
and the adjusting module is used for adjusting the schedule of the target order based on the order amount floating value of the target order.
7. The apparatus of claim 6, wherein the screening module comprises:
the first sub-acquisition module is used for acquiring a first group of orders of which the order budgets exceed a lower limit interval in the order set and a second group of orders of which the order budgets do not exceed the lower limit interval;
a second sub-obtaining module, configured to obtain a first remaining amount of the order budget of the first group of orders and a second remaining amount of the order budget of the second group of orders;
and a third sub-obtaining module, configured to obtain, if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold, an order with a highest order priority in the order set as the target order.
8. The apparatus of claim 7, wherein the screening module further comprises: and the returning module is used for returning the pushing request if the total remaining quantity of the first remaining quantity and the second remaining quantity does not exceed a threshold value.
9. The apparatus of claim 7, wherein the adjustment module comprises:
a third sub-obtaining module, configured to obtain the order payment status of the target order and an upper limit difference of the target order, where an order amount floating value of the target order determines the upper limit difference;
the heightening module is used for heightening the schedule of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value;
and the reduction module is used for reducing the scheduling of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity does not exceed the upper limit difference value.
10. The apparatus of any one of claims 6 to 9, further comprising:
the generating module is used for removing the target orders with the regulated scheduling from the order set and generating a residual order set; wherein the target order is a first order in the order set;
the returning module is used for returning and continuously reading the order information of each order in the remaining order set in turn;
and the obtaining module is used for obtaining the order with the highest order priority from the remaining order set to obtain a second order, wherein the second order is the order with the highest priority, the scheduling of which needs to be adjusted, in the remaining order set.
11. A non-volatile storage medium, characterized in that it stores a plurality of instructions adapted to be loaded by a processor and to execute the processing method of order information according to any one of claims 1 to 5.
12. A processor, characterized in that the processor is configured to run a program, wherein the program is configured to execute the processing method of order information according to any one of claims 1 to 5 when running.
13. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the computer program to perform the method of processing order information according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011589303.3A CN112598447B (en) | 2020-12-28 | 2020-12-28 | Order information processing method and device, electronic equipment and processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011589303.3A CN112598447B (en) | 2020-12-28 | 2020-12-28 | Order information processing method and device, electronic equipment and processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112598447A true CN112598447A (en) | 2021-04-02 |
| CN112598447B CN112598447B (en) | 2023-10-10 |
Family
ID=75203300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011589303.3A Active CN112598447B (en) | 2020-12-28 | 2020-12-28 | Order information processing method and device, electronic equipment and processor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112598447B (en) |
Citations (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060248533A1 (en) * | 2005-04-28 | 2006-11-02 | Fujitsu Limited | Method and apparatus for batch scheduling, and computer product |
| US20070271134A1 (en) * | 2006-05-20 | 2007-11-22 | Lan International, Inc., | System and Method for Scheduling Advertisements |
| US20080027802A1 (en) * | 2006-07-31 | 2008-01-31 | Yahoo! Inc. | System and method for scheduling online keyword subject to budget constraints |
| US20080089229A1 (en) * | 2004-11-10 | 2008-04-17 | Telefonaktiebolaget Lm Ericsson (Publ) | Congestion Control In a Wireless Mobile System |
| US20100191558A1 (en) * | 2009-01-26 | 2010-07-29 | Microsoft Corporation | Linear-program formulation for optimizing inventory allocation |
| US20130024286A1 (en) * | 2011-07-21 | 2013-01-24 | Microsoft Corporation | Multiple slack variables for balancing ad campaign risks |
| US20130110622A1 (en) * | 2010-11-12 | 2013-05-02 | Huawei Technologies Co., Ltd. | Advertisement Order Booking Method and System, and Advertisement Delivery Method |
| CN104252650A (en) * | 2014-09-30 | 2014-12-31 | 北京工商大学 | Automated instant digital sign advertisement release method |
| CN105184614A (en) * | 2015-09-14 | 2015-12-23 | 北京工商大学 | Distributed digital signage advertisement delivery method based on Storm platform |
| US20160150280A1 (en) * | 2014-11-24 | 2016-05-26 | The Nielsen Company (Us), Llc. | Methods and apparatus to project ratings for future broadcasts of media |
| CN106447392A (en) * | 2016-09-19 | 2017-02-22 | 东莞市东信网络技术有限公司 | RTB (real-time bidding) advertisement based intelligent bidding power flow tracing algorithm |
| US20170278129A1 (en) * | 2016-03-23 | 2017-09-28 | Sk Planet Co., Ltd. | Apparatus, method and recording medium for providing advertisement |
| CN107481029A (en) * | 2017-07-13 | 2017-12-15 | 北京奇艺世纪科技有限公司 | A kind of Forecasting Methodology and device of the stock of publicity orders |
| CN107707369A (en) * | 2017-09-30 | 2018-02-16 | 广东欧珀移动通信有限公司 | The method and apparatus of flow order management, computer equipment, readable storage medium storing program for executing |
| WO2018036307A1 (en) * | 2016-08-23 | 2018-03-01 | 腾讯科技（深圳）有限公司 | Information processing method utilized in pushing information order, allocation method, device, and data storage medium |
| WO2018145652A1 (en) * | 2017-02-09 | 2018-08-16 | 腾讯科技（深圳）有限公司 | Media data processing method, server and storage medium |
| WO2018149371A1 (en) * | 2017-02-15 | 2018-08-23 | 腾讯科技（深圳）有限公司 | Flow and service allocation method and apparatus for push information order, and storage medium |
| CN109509022A (en) * | 2018-10-25 | 2019-03-22 | 北京奇虎科技有限公司 | Ad traffic distribution method, advertisement transaction platform, server and storage medium |
| CN109688196A (en) * | 2018-11-19 | 2019-04-26 | 北京三快在线科技有限公司 | Method for pushing, device, electronic equipment and the readable storage medium storing program for executing of order status |
| JP2019111795A (en) * | 2017-12-26 | 2019-07-11 | 京セラドキュメントソリューションズ株式会社 | Image formation apparatus and consumable supply order placement timing notification method |
| CN110020894A (en) * | 2019-04-03 | 2019-07-16 | 腾讯科技（深圳）有限公司 | Information processing method, device and server |
| KR102031138B1 (en) * | 2018-05-25 | 2019-10-11 | 주식회사 케이디아이덴 | System for Target Advertisement Using System for Ordering Food Cooked by User-Selected of Customizing Ingredients through Internet |
| CN110502474A (en) * | 2019-06-26 | 2019-11-26 | 中电万维信息技术有限责任公司 | Order allocation method, device and storage medium based on distributed memory system |
| CN111192077A (en) * | 2019-12-16 | 2020-05-22 | 加和（北京）信息科技有限公司 | Advertisement traffic multiplexing method and device, storage medium and electronic device |
| CN111311310A (en) * | 2020-01-20 | 2020-06-19 | 加和（北京）信息科技有限公司 | Advertisement order pushing method and device, storage medium and electronic device |
| CN111724229A (en) * | 2020-05-13 | 2020-09-29 | 时时同云科技(成都)有限责任公司 | Object recommendation method and device, and object display method and device |
-
2020
- 2020-12-28 CN CN202011589303.3A patent/CN112598447B/en active Active
Patent Citations (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080089229A1 (en) * | 2004-11-10 | 2008-04-17 | Telefonaktiebolaget Lm Ericsson (Publ) | Congestion Control In a Wireless Mobile System |
| US20060248533A1 (en) * | 2005-04-28 | 2006-11-02 | Fujitsu Limited | Method and apparatus for batch scheduling, and computer product |
| US20070271134A1 (en) * | 2006-05-20 | 2007-11-22 | Lan International, Inc., | System and Method for Scheduling Advertisements |
| US20080027802A1 (en) * | 2006-07-31 | 2008-01-31 | Yahoo! Inc. | System and method for scheduling online keyword subject to budget constraints |
| US20100191558A1 (en) * | 2009-01-26 | 2010-07-29 | Microsoft Corporation | Linear-program formulation for optimizing inventory allocation |
| US20130110622A1 (en) * | 2010-11-12 | 2013-05-02 | Huawei Technologies Co., Ltd. | Advertisement Order Booking Method and System, and Advertisement Delivery Method |
| US20130024286A1 (en) * | 2011-07-21 | 2013-01-24 | Microsoft Corporation | Multiple slack variables for balancing ad campaign risks |
| CN104252650A (en) * | 2014-09-30 | 2014-12-31 | 北京工商大学 | Automated instant digital sign advertisement release method |
| US20160150280A1 (en) * | 2014-11-24 | 2016-05-26 | The Nielsen Company (Us), Llc. | Methods and apparatus to project ratings for future broadcasts of media |
| CN105184614A (en) * | 2015-09-14 | 2015-12-23 | 北京工商大学 | Distributed digital signage advertisement delivery method based on Storm platform |
| US20170278129A1 (en) * | 2016-03-23 | 2017-09-28 | Sk Planet Co., Ltd. | Apparatus, method and recording medium for providing advertisement |
| WO2018036307A1 (en) * | 2016-08-23 | 2018-03-01 | 腾讯科技（深圳）有限公司 | Information processing method utilized in pushing information order, allocation method, device, and data storage medium |
| CN106447392A (en) * | 2016-09-19 | 2017-02-22 | 东莞市东信网络技术有限公司 | RTB (real-time bidding) advertisement based intelligent bidding power flow tracing algorithm |
| CN108415908A (en) * | 2017-02-09 | 2018-08-17 | 腾讯科技（北京）有限公司 | A kind of processing method and server of multi-medium data |
| WO2018145652A1 (en) * | 2017-02-09 | 2018-08-16 | 腾讯科技（深圳）有限公司 | Media data processing method, server and storage medium |
| WO2018149371A1 (en) * | 2017-02-15 | 2018-08-23 | 腾讯科技（深圳）有限公司 | Flow and service allocation method and apparatus for push information order, and storage medium |
| CN107481029A (en) * | 2017-07-13 | 2017-12-15 | 北京奇艺世纪科技有限公司 | A kind of Forecasting Methodology and device of the stock of publicity orders |
| CN107707369A (en) * | 2017-09-30 | 2018-02-16 | 广东欧珀移动通信有限公司 | The method and apparatus of flow order management, computer equipment, readable storage medium storing program for executing |
| JP2019111795A (en) * | 2017-12-26 | 2019-07-11 | 京セラドキュメントソリューションズ株式会社 | Image formation apparatus and consumable supply order placement timing notification method |
| KR102031138B1 (en) * | 2018-05-25 | 2019-10-11 | 주식회사 케이디아이덴 | System for Target Advertisement Using System for Ordering Food Cooked by User-Selected of Customizing Ingredients through Internet |
| CN109509022A (en) * | 2018-10-25 | 2019-03-22 | 北京奇虎科技有限公司 | Ad traffic distribution method, advertisement transaction platform, server and storage medium |
| CN109688196A (en) * | 2018-11-19 | 2019-04-26 | 北京三快在线科技有限公司 | Method for pushing, device, electronic equipment and the readable storage medium storing program for executing of order status |
| CN110020894A (en) * | 2019-04-03 | 2019-07-16 | 腾讯科技（深圳）有限公司 | Information processing method, device and server |
| CN110502474A (en) * | 2019-06-26 | 2019-11-26 | 中电万维信息技术有限责任公司 | Order allocation method, device and storage medium based on distributed memory system |
| CN111192077A (en) * | 2019-12-16 | 2020-05-22 | 加和（北京）信息科技有限公司 | Advertisement traffic multiplexing method and device, storage medium and electronic device |
| CN111311310A (en) * | 2020-01-20 | 2020-06-19 | 加和（北京）信息科技有限公司 | Advertisement order pushing method and device, storage medium and electronic device |
| CN111724229A (en) * | 2020-05-13 | 2020-09-29 | 时时同云科技(成都)有限责任公司 | Object recommendation method and device, and object display method and device |
Non-Patent Citations (4)
| Title |
|---|
| JIE YAN，等: "The Research of Oxygen Measurement by TDLAS Based on Levenberg-Marquardt Nonlinear Fitting", GUANG PU XUE YU GUANG PU FEN XI, vol. 35, no. 06, pages 1497 - 500 * |
| 南开辉，等: "分布式电源配电网造价风险评估仿真研究", 计算机仿真, vol. 34, no. 03, pages 96 - 99 * |
| 康婧，等: "基于Agent的招投标系统的研究", 哈尔滨商业大学学报(自然科学版), vol. 23, no. 03, pages 359 - 362 * |
| 王亚娟，等: "网络广告制作", 北京理工大学出版社, pages: 148 - 149 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112598447B (en) | 2023-10-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108536804B (en) | Information pushing method based on electronic book, electronic equipment and computer storage medium | |
| CN106355391B (en) | Service processing method and device | |
| CN108711047B (en) | Automatic repayment method, system and terminal equipment | |
| CN107369091B (en) | Product recommendation method and device and financial product recommendation method | |
| CN108829510B (en) | Thread binding processing method and device | |
| CN109636533A (en) | Recommended method, device, electronic equipment and non-volatile memory medium | |
| CN108241535B (en) | Resource management method and device and server equipment | |
| CN112297934A (en) | Charging station processing method and device, storage medium and processor | |
| CN105354056A (en) | APP recommendation information display method and device | |
| CN112491742B (en) | Method and device for scheduling edge computing terminal resources | |
| CN103348370A (en) | Reservation management device, reservation management method, reservation management program, and computer-readable recording medium storing program for same | |
| CN112598447A (en) | Order information processing method and device, electronic equipment and processor | |
| CN110222019B (en) | Method and device for adjusting space occupied by file system | |
| CN109960572B (en) | Equipment resource management method and device and intelligent terminal | |
| CN110166964A (en) | A kind of determination method and device of base station to be expanded | |
| CN111966688B (en) | Form processing method and device based on big data and storage medium | |
| CN111160991B (en) | PDB advertisement flow optimization method and device, storage medium and electronic equipment | |
| CN113468442A (en) | Resource bit flow distribution method, computing device and computer storage medium | |
| CN113655958A (en) | Application data storage method | |
| CN110188297B (en) | Resource information display method, computing device and computer storage medium | |
| CN109325810B (en) | Recharge conversion improving method, electronic equipment and computer storage medium | |
| CN113095939A (en) | Block chain intelligent contract recommendation method and device | |
| CN112835931A (en) | Method and device for determining data acquisition frequency | |
| CN106570734B (en) | Game transaction request processing method and device | |
| CN112070561B (en) | Electronic coupon recommendation method and device |
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 |