CN111311156B - Data processing method and device, readable storage medium and electronic equipment - Google Patents
Data processing method and device, readable storage medium and electronic equipment Download PDFInfo
- Publication number
- CN111311156B CN111311156B CN202010108811.9A CN202010108811A CN111311156B CN 111311156 B CN111311156 B CN 111311156B CN 202010108811 A CN202010108811 A CN 202010108811A CN 111311156 B CN111311156 B CN 111311156B
- Authority
- CN
- China
- Prior art keywords
- capacity
- amount
- scheduled
- unscheduled
- tasks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
Abstract
The embodiment of the application discloses a data processing method, a data processing device, a readable storage medium and electronic equipment. The embodiment of the application determines the schedulable capacity in any area by analyzing the data information; equally dividing schedulable capacity into scheduled capacity and unscheduled capacity; determining a first amount of tasks for each capacity of the capacity that has been scheduled for a set period of time, and determining a second amount of tasks for each capacity of the capacity that has not been scheduled for the set period of time; a determination is made as to whether the first amount of tasks for each of the scheduled capacity is greater than the second amount of tasks for each of the unscheduled capacity. By the method, the idle capacity in any area can be divided into two parts, one part is scheduled to the other area, the other part is still in the area without scheduling, and then after the set time, the task amounts of the two parts are compared, so that whether the utilization rate of the scheduled capacity is improved compared with that of the unscheduled capacity is confirmed.
Description
Technical Field
The present application relates to the field of data processing, and in particular, to a data processing method, apparatus, readable storage medium, and electronic device.
Background
With the continuous development of takeaway industry, more and more convenience is brought to life, more and more carrying capacity is needed, and the quantity of carrying capacity is limited, so that the utilization rate of carrying capacity needs to be fully improved.
In the prior art, when the capacity is configured, a large distribution area is divided into a plurality of small distribution areas, and then a certain amount of capacity is configured in each small distribution area, but due to different task amounts in each small distribution area, the capacity configured in some small distribution areas may be idle, the utilization rate of the capacity is low, the capacity is wasted, and the idle capacity is scheduled to other small distribution areas through the existing scheduling algorithm. However, in the prior art, there is a problem that after the idle capacity is scheduled to other small distribution areas, it cannot be known whether the utilization of the scheduled capacity is improved.
Disclosure of Invention
In view of this, the embodiments of the present application provide a data processing method, apparatus, readable storage medium and electronic device, which can confirm whether the utilization of scheduled capacity is improved.
In a first aspect, an embodiment of the present application provides a method for processing data, where the method includes: receiving data information from a terminal; analyzing the data information by at least one processor to determine schedulable capacity in any area; equally dividing, by the at least one processor, the schedulable capacity into a scheduled capacity and an unscheduled capacity; determining, by the at least one processor, a first amount of tasks for each of the scheduled capacity for a set period of time, and a second amount of tasks for each of the unscheduled capacity for a set period of time; determining, by the at least one processor, whether the first amount of tasks for each of the scheduled capacity is greater than the second amount of tasks for each of the unscheduled capacity.
Preferably, the method further comprises: and determining that the scheduling was successful in response to the first amount of tasks for each of the scheduled capacity being greater than the second amount of tasks for each of the unscheduled capacity.
Preferably, the method further comprises: a scheduling failure is determined in response to the first amount of tasks for each of the scheduled capacity being less than or equal to the second amount of tasks for each of the unscheduled capacity.
Preferably, the determining, by the at least one processor, the first task amount of each capacity of the scheduled capacity within a set period of time specifically includes: determining, by the at least one processor, a sum of the task amounts of all of the scheduled capacity within a set time; and determining the ratio of the sum of the task amounts of all the scheduled capacity to the capacity amount in the scheduled capacity as a first task amount of each capacity of the scheduled capacity.
Preferably, the determining, by the at least one processor, the second task amount of each capacity of the unscheduled capacity for a set period of time, specifically includes: in response to the amount of tasks for any of the remaining capacity being zero, the at least one processor determines that a second amount of tasks for each capacity of the unscheduled capacity over a set period of time is zero, wherein the remaining capacity is the capacity of the schedulable capacity after the scheduled capacity has been called out, including the unscheduled capacity.
Preferably, the determining, by the at least one processor, the second task amount for each capacity of the unscheduled capacity for a set period of time, further specifically includes: in response to the task volume of any of the remaining capacities being non-zero, the at least one processor determines a dwell time for each capacity within the remaining capacities over a set period of time; sequencing the residual capacity from long to short according to the stay time, and determining the task quantity of the capacity with the stay time before the set ranking, wherein the numerical value of the set ranking is equal to the quantity of the unscheduled capacity; determining the sum of all capacity task amounts of the stay time before the setting ranking; and determining the ratio of the sum of all capacity task amounts before the setting ranking to the capacity amount in the unscheduled capacity as a second task amount of each capacity of the unscheduled capacity.
In a second aspect, an embodiment of the present application provides an apparatus for data processing, including: a receiving unit for receiving data information from a terminal; a determining unit, configured to parse the data information by at least one processor, and determine a schedulable capacity in any area; a processing unit for equally dividing the schedulable capacity into a scheduled capacity and an unscheduled capacity by the at least one processor; a determining unit for determining, by the at least one processor, a first task amount for each capacity of the scheduled capacity for a set period of time, and a second task amount for each capacity of the unscheduled capacity for a set period of time; and the judging unit is used for judging whether the first task quantity of each capacity of the scheduled capacity is larger than the second task quantity of each capacity of the unscheduled capacity or not through the at least one processor.
Preferably, the judging unit is further configured to: and determining that the scheduling was successful in response to the first amount of tasks for each of the scheduled capacity being greater than the second amount of tasks for each of the unscheduled capacity.
Preferably, the judging unit is further configured to: a scheduling failure is determined in response to the first amount of tasks for each of the scheduled capacity being less than or equal to the second amount of tasks for each of the unscheduled capacity.
Preferably, the determining unit is specifically configured to: determining, by the at least one processor, a sum of the task amounts of all of the scheduled capacity within a set time; and determining the ratio of the sum of the task amounts of all the scheduled capacity to the capacity amount in the scheduled capacity as a first task amount of each capacity of the scheduled capacity.
Preferably, the determining unit is specifically configured to: in response to the amount of tasks for any of the remaining capacity being zero, the at least one processor determines that a second amount of tasks for each capacity of the unscheduled capacity over a set period of time is zero, wherein the remaining capacity is the capacity of the schedulable capacity after the scheduled capacity has been called out, including the unscheduled capacity.
Preferably, the determining unit is specifically configured to: in response to the task volume of any of the remaining capacities being non-zero, the at least one processor determines a dwell time for each capacity within the remaining capacities over a set period of time; sequencing the residual capacity from long to short according to the stay time, and determining the task quantity of the capacity with the stay time before the set ranking, wherein the numerical value of the set ranking is equal to the quantity of the unscheduled capacity; determining the sum of all capacity task amounts of the stay time before the setting ranking; and determining the ratio of the sum of all capacity task amounts before the setting ranking to the capacity amount in the unscheduled capacity as a second task amount of each capacity of the unscheduled capacity.
In a third aspect, embodiments of the present application provide a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement a method as in the first aspect or any of the possibilities of the first aspect.
In a fourth aspect, an embodiment of the present application provides an electronic device comprising a memory and a processor, the memory storing one or more computer program instructions, wherein the one or more computer program instructions are executable by the processor to implement the method of the first aspect or any one of the possibilities of the first aspect.
The embodiment of the application receives the data information from the terminal; analyzing the data information by at least one processor to determine schedulable capacity in any area; equally dividing, by the at least one processor, the schedulable capacity into a scheduled capacity and an unscheduled capacity; determining, by the at least one processor, a first amount of tasks for each of the scheduled capacity for a set period of time, and a second amount of tasks for each of the unscheduled capacity for a set period of time; determining, by the at least one processor, whether the first amount of tasks for each of the scheduled capacity is greater than the second amount of tasks for each of the unscheduled capacity. By the method, the idle capacity in any area can be divided into two parts, one part is scheduled to the other area, the other part is still in the area without scheduling, and then after the set time, the task amounts of the two parts are compared, so that whether the utilization rate of the scheduled capacity is improved compared with that of the unscheduled capacity is confirmed.
Drawings
The above and other objects, features and advantages of the present application will become more apparent from the following description of embodiments of the present application with reference to the accompanying drawings, in which:
FIG. 1 is a schematic view of a distribution area division in the prior art of the present application;
FIG. 2 is a flow chart of a method of data processing according to a first embodiment of the present application;
FIG. 3 is a schematic diagram of the capacity allocation of a first embodiment of the present application;
FIG. 4 is a flow chart of a method of data processing according to a first embodiment of the present application;
FIG. 5 is an application scenario diagram of a second embodiment of the present application;
FIG. 6 is a schematic diagram of an apparatus for data processing according to a third embodiment of the present application;
fig. 7 is a schematic view of an electronic device according to a fourth embodiment of the present application.
Detailed Description
The present disclosure is described below based on examples, but the present disclosure is not limited to only these examples. In the following detailed description of the present disclosure, certain specific details are set forth in detail. The present disclosure may be fully understood by those skilled in the art without a review of these details. Well-known methods, procedures, flows, components and circuits have not been described in detail so as not to obscure the nature of the disclosure.
Moreover, those of ordinary skill in the art will appreciate that the drawings are provided herein for illustrative purposes and that the drawings are not necessarily drawn to scale.
Unless the context clearly requires otherwise, the words "comprise," "comprising," and the like throughout the application are to be construed as including but not being exclusive or exhaustive; that is, it is the meaning of "including but not limited to".
In the description of the present disclosure, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. Furthermore, in the description of the present disclosure, unless otherwise indicated, the meaning of "a plurality" is two or more.
In the prior art, when the capacity is configured, a large distribution area is divided into a plurality of small distribution areas, and then a certain amount of capacity is configured in each small distribution area, but due to different task amounts in each small distribution area, the capacity configured in some small distribution areas may be idle, the utilization rate of the capacity is low, the capacity is wasted, and the idle capacity is scheduled to other small distribution areas through the existing scheduling algorithm. The transport capacity can be not only a person, but also a machine, and can be a bicycle when the bicycle is scheduled. The description proceeds with the following two examples:
for example, when the capacity is a person, it is assumed that a large delivery area is divided into 6 small delivery areas, namely, delivery area 1, delivery area 2, delivery area 3, delivery area 4, delivery area 5 and delivery area 6, and specifically, as shown in fig. 1, 50 capacities are configured in each small delivery area, namely, 50 persons are used for delivering tasks in the delivery area, and if the number of tasks in the delivery area 1 is small, and if only 30 persons are needed to meet the delivery demand, 20 persons may be idle, resulting in wasting of capacities, and the idle 20 persons are scheduled to other delivery areas through the existing scheduling algorithm.
For example, when the capacity is a bicycle, as shown in fig. 1, it is assumed that the large distribution area is still divided into 6 small distribution areas, and in the distribution areas 1, 2, 3, 4, 5 and 6, specifically, 100 bicycles are allocated in each small distribution area, and if the number of riding bicycles in the distribution area 1 is small, and if only 70 bicycles are needed to meet the demand of the rider, 30 bicycles may be idle, resulting in waste of the bicycles, and the idle 30 bicycles are scheduled to other distribution areas by the existing scheduling algorithm.
Fig. 2 is a flow chart of a method of data processing according to a first embodiment of the present application. As shown in fig. 2, the method specifically comprises the following steps:
step S200, data information from the terminal is received.
Step S201, analyzing the data information through at least one processor, and determining the schedulable capacity in any area.
In the embodiment of the application, assuming that the total capacity number in the capacity set in the area a is 100, determining that 30 capacities with lower utilization rate in the capacity set are available through an intelligent scheduling algorithm, wherein the 30 capacities with lower utilization rate are schedulable capacities in the area a.
Step S202, the schedulable capacity is divided into a scheduled capacity and an unscheduled capacity by the at least one processor.
Specifically, as shown in fig. 3, 30 schedulable capacities are determined in the capacity set in the area a through step S201, and the 30 schedulable capacities are equally divided into a scheduled capacity a group and an unscheduled capacity B group, where each group includes 15 capacities. Let the scheduled capacity be capacity 1, capacity 2, capacity 3, capacity 4, capacity 5, capacity 6, capacity 7, capacity 8, capacity 9, capacity 10, capacity 11, capacity 12, capacity 13, capacity 14 and capacity 15, respectively.
In the embodiment of the present application, the processing manner of other areas is the same as the processing manner of the area a, and the present application is not repeated.
Step S203, determining, by the at least one processor, a first amount of tasks for each of the scheduled capacity for a set period of time, and a second amount of tasks for each of the unscheduled capacity for the set period of time.
In the embodiment of the present application, specifically, the manner of determining the first task amount is as follows:
determining, by the at least one processor, a sum of the task amounts of all of the scheduled capacity within a set time; a ratio of a sum of the task volumes of all of the scheduled capacity to the capacity number of the scheduled capacity is determined as a first task volume for each capacity of the scheduled capacity.
For example, assuming that the set time is 24 hours, the start time is 10 months 20 days earlier 6 points, and the end time is 10 months 21 days earlier 6 points, according to the specific embodiment in step S202, the scheduled capacity is known as capacity 1, capacity 2, capacity 3, capacity 4, capacity 5, capacity 6, capacity 7, capacity 8, capacity 9, capacity 10, capacity 11, capacity 12, capacity 13, capacity 14 and capacity 15, and the tasks received by each capacity can be tracked and monitored, and specifically, as shown in table 1, the tasks received by each capacity can be known as follows:
| capacity of transport | Task volume |
| Capacity 1 | 2 |
| Capacity 2 | 2 |
| Capacity 3 | 3 |
| Capacity 4 | 2 |
| Capacity 5 | 4 |
| Capacity 6 | 3 |
| Capacity 7 | 1 |
| Capacity 8 | 5 |
| Capacity 9 | 6 |
| Capacity 10 | 6 |
| Capacity 11 | 3 |
| Capacity 12 | 3 |
| Capacity 13 | 2 |
| Capacity 14 | 2 |
| Transport capacity 15 | 1 |
The above table is the amount of tasks completed within 24 hours of the scheduled capacity, the sum of the amounts of tasks of all capacities of the scheduled capacity in 24 hours = 2+3+2+4+3+1+5+6+ 3+2+ 1 = 45, the amount of capacity of the scheduled capacity is 15, the first amount of tasks is equal to the sum of the amounts of tasks of all capacities 45/the amount of capacity of the scheduled capacity 15 = 3.
In the embodiment of the application, the carrying capacity can also be a bicycle, and the task amount can be the number of times of bicycle identification call.
In the embodiment of the present application, the specific ways of determining the second task amount are as follows:
in one mode, in response to the amount of tasks for any of the remaining capacity being zero, the at least one processor determines that the second amount of tasks for each capacity of the unscheduled capacity is zero for a set period of time, wherein the remaining capacity is the capacity of the schedulable capacity after the scheduled capacity has been called out, including the unscheduled capacity.
For example, the total capacity in the capacity set in the area a is 100, the scheduled capacity is 15, and 85 remaining capacities include 15 unscheduled capacities compared with the scheduled capacity, when the task size of any one of the 85 remaining capacities is zero, it is assumed that the scheduled capacity cannot receive tasks in the area a if not scheduled, that is, the task size is 0, and the second task size of each capacity which is the unscheduled capacity in the remaining capacities is zero.
In a second mode, in response to the amount of tasks for any of the remaining capacities being non-zero, the at least one processor determines a dwell time for each capacity within the remaining capacity for a set period of time; sequencing the residual capacity from long to short according to the stay time, and determining the task quantity of the capacity with the stay time before the set ranking, wherein the numerical value of the set ranking is equal to the quantity of the unscheduled capacity; determining the sum of all capacity task amounts of the stay time before the setting ranking; and determining the ratio of the sum of all capacity task amounts before the setting ranking to the capacity amount in the unscheduled capacity as a second task amount of each capacity of the unscheduled capacity.
For example, the total number of the capacity sets in the area a is 100, the scheduled capacities are 15, 85 and the remaining capacities are ordered from long to short according to the residence time, the longer the residence time is, the smaller the received task amount is, then the task amount of the capacity with the residence time before 15 is determined, and the capacities with the residence time before 15 are assumed to be respectively capacity 16, capacity 17, capacity 18, capacity 19, capacity 20, capacity 21, capacity 22, capacity 23, capacity 24, capacity 25, capacity 26, capacity 27, capacity 28, capacity 29 and capacity 30, and other labels can be adopted, so that the embodiment of the present application is convenient to describe, and the specific examples are shown in the table 2:
TABLE 2
The above table is the amount of tasks completed within 24 hours of the unscheduled capacity, the sum of the amounts of tasks of all capacities of the unscheduled capacity in 24 hours is determined to be=3+3+3+3+4+4+4+4+5+5+5+5+5=60, the amount of capacity of the unscheduled capacity is 15, and the second amount of tasks is equal to the sum of the amounts of tasks of all capacities 60/the amount of capacity of the unscheduled capacity 15=4.
Step S204, judging whether the first task amount of each capacity of the scheduled capacity is larger than the second task amount of each capacity of the unscheduled capacity by the at least one processor.
In the embodiment of the present application, as shown in fig. 4, after step S204, the following two cases are further included:
in case one, step S205 is further included after step S204;
step S205, determining that the scheduling is successful in response to the first task amount of each capacity of the scheduled capacity being greater than the second task amount of each capacity of the unscheduled capacity.
For example, assuming that the first task amount is 3 and the second task amount is 0,3 is greater than 0, this indicates that the utilization rate is improved after capacity scheduling, and scheduling is successful.
In the second case, step S206 is further included after step S204;
step S206, determining that the scheduling fails in response to the first task amount of each capacity of the scheduled capacity being less than or equal to the second task amount of each capacity of the unscheduled capacity.
For example, assuming that the first task amount is 3 and the second task amount is 4,3 is less than 4, the utilization rate is reduced after capacity scheduling, and scheduling fails.
In the embodiment of the present application, the area may also be referred to as a site, which is not limited by the embodiment of the present application.
Fig. 5 is an application scenario diagram of a second embodiment of the present application, including a scheduling system and at least one capacity, the scheduling system scheduling the capacity to different areas, the scheduling system may also be referred to as a processor, as shown in fig. 5, the scheduling system schedules capacity 1, capacity 2, etc., and receives feedback information of capacity 1 and capacity 2. The embodiment of the application determines the schedulable capacity in any area by analyzing the data information; equally dividing schedulable capacity into scheduled capacity and unscheduled capacity; determining a first amount of tasks for each capacity of the capacity that has been scheduled for a set period of time, and determining a second amount of tasks for each capacity of the capacity that has not been scheduled for the set period of time; a determination is made as to whether the first amount of tasks for each of the scheduled capacity is greater than the second amount of tasks for each of the unscheduled capacity. By the method, the idle capacity in any area can be divided into two parts, one part is scheduled to the other area, the other part is still in the area without scheduling, and then after the set time, the task amounts of the two parts are compared, so that whether the utilization rate of the scheduled capacity is improved compared with that of the unscheduled capacity is confirmed.
Fig. 6 is a schematic diagram of an apparatus for data processing according to a third embodiment of the present application. As shown in fig. 6, the apparatus of the present embodiment includes a receiving unit 61, a determining unit 62, a processing unit 63, and a judging unit 64.
Wherein the receiving unit 61 is configured to receive data information from a terminal; a determining unit 62, configured to determine schedulable capacity in any area by at least one processor parsing the data information; a processing unit 63 for equally dividing the schedulable capacity into a scheduled capacity and an unscheduled capacity by the at least one processor; the determining unit 62 is further configured to determine, by the at least one processor, a first task amount for each capacity of the scheduled capacity for a set period of time, and a second task amount for each capacity of the unscheduled capacity for a set period of time; a determining unit 64 for determining, by the at least one processor, whether the first task size of each capacity of the scheduled capacity is greater than the second task size of each capacity of the unscheduled capacity.
Further, the judging unit 64 is further configured to: and determining that the scheduling was successful in response to the first amount of tasks for each of the scheduled capacity being greater than the second amount of tasks for each of the unscheduled capacity.
Further, the judging unit 64 is further configured to: a scheduling failure is determined in response to the first amount of tasks for each of the scheduled capacity being less than or equal to the second amount of tasks for each of the unscheduled capacity.
Further, the determining unit 62 is specifically configured to: determining, by the at least one processor, a sum of the task amounts of all of the scheduled capacity within a set time; and determining the ratio of the sum of the task amounts of all the scheduled capacity to the capacity amount in the scheduled capacity as a first task amount of each capacity of the scheduled capacity.
Further, the determining unit 62 is specifically configured to: in response to the amount of tasks for any of the remaining capacity being zero, the at least one processor determines that a second amount of tasks for each capacity of the unscheduled capacity over a set period of time is zero, wherein the remaining capacity is the capacity of the schedulable capacity after the scheduled capacity has been called out, including the unscheduled capacity.
Further, the determining unit 62 is specifically configured to: in response to the task volume of any of the remaining capacities being non-zero, the at least one processor determines a dwell time for each capacity within the remaining capacities over a set period of time; sequencing the residual capacity from long to short according to the stay time, and determining the task quantity of the capacity with the stay time before the set ranking, wherein the numerical value of the set ranking is equal to the quantity of the unscheduled capacity; determining the sum of all capacity task amounts of the stay time before the setting ranking; and determining the ratio of the sum of all capacity task amounts before the setting ranking to the capacity amount in the unscheduled capacity as a second task amount of each capacity of the unscheduled capacity.
Fig. 7 is a schematic view of an electronic device according to a fourth embodiment of the present application. In this embodiment, the electronic device is a server. It will be appreciated that other electronic devices, such as raspberry pie, may also be used. As shown in fig. 7, the electronic device: at least one processor 701; and a memory 702 communicatively coupled to the at least one processor 701; and a communication section 703 communicatively connected to the scanning apparatus, the communication section 703 receiving and transmitting data under the control of the processor 701; wherein the memory 702 stores instructions executable by the at least one processor 701, the instructions being executable by the at least one processor 701 to implement: receiving data information from a terminal; analyzing the data information by at least one processor to determine schedulable capacity in any area; equally dividing, by the at least one processor, the schedulable capacity into a scheduled capacity and an unscheduled capacity; determining, by the at least one processor, a first amount of tasks for each of the scheduled capacity for a set period of time, and a second amount of tasks for each of the unscheduled capacity for a set period of time; determining, by the at least one processor, whether the first amount of tasks for each of the scheduled capacity is greater than the second amount of tasks for each of the unscheduled capacity.
Further, the processor is further configured to perform: and determining that the scheduling was successful in response to the first amount of tasks for each of the scheduled capacity being greater than the second amount of tasks for each of the unscheduled capacity.
Further, the processor is further configured to perform: a scheduling failure is determined in response to the first amount of tasks for each of the scheduled capacity being less than or equal to the second amount of tasks for each of the unscheduled capacity.
Further, the processor is specifically configured to perform: determining, by the at least one processor, a sum of the task amounts of all of the scheduled capacity within a set time;
and determining the ratio of the sum of the task amounts of all the scheduled capacity to the capacity amount in the scheduled capacity as a first task amount of each capacity of the scheduled capacity.
Further, the processor is specifically configured to perform: in response to the amount of tasks for any of the remaining capacity being zero, the at least one processor determines that a second amount of tasks for each capacity of the unscheduled capacity over a set period of time is zero, wherein the remaining capacity is the capacity of the schedulable capacity after the scheduled capacity has been called out, including the unscheduled capacity.
Further, the processor is specifically configured to perform: in response to the task volume of any of the remaining capacities being non-zero, the at least one processor determines a dwell time for each capacity within the remaining capacities over a set period of time;
sequencing the residual capacity from long to short according to the stay time, and determining the task quantity of the capacity with the stay time before the set ranking, wherein the numerical value of the set ranking is equal to the quantity of the unscheduled capacity;
determining the sum of all capacity task amounts of the stay time before the setting ranking;
and determining the ratio of the sum of all capacity task amounts before the setting ranking to the capacity amount in the unscheduled capacity as a second task amount of each capacity of the unscheduled capacity.
Specifically, the electronic device includes: one or more processors 701, and a memory 702, one processor 701 being illustrated in fig. 7. The processor 701, the memory 702 may be connected by a bus or otherwise, for example in fig. 7. The memory 702 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The processor 701 executes various functional applications of the device and data processing, i.e., a method of implementing the above-described data processing, by running nonvolatile software programs, instructions, and modules stored in the memory 702.
Memory 702 may include a storage program area that may store an operating system, at least one application program required for functionality, and a storage data area; the storage data area may store a list of options, etc. In addition, the memory 702 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, memory 702 may optionally include memory located remotely from processor 701, which may be connected to an external device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
One or more modules are stored in the memory 702 that, when executed by the one or more processors 701, perform the methods of data processing in any of the method embodiments described above.
The product may perform the method provided by the embodiment of the present application, and has the corresponding functional module and beneficial effect of the performing method, and technical details not described in detail in the embodiment of the present application may be referred to the method provided by the embodiment of the present application.
A fifth embodiment of the present application relates to a non-volatile storage medium for storing a computer-readable program for causing a computer to execute some or all of the above-described method embodiments.
That is, it will be understood by those skilled in the art that all or part of the steps in implementing the methods of the embodiments described above may be implemented by a program stored in a storage medium, where the program includes several instructions for causing a device (which may be a single-chip microcomputer, a chip or the like) or a processor (processor) to perform all or part of the steps in the methods of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples of carrying out the application and that various changes in form and details may be made therein without departing from the spirit and scope of the application.
Claims (14)
1. A method of data processing, the method comprising:
receiving data information from a terminal;
analyzing the data information through at least one processor, and determining the schedulable capacity in any area, wherein the schedulable capacity is the capacity with the lowest utilization rate in the set number in all capacities in any area;
dividing the schedulable capacity into a scheduled capacity and an unscheduled capacity by the at least one processor, wherein the scheduled capacity is the capacity which is scheduled to other areas, and the unscheduled capacity is the capacity which is not scheduled and still exists in the areas;
determining, by the at least one processor, a first amount of tasks for each of the scheduled capacity for a set period of time, and a second amount of tasks for each of the unscheduled capacity for a set period of time, wherein the first amount of tasks is a ratio of a sum of the amounts of all capacity of the scheduled capacity to the amount of capacity in the scheduled capacity, the second amount of tasks is zero, or a ratio of a sum of the amounts of all capacity tasks before a set rank to the amount of capacity in the unscheduled capacity, the set rank being named to rank remaining capacity from long to short in residence time, the set rank having a value equal to the amount of unscheduled capacity, the remaining capacity being capacity after the schedulable capacity has been allocated out of the scheduled capacity, including the unscheduled capacity;
determining, by the at least one processor, whether a first amount of tasks for each of the scheduled capacity is greater than a second amount of tasks for each of the unscheduled capacity to determine whether utilization of the scheduled capacity is increased.
2. The method of claim 1, wherein the method further comprises:
and determining that the scheduling was successful in response to the first amount of tasks for each of the scheduled capacity being greater than the second amount of tasks for each of the unscheduled capacity.
3. The method of claim 1, wherein the method further comprises:
a scheduling failure is determined in response to the first amount of tasks for each of the scheduled capacity being less than or equal to the second amount of tasks for each of the unscheduled capacity.
4. The method of claim 1, wherein said determining, by said at least one processor, a first amount of tasks for each capacity of said scheduled capacity for a set period of time, comprises:
determining, by the at least one processor, a sum of the task amounts of all of the scheduled capacity within a set time;
and determining the ratio of the sum of the task amounts of all the scheduled capacity to the capacity amount in the scheduled capacity as a first task amount of each capacity of the scheduled capacity.
5. The method of claim 1, wherein said determining, by said at least one processor, a second amount of tasks for each capacity of said unscheduled capacity for a set period of time, comprises:
in response to the amount of tasks for any of the remaining capacity being zero, the at least one processor determines that a second amount of tasks for each capacity of the unscheduled capacity over a set period of time is zero, wherein the remaining capacity is the capacity of the schedulable capacity after the scheduled capacity has been called out, including the unscheduled capacity.
6. The method of claim 5, wherein said determining, by said at least one processor, a second amount of tasks for each of said unscheduled capacity for a set period of time, further comprising:
in response to the task volume of any of the remaining capacities being non-zero, the at least one processor determines a dwell time for each capacity within the remaining capacities over a set period of time;
sequencing the residual capacity from long to short according to the stay time, and determining the task quantity of the capacity with the stay time before the set ranking, wherein the numerical value of the set ranking is equal to the quantity of the unscheduled capacity;
determining the sum of all capacity task amounts of the stay time before the setting ranking;
and determining the ratio of the sum of all capacity task amounts before the setting ranking to the capacity amount in the unscheduled capacity as a second task amount of each capacity of the unscheduled capacity.
7. An apparatus for data processing, the apparatus comprising:
a receiving unit for receiving data information from a terminal;
the determining unit is used for analyzing the data information through at least one processor and determining schedulable capacity in any area, wherein the schedulable capacity is the capacity with the lowest utilization rate in the set number in all capacities in any area;
the processing unit is used for equally dividing the schedulable capacity into a scheduled capacity and an unscheduled capacity through the at least one processor, wherein the scheduled capacity is the capacity which is scheduled to other areas, and the unscheduled capacity is the capacity which is still in the area without scheduling;
the determining unit is further configured to determine, by the at least one processor, a first task amount of each of the scheduled capacities in a set period of time, and determine a second task amount of each of the unscheduled capacities in a set period of time, where the first task amount is a ratio of a sum of task amounts of all capacities of the scheduled capacities to the number of capacities in the scheduled capacities, the second task amount is zero, or a ratio of a sum of all capacity task amounts before a set rank to the number of capacities in the unscheduled capacities, the set rank being named to rank remaining capacities from long to short in a stay time, the set rank having a value equal to the number of unscheduled capacities, the remaining capacities being capacities after the schedulable capacities have been scheduled out, including the unscheduled capacities;
and the judging unit is used for judging whether the first task quantity of each capacity of the scheduled capacity is larger than the second task quantity of each capacity of the unscheduled capacity or not through the at least one processor so as to determine whether the utilization rate of the scheduled capacity is improved or not.
8. The apparatus of claim 7, wherein the determination unit is further configured to:
and determining that the scheduling was successful in response to the first amount of tasks for each of the scheduled capacity being greater than the second amount of tasks for each of the unscheduled capacity.
9. The apparatus of claim 7, wherein the determination unit is further configured to:
a scheduling failure is determined in response to the first amount of tasks for each of the scheduled capacity being less than or equal to the second amount of tasks for each of the unscheduled capacity.
10. The apparatus of claim 7, wherein the determining unit is specifically configured to:
determining, by the at least one processor, a sum of the task amounts of all of the scheduled capacity within a set time;
and determining the ratio of the sum of the task amounts of all the scheduled capacity to the capacity amount in the scheduled capacity as a first task amount of each capacity of the scheduled capacity.
11. The apparatus of claim 7, wherein the determining unit is specifically configured to:
in response to the amount of tasks for any of the remaining capacity being zero, the at least one processor determines that a second amount of tasks for each capacity of the unscheduled capacity over a set period of time is zero, wherein the remaining capacity is the capacity of the schedulable capacity after the scheduled capacity has been called out, including the unscheduled capacity.
12. The apparatus of claim 11, wherein the determining unit is specifically configured to:
in response to the task volume of any of the remaining capacities being non-zero, the at least one processor determines a dwell time for each capacity within the remaining capacities over a set period of time;
sequencing the residual capacity from long to short according to the stay time, and determining the task quantity of the capacity with the stay time before the set ranking, wherein the numerical value of the set ranking is equal to the quantity of the unscheduled capacity;
determining the sum of all capacity task amounts of the stay time before the setting ranking;
and determining the ratio of the sum of all capacity task amounts before the setting ranking to the capacity amount in the unscheduled capacity as a second task amount of each capacity of the unscheduled capacity.
13. A computer readable storage medium, on which computer program instructions are stored, which computer program instructions, when executed by a processor, implement the method of any of claims 1-6.
14. An electronic device comprising a memory and a processor, wherein the memory is configured to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010108811.9A CN111311156B (en) | 2020-02-21 | 2020-02-21 | Data processing method and device, readable storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010108811.9A CN111311156B (en) | 2020-02-21 | 2020-02-21 | Data processing method and device, readable storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111311156A CN111311156A (en) | 2020-06-19 |
| CN111311156B true CN111311156B (en) | 2023-09-19 |
Family
ID=71162172
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010108811.9A Active CN111311156B (en) | 2020-02-21 | 2020-02-21 | Data processing method and device, readable storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111311156B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102241330A (en) * | 2010-05-12 | 2011-11-16 | 兰州交通大学 | ETV (elevating transfer vehicle) task scheduling method of airport cargo logistics system |
| CN105512747A (en) * | 2015-11-25 | 2016-04-20 | 安吉汽车物流有限公司 | Intelligent optimized scheduling system for logistics |
| CN107274014A (en) * | 2017-06-08 | 2017-10-20 | 北京惠赢天下网络技术有限公司 | A kind of processing method, system and the terminal of the dispatching task based on standard container |
| CN108960544A (en) * | 2017-05-19 | 2018-12-07 | 北京嘀嘀无限科技发展有限公司 | Transport capacity dispatching method, apparatus, server and computer readable storage medium |
| CN109800997A (en) * | 2019-01-30 | 2019-05-24 | 拉扎斯网络科技（上海）有限公司 | A kind of order allocation method, device, storage medium and electronic equipment |
| CN110741402A (en) * | 2017-06-14 | 2020-01-31 | 北京嘀嘀无限科技发展有限公司 | System and method for capacity scheduling |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2001268688A1 (en) * | 2000-06-22 | 2002-01-02 | Eventra, Inc. | Method and system for supplier relationship management |
-
2020
- 2020-02-21 CN CN202010108811.9A patent/CN111311156B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102241330A (en) * | 2010-05-12 | 2011-11-16 | 兰州交通大学 | ETV (elevating transfer vehicle) task scheduling method of airport cargo logistics system |
| CN105512747A (en) * | 2015-11-25 | 2016-04-20 | 安吉汽车物流有限公司 | Intelligent optimized scheduling system for logistics |
| CN108960544A (en) * | 2017-05-19 | 2018-12-07 | 北京嘀嘀无限科技发展有限公司 | Transport capacity dispatching method, apparatus, server and computer readable storage medium |
| CN107274014A (en) * | 2017-06-08 | 2017-10-20 | 北京惠赢天下网络技术有限公司 | A kind of processing method, system and the terminal of the dispatching task based on standard container |
| CN110741402A (en) * | 2017-06-14 | 2020-01-31 | 北京嘀嘀无限科技发展有限公司 | System and method for capacity scheduling |
| CN109800997A (en) * | 2019-01-30 | 2019-05-24 | 拉扎斯网络科技（上海）有限公司 | A kind of order allocation method, device, storage medium and electronic equipment |
Non-Patent Citations (2)
| Title |
|---|
| 崔丽 等.需求驱动下的城市配送车辆动态调度研究.《计算机工程与应用》.2015,第51卷(第2期),第241-244页. * |
| 王旭坪 等.运力受限的应急物资动态调度模型及算法.《系统工程理论与实践》.2013,第33卷(第6期),第1492-1500页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111311156A (en) | 2020-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110119847B (en) | Distribution time length prediction method and device, storage medium and electronic equipment | |
| CN112612607A (en) | Data processing method, device, computer equipment and medium based on message queue | |
| CN103763343A (en) | Method and device for processing service access | |
| CN110138688A (en) | Dynamic adjusts method, apparatus, equipment and the readable storage medium storing program for executing of business interface | |
| CN112068957B (en) | Resource allocation method, device, computer equipment and storage medium | |
| CN107666407B (en) | Service package selection method, device and system | |
| CN110928655A (en) | Task processing method and device | |
| CN111225050A (en) | Cloud computing resource allocation method and device | |
| CN111262783B (en) | Dynamic routing method and device | |
| CN111506398A (en) | Task scheduling method and device, storage medium and electronic device | |
| CN110599148A (en) | Cluster data processing method and device, computer cluster and readable storage medium | |
| CN113886069A (en) | Resource allocation method and device, electronic equipment and storage medium | |
| CN111311156B (en) | Data processing method and device, readable storage medium and electronic equipment | |
| CN114490078A (en) | Dynamic capacity reduction and expansion method, device and equipment for micro-service | |
| CN110516872B (en) | Information processing method and device, storage medium and electronic equipment | |
| CN111143063B (en) | Task resource reservation method and device | |
| CN112416534A (en) | Agent-based task management method and device | |
| CN111796933A (en) | Resource scheduling method, device, storage medium and electronic equipment | |
| CN115514020A (en) | Cross-region power scheduling method and device, computer equipment and storage medium | |
| CN115099666A (en) | Robot scheduling method and device and electronic equipment | |
| CN113468442A (en) | Resource bit flow distribution method, computing device and computer storage medium | |
| CN112612583A (en) | Data synchronization method and device, computer equipment and readable storage medium | |
| CN110673931A (en) | Distributed calculation method for document synthesis, document synthesis system and control device thereof | |
| CN116805233B (en) | Asset inventory control method, device, equipment and storage medium | |
| CN111582774B (en) | Task data processing method and device, readable storage medium and electronic equipment |
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 |