Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components. All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
Some block diagrams and/or flow diagrams are shown in the figures. It will be understood that some blocks of the block diagrams and/or flowchart illustrations, or combinations thereof, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable duration determining apparatus, such that the instructions, which execute via the processor, create means for implementing the functions/acts specified in the block diagrams and/or flowchart block or blocks. The techniques of this disclosure may be implemented in hardware and/or software (including firmware, microcode, etc.). In addition, the techniques of this disclosure may take the form of a computer program product on a computer-readable storage medium having instructions stored thereon for use by or in connection with an instruction execution system.
In the related art, due to the increasing number of the personnel applying for orders and approving in the credit card approval business, the approval department is difficult to obtain the expected completion time of the current approval progress, the approval efficiency and the remaining processing time of the current order to be processed in a manual estimation mode as usual, but is inconvenient to introduce a big data and other weight-level data analysis means due to various reasons such as cost, landing and the like.
Accordingly, the present disclosure provides an automated, lightweight duration determination method that includes an obtaining process of predicted processing efficiency and a determination process of predicted processing duration. In the obtaining of the predicted processing efficiency, first, in response to a duration query request initiated at a specified time, a first number of tasks to be processed within a first predetermined time period, the duration query request being used to indicate a processing duration expected to be consumed for querying processing of the first number of tasks to be processed, the first predetermined time period starting at the specified time, and then, based on a historical processing efficiency within a second predetermined time period and a real-time processing efficiency within a third predetermined time period, the predicted processing efficiency within the first predetermined time period is obtained, the second predetermined time period and the third predetermined time period ending at the specified time, and the second predetermined time period being longer than the third predetermined time period. And after the predicted processing efficiency is obtained, entering a process for determining the predicted processing time length, and determining the processing time length predicted to be consumed for processing the task to be processed according to the first quantity and the predicted processing efficiency.
Due to the duration determination method provided by the disclosure, by using the first number of the tasks to be processed in the first predetermined time period, obtaining the predicted processing efficiency in the first predetermined time period based on the historical processing efficiency in the second predetermined time period and the real-time processing efficiency in the third predetermined time period, and finally determining the processing duration which is expected to be consumed for processing the tasks to be processed, the problems of low estimation efficiency and inaccurate estimation result caused by the fact that the completion time to be processed is predicted in a manual estimation mode in the related art can be at least partially solved, alleviated, suppressed and even avoided, and therefore, the technical effects of improving the estimation efficiency and accuracy can be achieved.
It should be noted that the duration determination method, apparatus, electronic device, medium, and program product provided by the present disclosure may be used in the financial field, and may also be used in any field other than the financial field. Therefore, the application fields of the duration determination method, the duration determination device, the electronic device, the medium, and the program product provided by the present disclosure are not limited.
Fig. 1 schematically illustrates asystem architecture 100 of a duration determination method, apparatus, electronic device, medium, and program product suitable for use with embodiments of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, thesystem architecture 100 according to this embodiment may includeterminal devices 101, 102, 103, anetwork 104 and aserver 105. Thenetwork 104 serves as a medium for providing communication links between theterminal devices 101, 102, 103 and theserver 105.Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use theterminal devices 101, 102, 103 to interact with theserver 105 via thenetwork 104 to receive or send messages or the like. Theterminal devices 101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
Theterminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
Theserver 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using theterminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.
It should be noted that the duration determination method provided by the embodiment of the present disclosure may be generally executed by theserver 105. Accordingly, the duration determination device provided by the embodiment of the present disclosure may be generally disposed in theserver 105. The duration determination method provided by the embodiment of the present disclosure may also be performed by a server or a server cluster that is different from theserver 105 and is capable of communicating with theterminal devices 101, 102, 103 and/or theserver 105. Accordingly, the duration determination apparatus provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from theserver 105 and capable of communicating with theterminal devices 101, 102, 103 and/or theserver 105.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Fig. 2 schematically shows a flow chart of a duration determination method according to an embodiment of the present disclosure.
As shown in fig. 2, theduration determination method 200 may include operations S210 to S230.
In operation S210, a first number of pending tasks within a first predetermined time period is determined in response to a duration query request initiated at a specified time.
According to the embodiment of the disclosure, the duration query request is used for indicating the processing duration expected to be consumed by querying and processing a first number of tasks to be processed, the first predetermined time period starts at a specified time and ends at any time after the specified time, the any time can be determined according to specific tasks to be processed, and the first number of tasks to be processed can be determined according to the first predetermined time period. For example, the task to be processed is the credit card approval application forms that have not been processed, and if the first predetermined period of time is 30 days, the number of the credit card approval application forms that have not been processed within 30 days from the specified time may be acquired as the first number. It should be noted that the duration query request may be any one of a plurality of duration query requests sent at a certain frequency. Alternatively, the specified time may be the current time indicated by the local clock.
In operation S220, a predicted processing efficiency in the first predetermined period of time is obtained based on the historical processing efficiency in the second predetermined period of time and the real-time processing efficiency in the third predetermined period of time. In the present disclosure, the second predetermined period of time and the third predetermined period of time end at the specified time, and the second predetermined period of time is longer than the third predetermined period of time.
According to the embodiment of the disclosure, the historical processing efficiency is used for representing the actual processing efficiency in the second predetermined time period, the real-time processing efficiency is used for representing the actual processing efficiency in the third predetermined time period, and the predicted processing efficiency is used for representing the predicted processing efficiency in the first predetermined time period. Since the second predetermined period of time is longer than the third predetermined period of time, the historical processing efficiency reflects an average processing level for the processed task over a longer period of time, i.e., a stationary characteristic of the processing level, while the real-time processing efficiency reflects an immediate processing level for the processed task over a recent period of time, both reflecting the processing level for the processed task from different perspectives, i.e., an abrupt characteristic of the processing level.
Fig. 3 schematically shows a schematic diagram of a predetermined time period according to an embodiment of the present disclosure.
As shown in fig. 3, the second predetermined time period 330, the third predetermined time period 340, the designated time 310, and the first predetermined time period 320 are sequentially arranged in time order. Where the designated time 310 may be a current time (which may be expressed as a day and may be expressed as an hour), the first predetermined time period 320 may begin at the designated time 310 and may end at any time after the designated time 310. The second predetermined period of time 330 may begin at any time prior to the specified time 310 and may end at the specified time 310. The third predetermined time period 340 may start at any time before the specified time 310 and may end at the specified time 310. The second predetermined time period 330 is longer than the third predetermined time period 340. For example, the second predetermined period of time 330 may be 30 days and the third predetermined period of time 340 may be 0.5 hours. For convenience of calculation, in the implementation, the time units of the first predetermined time period, the second predetermined time period, and the third predetermined time period need to be unified, for example, the time units may be unified into one hour.
In operation S230, a processing time period expected to be consumed for processing the to-be-processed task is determined according to the first number and the predicted processing efficiency.
According to the embodiment of the present disclosure, according to the acquired first number, the time required for completing the processing of the to-be-processed task according to the acquired prediction processing efficiency can be predicted. The time for completing the processing can be predicted by adding the processing time to be consumed to the specified time.
By the embodiment of the disclosure, by using the first number of the tasks to be processed in the first predetermined time period, obtaining the predicted processing efficiency in the first predetermined time period based on the historical processing efficiency in the second predetermined time period and the real-time processing efficiency in the third predetermined time period, and finally determining the processing time which is expected to be consumed for processing the tasks to be processed, the problems of low estimation efficiency and inaccurate estimation result caused by predicting the completion time to be processed in a manual estimation manner in the related art can be at least partially solved, reduced, suppressed and even avoided, and thus the technical effect of improving the estimation efficiency and accuracy can be achieved.
As an alternative embodiment, obtaining the predicted processing efficiency in the first predetermined period of time based on the historical processing efficiency in the second predetermined period of time and the real-time processing efficiency in the third predetermined period of time may include: determining a first weight value of historical processing efficiency in a second preset time period and a second weight value of real-time processing efficiency in a third preset time period based on a preset rule, wherein the sum of the first weight value and the second weight value is 1; and obtaining the predicted processing efficiency within the first preset time period according to the historical processing efficiency, the first weight value, the real-time processing efficiency and the second weight value.
As an alternative embodiment, the preset rule includes a query frequency, and the determining the first weight value of the historical processing efficiency in the second predetermined time period and the second weight value of the real-time processing efficiency in the third predetermined time period based on the preset rule may include: under the condition that the query frequency of the duration query requests is higher than a first threshold, determining that a first weight value of the historical processing efficiency in a second preset time period is smaller than a second weight value of the real-time processing efficiency in a third preset time period; or in the case that the query frequency of the long query requests is not higher than the first threshold, determining that the first weight value of the historical processing efficiency in the second preset time period is larger than the second weight value of the real-time processing efficiency in the third preset time period.
According to the embodiment of the disclosure, the weight values corresponding to the historical processing efficiency and the real-time processing efficiency can be determined based on the query frequency of the duration query request, namely, the calculation frequency represented by the refresh frequency. In specific implementation, if the calculation frequency is high, the requirement is data sensitive, and the first weight value corresponding to the history processing efficiency can be appropriately reduced, so that the influence of the history data on the calculation result is smaller, and the influence of the real-time data on the calculation result is larger. Otherwise, if the calculation frequency is low, the requirement is not data sensitive, and the first weight value corresponding to the historical processing efficiency can be properly larger, so that the influence of the historical data on the calculation result is larger, and the influence of the real-time data on the calculation result is smaller.
According to the embodiment of the disclosure, the first weight value k of the history processing efficiency is a real number greater than 0 and less than 1. The larger the value of k is, the larger the influence of the historical processing efficiency on the calculation result is, and the smaller the influence of the real-time processing efficiency on the calculation result is; conversely, a smaller value of k means that the historical processing efficiency has a smaller influence on the calculation result, while the real-time processing efficiency has a larger influence on the calculation result. It should be noted that, in the present disclosure, the first weight value k may be a fixed real number greater than 0 and smaller than 1, or may be a variable real number greater than 0 and smaller than 1, which is not limited in the present disclosure.
In this disclosure, the query frequency may be queried once every 5 seconds, or once every 1 second, and the query frequency is used to represent the attention degree of the task processing department to the task to be processed. For example, the attention degree of querying once every 1 second is higher than the attention degree of querying once every 5 seconds, which indicates that the task processing department is more biased to the decisive role of the real-time processing efficiency on the task to be processed, i.e. the latest processing efficiency is concerned, at this time, the weight of the real-time processing efficiency can be adjusted to be higher than the weight of the historical processing efficiency, and the specific numerical value can be set by itself according to the actual requirements of the task processing department on the task processing, which is not limited by the present disclosure.
According to the embodiment of the disclosure, the weighted values corresponding to the historical processing efficiency and the real-time processing efficiency can be adjusted according to the calculation frequency represented by the query frequency of the duration query request, so that the prediction accuracy of the prediction processing efficiency can be improved.
As an optional embodiment, the duration determining method may further include: querying a second number of processed tasks within a second predetermined time period; determining a historical processing time length based on a second predetermined time period; and determining the historical processing efficiency according to the second quantity and the historical processing time length.
According to the embodiment of the disclosure, since a continuous time range includes both the working time and the non-working time, such as weekends and legal holidays, the processed task is usually completed in the working time, but not completed in the non-working time, so that in the specific implementation, the working time can be determined as the historical processing time under the condition of determining the second predetermined time period. This makes it possible to query the total number of historical processes of the processed historical processing tasks within the operating time of the second predetermined period of time, i.e., the second number, from the specified time point in time, based on the second predetermined period of time.
It should be noted that, when querying the second number of historical processing totals of processed tasks, the determined historical processing time duration should be strictly followed, the query date should be the date when the task processing department works normally, if there is a large difference in the processing totals of one day or several days, the day or several days should be excluded from the query time range, and the processing totals of one day or several days should be queried forward in time sequence.
By the embodiments of the present disclosure, the historical processing efficiency is determined based on the second number and the historical processing time length, a baseline of processing efficiency may be provided for determination of predicted processing efficiency, and the average level of task processing may be quantified from a long time period angle.
As an optional embodiment, the duration determining method may further include: querying a third number of processed tasks within a third predetermined time period; determining a real-time processing duration based on a third predetermined time period; and determining the real-time processing efficiency according to the third quantity and the real-time processing time length.
According to the embodiment of the disclosure, in a manner similar to the query of the second number, the working time in the third predetermined time period may be determined as the real-time processing time length. This allows the historical processing total, i.e. the third number, of processed real-time processing tasks within the working time of the third predetermined time period to be looked up from the specified time instant in dependence on the third predetermined time period. For example, the specified time is the non-operating time 12: 30, the last working time 11 should be selected: a total number of processing tasks within a third predetermined time period in the range before 30.
According to the embodiment of the disclosure, when querying the real-time processing total number of the third number of processed tasks, the determined real-time processing time length is strictly needed, the queried date is the date when the task processing department works normally, if the processing total number in the third predetermined time period has a large difference, it indicates that a situation that normal processing cannot be performed exists in the third predetermined time period, the backward pushing of the third predetermined time period from the specified time can be skipped, and the processing total number in the third predetermined time period is queried after the backward pushing of the third predetermined time period from the specified time, so as to reduce misleading of the real-time processing efficiency to the predicted processing efficiency.
For example, if the third predetermined time period is 0.5 hours and the task processing staff temporarily hold the conference within half an hour of the current time, so that the task processing has to be interrupted, the total number of the processing within the third predetermined time period is obtained as a single digit, and it is obvious that such data is due to objective factors and does not really reflect the instantaneous level of the processing efficiency that the task processing staff presents when processing the task, so that it is of no practical significance for predicting the processing efficiency.
By the embodiments of the present disclosure, the real-time processing efficiency is determined according to the third number and the real-time processing duration, a change in processing efficiency can be provided for the determination of the predicted processing efficiency, and the fluctuation level of the task processing is quantified from the instant time period angle.
As an optional embodiment, the duration determining method may further include: detecting whether the number variation value of the processing personnel participating in the processed task before the designated time exceeds a second threshold value; determining a change time of the number change in the case where the number change value of the processing person exceeds a second threshold value; and determining the value of the second preset time period according to the change time.
According to the embodiment of the disclosure, the value of the second predetermined time period is determined to be neither too long nor too short. Because the number of the task processing personnel and the individual processing efficiency of the task processing personnel are dynamically changed, the overlong value of the second preset time period can directly result in the acquisition of earlier historical data, and the number of the task processing personnel and the individual processing efficiency of the task processing personnel in the processing of the earlier historical data can be greatly different from the current historical data, so that the historical processing efficiency and the actual processing efficiency have larger deviation. Too short a second predetermined period of time may result in poor historical data referencing, inaccuracies, extreme data, etc. Therefore, the determination of the value of the second predetermined time period should satisfy the condition that the time period taken by the historical processing task is increased as much as possible under the condition that the daily data of the historical processing task is relatively smooth in the time period.
In a specific implementation, the value of the second predetermined time period may refer to whether the task processing department has a large personnel change in the near future and the time when the personnel change occurs, because the difference between the data before the personnel change and the data after the personnel change is relatively large, the historical data directly lacks the referential property. For example, a certain bank needs to calculate the expected completion time of the approval application form, and the approval department adds a plurality of approval personnel 80 days ago, so that the value of the second predetermined time period is determined to be not suitable for exceeding 80 days. If the length of work of the approver is 8 hours per day, then the second predetermined period of time may be determined to be 80 x 8-640 (hours).
Through the embodiment of the disclosure, the value of the second preset time period is determined by processing the number change value and the change time of the personnel, so that the influence of personnel change on the historical processing efficiency can be reduced.
As an optional embodiment, the duration determining method may further include: and determining the value of the third preset time period according to the query frequency of the duration query request, wherein the higher the query frequency is, the smaller the value of the third preset time period is.
According to the embodiment of the disclosure, the value of the third predetermined time period may be determined to be a corresponding value based on the query frequency of the duration query request, that is, the query and refresh frequency of the expected completion time. In practical implementation, if the calculation frequency is high, it indicates that the demand is data sensitive, and the value of the third predetermined time period should be appropriate, for example, 1/6 hours, or 1/10. Otherwise, the calculation frequency is low, which indicates that the demand is not data sensitive, and the value of the third predetermined time period should be longer, for example, 1/2 hours or 1 hour.
The method and the device for processing the time length query request determine the value of the third preset time period according to the time length query request, and can reduce the influence of the query frequency on the real-time processing efficiency.
As an optional embodiment, the duration determining method may further include: and adjusting the value of the second preset time period under the condition that the determined processing time which is expected to be consumed for processing the task to be processed is greater than the error allowable value.
According to the embodiment of the disclosure, after the processing time length which is expected to be consumed for processing the task to be processed is determined, whether the processing time length is within the error allowable range or not can be detected. If the error tolerance range indicates that the value of the second predetermined time period is appropriate, the value does not need to be adjusted at this time. If the value is larger than the error allowable range, the value of the second preset time period is not proper, and the value needs to be adjusted at this time. The error tolerance value is used to characterize the maximum value of the error, and the value may be set manually, may be a fixed value, or may be a variable value, and the disclosure is not limited.
The embodiment of the disclosure uses the error allowable range to determine whether to adjust the value of the second predetermined time period, and can realize that the value of the second predetermined time period is quickly adjusted according to the prediction result, so as to improve the accuracy of the history processing efficiency.
The following will describe in detail a specific embodiment of the duration determination method provided by the present disclosure, taking the calculation of the predicted completion time of the current pending order for the credit card approval department as an example. It is understood that, for the approval tasks, the historical processing time length is specifically the historical approval time length t1 (hours), the second number of the processed tasks in the second predetermined time period is specifically the historical approval application form total number s1 (pens), and the historical processing efficiency is specifically the historical approval efficiency v1 (pens/hour). The real-time processing time length is specifically a real-time approval time length t2 (hour), the third number of the processed tasks in the third preset time period is specifically a real-time approval application form total number s2 (pens), and the real-time approval efficiency v2 (pens/hour) is specifically determined. The historical approval efficiency v1 and the real-time approval efficiency v2 both have initial values, but are data which are changed in the calculation process. The first weighted value of the historical approval efficiency v1 is specifically k, and the second weighted value of the real-time approval efficiency v2 is specifically 1-k. The first number of the tasks to be processed in the first preset time period is specifically the total number s (pens) of the pending application forms. The finally determined processing time period expected to be consumed is specifically the expected completion time t (hours).
In specific implementation, the total number s1 (pen) of the historical approval application forms during working hours, which is backward shifted from the current date by a second preset time period, is inquired according to the historical approval time length t 1. The initial value of the calculation historical approval efficiency v1 is v1 ═ s1/t1 (pen/hour). A third predetermined time period, typically approximately 0.5 to 1 hour, is determined to ensure real-time and accuracy, and a real-time approval period t2 is determined based on the third predetermined time period. And inquiring the total number s2 (pen) of the real-time approved application forms, and inquiring the total number of the approved application forms in the working time range from the current time to the time before the third preset time period. The initial value of the real-time approval efficiency v2 is calculated to be v2 ═ s2/t2 (pen/hour). When the first weight value of the historical approval efficiency v1 is k and the second weight value of the real-time approval efficiency v2 is 1-k, the updated historical approval efficiency v3 is v1 k + v2 (1-k) (pen/hour), the total number s (pen) of the application sheets to be approved is inquired by taking the updated historical approval efficiency as the predicted processing efficiency in the first predetermined time period, and the predicted completion time t is s/v3 (hour).
For example, if the second predetermined period of time is 30 days, the working time per day is 8 hours, the historical approval time t1 may be determined to be 30 × 8 to 240 hours, and the total number of application sheets for which approval is completed on the first 30 actual working days of the current date is 24 ten thousand, then the historical approval efficiency v1 to 240000/240 to 1000/hour may be obtained. If the third predetermined time period is 0.5 hour, that is, the real-time approval time period is 0.5 hour, and the total number of the application forms which have been approved in the latest 0.5 hour within the working time before the current time is 742 pens, it may be determined that the real-time approval efficiency v2 is 742/0.5 or 1484 pens/hour. And determining that the weight k of the historical approval efficiency is 33.3%, then the weight k of the real-time approval efficiency is 66.7%, and updating the historical approval efficiency through the real-time approval efficiency to obtain the predicted processing efficiency v3 which is 1000 × 33.3% +1484 × 66.7% + 1322.8 pens/h. If the total number s of the application sheets to be examined is 13228, the predicted completion time t is 13228/1322.8 which is 10 hours according to the predicted processing efficiency v 3.
It should be noted that, since the real-time data is a dynamically changing quantity, and the predicted completion time is also a real-time refreshed data, the real-time approval time t2, the real-time approval efficiency v2, the total number of real-time approval application forms s2, and the predicted processing efficiency v3 are all real-time refreshed data, and the latest real-time approval time t2, the latest real-time approval efficiency v2, the latest total number of real-time approval application forms s2, and the latest predicted processing efficiency v3 need to be repeatedly calculated continuously to update the data in real time. The weighted values of the historical processing efficiency and the real-time processing efficiency can be set according to the actual situation, and the method is not limited by the disclosure.
According to the duration determination method, the future data trend is accurately predicted as far as possible in the most economical and convenient mode under the condition that other software, hardware, big data and artificial intelligence are not used in a calculation mode combining historical data and real-time data. The advantages are as follows: the prediction result is accurate, the weights of historical data and real-time data can be dynamically adjusted, the economy is good, and the method has reference for predicting simple data.
The duration determination apparatus is further described with reference to fig. 4 in conjunction with specific embodiments.
Fig. 4 schematically shows a block diagram of a duration determination apparatus according to an embodiment of the present disclosure.
As shown in fig. 4, theduration determination apparatus 400 may include afirst determination module 410, an obtainingmodule 420, and asecond determination module 430.
The first determiningmodule 410 is configured to determine a first number of the pending tasks within a first predetermined time period in response to a duration query request, where the duration query request is used to indicate a processing duration expected to be consumed for querying the pending tasks. Optionally, the first determiningmodule 410 may be configured to perform operation S210 described in fig. 2, for example, and is not described herein again.
An obtainingmodule 420, configured to obtain the predicted processing efficiency in the first predetermined time period based on the historical processing efficiency in the second predetermined time period and the real-time processing efficiency in a third predetermined time period, where the second predetermined time period and the third predetermined time period are earlier than the first predetermined time period. Optionally, the obtainingmodule 420 may be configured to perform operation S220 described in fig. 2, for example, and is not described herein again.
And a second determiningmodule 430, configured to determine, according to the first number and the predicted processing efficiency, a processing time expected to be consumed for processing the to-be-processed task. Optionally, the second determiningmodule 430 may be configured to perform operation S230 described in fig. 2, for example, and is not described herein again.
By the embodiment of the disclosure, by using the first number of the tasks to be processed in the first predetermined time period, obtaining the predicted processing efficiency in the first predetermined time period based on the historical processing efficiency in the second predetermined time period and the real-time processing efficiency in the third predetermined time period, and finally determining the processing time which is expected to be consumed for processing the tasks to be processed, the problems of low estimation efficiency and inaccurate estimation result caused by predicting the completion time to be processed in a manual estimation manner in the related art can be at least partially solved, reduced, suppressed and even avoided, and thus the technical effect of improving the estimation efficiency and accuracy can be achieved.
As an alternative embodiment, the obtainingmodule 420 may include: the determining submodule is used for determining a first weight value of historical processing efficiency in a second preset time period and a second weight value of real-time processing efficiency in a third preset time period based on a preset rule, wherein the sum of the first weight value and the second weight value is 1; and an obtaining sub-module for obtaining a predicted processing efficiency within a first predetermined time period according to the historical processing efficiency, the first weight value, the real-time processing efficiency, and the second weight value.
As an alternative embodiment, the preset rule includes a query frequency, and the determining sub-module may include: a first determination unit configured to determine that a first weight value of the historical processing efficiency in a second predetermined period of time is smaller than a second weight value of the real-time processing efficiency in a third predetermined period of time, in a case where a query frequency of the duration query request is higher than a first threshold; or a second determination unit configured to determine that a first weight value of the historical processing efficiency in a second predetermined period of time is greater than a second weight value of the real-time processing efficiency in a third predetermined period of time, in a case where the query frequency of the duration query request is not higher than the first threshold.
As an alternative embodiment, the duration determining apparatus may further include: a first query module for querying a second number of processed tasks within a second predetermined time period; a third determination module for determining a historical processing duration based on a second predetermined time period; and a fourth determining module for determining the history processing efficiency according to the second number and the history processing time length.
As an alternative embodiment, the duration determining apparatus may further include: a second query module for querying a third number of processed tasks within a third predetermined time period; a fifth determining module, configured to determine a real-time processing duration based on a third predetermined time period; and a sixth determining module, configured to determine the real-time processing efficiency according to the third number and the real-time processing duration.
As an alternative embodiment, the duration determining apparatus may further include: the detection module is used for detecting whether the quantity variation value of the processing personnel participating in the processed task before the appointed time exceeds a second threshold value; a seventh determining module, configured to determine a variation time of the number variation when the number variation value of the processing staff exceeds the second threshold; and the eighth determining module is used for determining the value of the second preset time period according to the change time.
As an alternative embodiment, the duration determining apparatus may further include: and the ninth determining module is used for determining the value of the third predetermined time period according to the query frequency of the duration query request, wherein the higher the query frequency is, the smaller the value of the third predetermined time period is.
As an alternative embodiment, the duration determining apparatus may further include: and the adjusting module is used for adjusting the value of the second preset time period under the condition that the determined processing time which is expected to be consumed for processing the task to be processed is greater than the error allowable value.
It should be noted that the implementation, solved technical problems, implemented functions, and achieved technical effects of each module in the partial embodiment of the duration determining apparatus are respectively the same as or similar to the implementation, solved technical problems, implemented functions, and achieved technical effects of each corresponding step in the partial embodiment of the duration determining method, and are not described herein again.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a field programmable gate array (FNGA), a programmable logic array (NLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, the first determination module, the obtaining module, the second determination module, the determination sub-module, the obtaining sub-module, the first determination unit, the second determination unit, the first query module, the third determination module, the fourth determination module, the second query module, the fifth determination module, the sixth determination module, the detection module, the seventh determination module, the eighth determination module, the ninth determination module, and the adjustment module may be combined and implemented in one module, or any one of them may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first determining module, the obtaining module, the second determining module, the determining sub-module, the obtaining sub-module, the first determining unit, the second determining unit, the first querying module, the third determining module, the fourth determining module, the second querying module, the fifth determining module, the sixth determining module, the detecting module, the seventh determining module, the eighth determining module, the ninth determining module, and the adjusting module may be at least partially implemented as a hardware circuit, such as field programmable gate arrays (FNGAs), programmable logic arrays (NLAs), systems on a chip, systems on a substrate, systems on a package, Application Specific Integrated Circuits (ASICs), or may be implemented in hardware or firmware in any other reasonable way of integrating or packaging circuits, or in any one of three implementations, software, hardware and firmware, or in any suitable combination of any of them. Alternatively, at least one of the first determining module, the obtaining module, the second determining module, the determining sub-module, the obtaining sub-module, the first determining unit, the second determining unit, the first querying module, the third determining module, the fourth determining module, the second querying module, the fifth determining module, the sixth determining module, the detecting module, the seventh determining module, the eighth determining module, the ninth determining module, and the adjusting module may be at least partially implemented as a computer program module which, when executed, may perform a corresponding function.
Fig. 5 schematically illustrates a schematic diagram of a computer-readable storage medium product adapted to implement the above-described duration determination method according to an embodiment of the present disclosure.
In some possible embodiments, aspects of the present invention may also be implemented in a program product including program code for causing a device to perform the aforementioned operations (or steps) in the duration determination method according to various exemplary embodiments of the present invention described in the above-mentioned "exemplary method" section of this specification when the program product is run on the device, for example, the electronic device may perform operations S210 to S230 as shown in fig. 2.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (ENROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
As shown in fig. 5, aprogram product 500 for duration determination according to an embodiment of the present invention is depicted, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a device, such as a personal computer. However, the program product of the present invention is not limited in this respect, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, or device.
A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, or device. Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a local area network (LAA) or a wide area network (WAA), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
Fig. 6 schematically shows a block diagram of an electronic device adapted to implement the above described duration determination method according to an embodiment of the present disclosure. The electronic device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, anelectronic device 600 according to an embodiment of the present disclosure includes aprocessor 601, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from astorage section 608 into a Random Access Memory (RAM) 603.Processor 601 may include, for example, a general purpose microprocessor (e.g., a CNU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. Theprocessor 601 may also include onboard memory for caching purposes.Processor 601 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In theRAM 603, various programs and data necessary for the operation of theelectronic apparatus 600 are stored. Theprocessor 601, theROM 602, and theRAM 603 are connected to each other via abus 604. Theprocessor 601 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in theROM 602 and/orRAM 603. It is to be noted that the programs may also be stored in one or more memories other than theROM 602 andRAM 603. Theprocessor 601 may also perform operations S210 through S230 illustrated in fig. 2 according to the embodiment of the present disclosure by executing programs stored in the one or more memories.
Electronic device 600 may also include input/output (I/O)interface 605, input/output (I/O)interface 605 also connected tobus 604, according to an embodiment of the disclosure. Thesystem 600 may also include one or more of the following components connected to the I/O interface 605: aninput portion 606 including a keyboard, a mouse, and the like; anoutput portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; astorage section 608 including a hard disk and the like; and acommunication section 609 including a network interface card such as an LAA card, a modem, or the like. Thecommunication section 609 performs communication processing via a network such as the internet. Thedriver 610 is also connected to the I/O interface 605 as needed. Aremovable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on thedrive 610 as necessary, so that a computer program read out therefrom is mounted in thestorage section 608 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through thecommunication section 609, and/or installed from theremovable medium 611. The computer program, when executed by theprocessor 601, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement a duration determination method according to an embodiment of the present disclosure, including operations S210 to S230 shown in fig. 2.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (ENROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include theROM 602 and/orRAM 603 described above and/or one or more memories other than theROM 602 andRAM 603.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.