CN116579586B

CN116579586B - Resource scheduling method, device and system

Info

Publication number: CN116579586B
Application number: CN202310848307.6A
Authority: CN
Inventors: 张冀; 陈滔滔; 李柳熙; 王子豪; 丁宏伟; 李洪波
Original assignee: Wuzhou Online E Commerce Beijing Co ltd
Current assignee: Wuzhou Online E Commerce Beijing Co ltd
Priority date: 2023-07-11
Filing date: 2023-07-11
Publication date: 2024-01-09
Anticipated expiration: 2043-07-11
Also published as: CN116579586A

Abstract

The embodiment of the specification provides a resource scheduling method, a device and a system, wherein the resource scheduling method comprises the following steps: acquiring resource load information and historical resource load information respectively corresponding to the subareas in the storage area; determining resource load change information corresponding to the subareas in the storage area according to the resource load information and the historical resource load information; calculating a global load loss value of the warehouse area according to the resource load information and the resource load change information, and calculating the resource quantity to be scheduled corresponding to the subareas in the warehouse area by utilizing the global resource load information and the global load loss value of the warehouse area; and determining a resource scheduling type corresponding to the resource quantity to be scheduled, creating a resource scheduling task corresponding to the storage area according to the resource scheduling type and the resource quantity to be scheduled, and executing the resource scheduling task.

Description

Resource scheduling method, device and system

Technical Field

The embodiment of the specification relates to the technical field of warehousing, in particular to a resource scheduling method, a resource scheduling device and a resource scheduling system.

Background

At present, in a warehouse logistics system, in order to ensure orderly completion of logistics related work in a warehouse area, the warehouse area is generally divided into a plurality of areas according to different functions, such as a goods receiving area, a storage area, a sorting area and the like according to functions of goods receiving, storage, sorting and the like. Or a plurality of areas can be divided for the same function, thereby achieving the purpose of improving the working efficiency of parallel operation. The operation of each area needs corresponding production resources to be completed, such as AGVs (Automated Guided Vehicle, automatic guided vehicles), unmanned forklifts, shuttling vehicles and the like in an automatic warehouse scene. Because the task quantity under each region can be dynamically changed in the production process, the production resources of each region arranged before the production starts cannot be dynamically matched with the task quantity of the region in real time, the production progress of the region with more tasks can be delayed, and the production resources of the region with less tasks are idle, so that the operation efficiency of the whole warehouse region is low. There is therefore a need for an effective solution to the above problems.

Disclosure of Invention

In view of this, the present embodiments provide a resource scheduling method. One or more embodiments of the present specification also relate to a resource scheduling apparatus, a resource scheduling system, a computing device, a computer-readable storage medium, and a computer program, which solve the technical drawbacks of the prior art.

According to a first aspect of embodiments of the present disclosure, there is provided a resource scheduling method, including:

acquiring resource load information and historical resource load information respectively corresponding to the subareas in the storage area;

determining resource load change information corresponding to the subareas in the storage area according to the resource load information and the historical resource load information;

calculating a global load loss value of the warehouse area according to the resource load information and the resource load change information, and calculating the resource quantity to be scheduled corresponding to the subareas in the warehouse area by utilizing the global resource load information and the global load loss value of the warehouse area;

and determining a resource scheduling type corresponding to the resource quantity to be scheduled, creating a resource scheduling task corresponding to the storage area according to the resource scheduling type and the resource quantity to be scheduled, and executing the resource scheduling task.

According to a second aspect of embodiments of the present specification, there is provided a resource scheduling apparatus, including:

the acquisition module is configured to acquire resource load information and historical resource load information respectively corresponding to the subareas in the warehouse area;

the determining module is configured to determine resource load change information corresponding to the subareas in the storage area according to the resource load information and the historical resource load information;

the calculation module is configured to calculate a global load loss value of the warehouse area according to the resource load information and the resource load change information, and calculate the resource quantity to be scheduled corresponding to the subareas in the warehouse area respectively by utilizing the global resource load information and the global load loss value of the warehouse area;

the creation module is configured to determine a resource scheduling type corresponding to the resource quantity to be scheduled, create a resource scheduling task corresponding to the warehouse area according to the resource scheduling type and the resource quantity to be scheduled, and execute the resource scheduling task.

According to a third aspect of embodiments of the present specification, there is provided a resource scheduling system comprising:

a scheduling decision module and a task generation module;

The scheduling decision module and the task generating module are used for storing the resource scheduling executable instruction, and the scheduling decision module and the task generating module realize the steps of the resource scheduling method when executing the resource scheduling executable instruction.

According to a fourth aspect of embodiments of the present specification, there is provided a computing device comprising:

a memory and a processor;

the memory is used for storing computer executable instructions, and the processor is used for implementing the steps of the resource scheduling method when executing the computer executable instructions.

According to a fifth aspect of embodiments of the present specification, there is provided a computer readable storage medium storing computer executable instructions which, when executed by a processor, implement the steps of the resource scheduling method described above.

According to the resource scheduling method provided by the specification, in order to improve the resource utilization rate of the warehouse area and the work efficiency, the resource load information and the historical resource load information corresponding to each sub-area in the warehouse area can be acquired first, the comparison of the resource load information and the historical resource load information is realized, the resource load change information corresponding to each sub-area is determined, and therefore the resource quantity and the activity interval of the task quantity of each sub-area are conveniently analyzed. Thereafter, in order to balance all available resources corresponding to the warehouse area and improve the operation efficiency, a global load loss value corresponding to the warehouse area can be calculated according to the resource load information and the resource load change information of each area, and global resource load information corresponding to the warehouse area is loaded at the same time; on the basis, the global load loss value and the global resource load information corresponding to the warehouse area can be combined, and the resource quantity to be scheduled corresponding to each sub-area is calculated, so that the average utilization rate of all resources of the warehouse area is improved; finally, the resource scheduling tasks of the warehouse area can be created by combining the resource quantity to be scheduled of each sub-area and the corresponding resource scheduling types, so that the resource load balancing is realized by executing the resource scheduling tasks, the resource scheduling is smoother, the aim of improving the average utilization rate of all the resources of the warehouse area is fulfilled, the resource scheduling can be dynamically completed without limiting time, and the overall operation efficiency of the warehouse area is effectively improved.

Drawings

FIG. 1 is a schematic diagram of a resource scheduling method according to an embodiment of the present disclosure;

FIG. 2 is a flow chart of a method for scheduling resources provided in one embodiment of the present disclosure;

FIG. 3 is a process flow diagram of a resource scheduling method according to one embodiment of the present disclosure;

fig. 4 is a schematic structural diagram of a resource scheduling device according to an embodiment of the present disclosure;

FIG. 5 is a block diagram of a computing device provided in one embodiment of the present description.

Detailed Description

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present description. This description may be embodied in many other forms than described herein and similarly generalized by those skilled in the art to whom this disclosure pertains without departing from the spirit of the disclosure and, therefore, this disclosure is not limited by the specific implementations disclosed below.

The terminology used in the one or more embodiments of the specification is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of the specification. As used in this specification, one or more embodiments and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used in one or more embodiments of the present specification refers to and encompasses any or all possible combinations of one or more of the associated listed items.

It should be understood that, although the terms first, second, etc. may be used in one or more embodiments of this specification to describe various information, these information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, a first may also be referred to as a second, and similarly, a second may also be referred to as a first, without departing from the scope of one or more embodiments of the present description. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.

In the present specification, a resource scheduling method is provided, and the present specification relates to a resource scheduling apparatus, a resource scheduling system, a computing device, a computer-readable storage medium, and a computer program, which are described in detail in the following embodiments one by one.

Referring to the schematic diagram shown in fig. 1, in order to improve the resource utilization rate of the warehouse area and improve the operation efficiency, the resource load information and the historical resource load information corresponding to each sub-area in the warehouse area can be obtained first, so that the resource load information and the historical resource load information are compared, the resource load change information corresponding to each sub-area is determined, and therefore the resource quantity and the activity interval of the task quantity of each sub-area are conveniently analyzed. Thereafter, in order to balance all available resources corresponding to the warehouse area and improve the operation efficiency, a global load loss value corresponding to the warehouse area can be calculated according to the resource load information and the resource load change information of each area, and global resource load information corresponding to the warehouse area is loaded at the same time; on the basis, the global load loss value and the global resource load information corresponding to the warehouse area can be combined, and the resource quantity to be scheduled corresponding to each sub-area is calculated, so that the average utilization rate of all resources of the warehouse area is improved; finally, the resource scheduling task of the warehouse area can be created by combining the resource quantity to be scheduled of each sub-area and the corresponding resource scheduling type, so that the resource load balancing is realized by executing the scheduling task, the resource scheduling is smoother, the aim of improving the average utilization rate of all the resources of the warehouse area is fulfilled, the resource scheduling can be dynamically completed without limiting time, and the overall operation efficiency of the warehouse area is effectively improved.

Fig. 2 shows a flowchart of a resource scheduling method according to an embodiment of the present disclosure, which specifically includes the following steps.

Step S202, resource load information and historical resource load information corresponding to the subareas in the warehouse area are obtained.

The resource scheduling method provided in the embodiment can be applied to scheduling processing of any type of resource in a storage scene, the type of resource includes, but is not limited to, an AGV robot, an unmanned forklift, a shuttle, a carrier mobile robot, a container loading and unloading robot, a cargo space container, a movable carrier, and the like, and the resource can be any production resource capable of being allocated in the storage scene, and the embodiment is not limited in any way.

In particular, a warehouse area refers specifically to a warehouse that includes one or more areas that handle different job tasks, including but not limited to one or more receiving areas, one or more picking areas, one or more storage areas, one or more sorting areas, and the like. In practical applications, the number of areas included in the warehouse area and the job task type may be allocated according to the actual requirements, which is not limited in this embodiment. Correspondingly, the resource load information specifically refers to load probability information of the number of tasks to be operated in each sub-area in the warehouse area compared with the number of available resources, and is used for describing the condition of certain type of resource load of each sub-area in the current resource scheduling period. Correspondingly, the historical resource load information is the resource load condition of a certain type in the previous resource scheduling period of the current resource scheduling period.

In practical application, in order to dynamically complete resource allocation after job allocation, certain types of resources can be reasonably balanced at any time point, so that the overall job efficiency of a storage area is improved, and a timing triggering module can trigger a scheduling decision module to start resource scheduling processing after reaching a designated time interval; and after the scheduling decision module is triggered, the upper limit and the lower limit of the production resources in each area in the storage area can be read from the parameter configuration module, the available quantity of the production resources of each type in each area in the storage area can be obtained from the resource monitoring module, and the number of tasks to be completed corresponding to the production resources of each type in each area in the storage area can be read from the task statistics module. And then, the scheduling decision module reads the load loss data obtained by the previous scheduling calculation from the data cache module, and on the basis, resource scheduling processing can be performed, so that the number of various production resources in each sub-area in the warehouse area, which need to be increased or decreased, is determined according to a resource scheduling result, the data information is sent to the task generation module, and meanwhile, the load loss data obtained by the current scheduling process needs to be updated and stored in the data cache module for the next use. The task generating module can generate new generated resource scheduling tasks according to the number of the various production resources in each sub-area, which are obtained by upstream calculation, to be increased or decreased and the cached but unfinished scheduling tasks in the task caching module, so that the production resources can be driven to be dynamically allocated among the storage areas according to the real-time task load condition, and meanwhile, the scheduling tasks generated at this time are updated to the task caching module for next scheduling calculation.

It should be noted that, because there may be multiple production resource types associated with the warehouse area, and job tasks corresponding to each type of resource may not be the same, in order to ensure that resource scheduling is more accurate when resource scheduling can be achieved, and to balance resource usage in the warehouse area, scheduling needs to be completed separately for each type of resource, and scheduling of any type of resource may be the same or corresponding to the scheduling in this embodiment, which is not described in detail herein.

Further, in order to perform dynamic resource scheduling for any type of resource, the method can be implemented by triggering a resource scheduling request; that is, after triggering the resource scheduling request, traversing a resource which is not subjected to resource scheduling at the current stage, and performing resource scheduling processing on the resource; in this embodiment, the specific implementation manner is as follows:

responding to a resource scheduling request submitted for a warehouse area, and determining a target resource type in at least one resource type corresponding to the warehouse area; and acquiring the subareas in the storage area, wherein the subareas respectively correspond to the resource load information and the historical resource load information of the target resource type.

Specifically, the resource scheduling request specifically refers to a request submitted when a certain type of resource scheduling requirement in the storage area is triggered, and the request carries a resource type, so that production resources which need to be subjected to resource balancing processing in the current resource scheduling period can be defined; the resource types include, but are not limited to, unmanned forklift resources, shuttle resources, vehicle mobile robot resources, container handling robot resources, cargo space container resources, movable vehicle resources, and the like.

Based on the above, after receiving a resource scheduling request submitted for the warehouse area, determining a target resource type in at least one resource type corresponding to the warehouse area through analyzing the request; at this time, the resource load information and the historical resource load information of the target resource type corresponding to each sub-area in the storage area can be obtained, so that the subsequent scheduling of the production resource corresponding to the target resource type is convenient.

In this embodiment, a description is given of one type of production resource scheduling process, and other types and multiple types of resource scheduling processes can be referred to the same or corresponding descriptions in this embodiment, which is not repeated here.

In summary, by reading the resource load information and the historical resource load information according to the resource type designated by the resource scheduling request, the resource scheduling task of the target resource type can be accurately generated in the current resource scheduling period, so that the average allocation of the type of resources in the warehouse area in the most balanced mode is realized, and the overall operation efficiency of the warehouse area is improved.

Furthermore, because the number of resources and the number of tasks in each of the storage areas are different, the resource load information and the historical resource load information of each area in the current resource scheduling period need to be confirmed in real time; in this embodiment, the determining the resource load information and the historical resource load information corresponding to any one of the sub-areas in the warehouse area includes:

acquiring available resource information of a region and task information to be worked of the region of a target sub-region in a current resource scheduling period; determining resource load information corresponding to the target subarea according to the available resource information of the area and the task information to be worked in the area; and acquiring resource load information corresponding to a previous resource scheduling period of the current resource scheduling period as historical resource load information corresponding to the target sub-region.

Specifically, the target subarea specifically refers to a subarea in the warehouse area, which needs to be determined by historical resource load information and resource load information, namely any subarea in the warehouse area. Correspondingly, the available resource information of the region specifically refers to the number of resources which can be used by the production resources corresponding to the target resource types in the target subregion; correspondingly, the regional task information to be operated specifically refers to the number of task tasks that need to be executed by the production resources corresponding to the target resource types in the target subregion.

Based on the above, for any sub-region, in order to determine the resource load condition corresponding to the sub-region, the region available resource information and the region task information to be worked in the current resource scheduling period of the target sub-region can be acquired first; on the basis, the resource load information corresponding to the target subarea can be calculated according to the available resource information of the area and the task information to be worked in the area; meanwhile, in order to integrate the influence of regional resource change, the resource load information corresponding to the last resource scheduling period of the current resource scheduling period can be obtained and used as the historical resource load information corresponding to the target subarea, so that the resource scheduling processing can be conveniently finished by combining the resource load information corresponding to each subarea and the historical resource load information.

That is, for each sub-area in the storage area, the area available resource number of each sub-area corresponding to the target resource type and the area task number to be operated corresponding to the type of resources can be respectively read, and the average load value of each sub-area corresponding to the target resource type, namely the resource load information, can be obtained by calculating the ratio of the area task number to be operated to the area available resource number; meanwhile, an average load value corresponding to the last resource scheduling period, namely historical resource load information, is determined, so that subsequent use is facilitated.

For example, the M repository contains region 1, region 2, and region 3, all three of which use type A resources, type B resources, type C resources, and so on. When triggering a scheduling request of A type resources in a current period, firstly acquiring the available resource number of the A type resources and the task number to be operated of the A type resources corresponding to each region; determining that the available resource number of the area 1 with the type A resource is a1, and the task number to be operated is b1; determining that the available resource number of the area 2 with the type A resource is a2, and the task number to be operated is b2; determining that the available resource number of the area 3 with the type A resource is a3, and the task number to be operated is b3; and calculating the ratio of the number of available resources to the number of tasks to be worked in each area to obtain that the average load of the resources of type A corresponding to the area 1 is F11, the average load of the resources of type A corresponding to the area 2 is F12, and the average load of the resources of type A corresponding to the area 3 is F13. And meanwhile, the loading areas 1-3 calculate to obtain average loads in the previous period, the historical average load of the area 1 corresponding to the A type is determined to be F21, the historical average load of the area 2 corresponding to the A type is determined to be F22, and the historical average load of the area 3 corresponding to the A type is determined to be F23, so that the scheduling processing of the A type resources is conveniently carried out by combining the average load of the current period and the average load of the previous period.

In sum, by combining the available resource information of the region corresponding to each sub-region and the task information to be operated in the region to calculate the resource load information, the resource load condition of each sub-region can be fed back more intuitively, so that when the resources are scheduled, the scheduling is ensured to be more accurate, and the operation efficiency of each region is provided.

Step S204, determining resource load change information corresponding to the subareas in the storage area according to the resource load information and the historical resource load information.

Specifically, after the resource load information and the historical resource load information corresponding to each sub-area are obtained, further, considering that the resource load change of each sub-area can reflect whether the resource load of each sub-area is good or bad, and further, what kind of resource scheduling is to be performed on the resource in the current resource scheduling period can be analyzed, so that the resource load change information corresponding to each sub-area in the storage area can be determined by combining the resource load information corresponding to each sub-area and the historical resource load information. The resource load change information specifically indicates a change trend of the corresponding resource load condition of the subarea from the previous resource scheduling period to the current resource scheduling period, and is used for showing whether the subarea resource load is better or worse.

Along the above example, on the basis that the average load of the resources corresponding to the type a in the area 1 is F11 and the average load of the resources corresponding to the type a in the history is F22, the average load of the resources corresponding to the type a in the area 2 is F12 and the average load of the resources corresponding to the type a in the history is F13 and the average load of the resources corresponding to the type a in the area 3 is F23, the average load of each area and the average load of the history can be differenced, so that the average load change trend g1=f11-f21 of the resources corresponding to the type a in the area 1 is obtained; region 2 corresponds to the average load trend g2=f12-F22 for type a resources; the area 3 corresponds to the average load change trend g3=f13-F23 of the type a resource, so that the subsequent scheduling processing of the type a resource can be performed by combining the change trend.

Step S206, calculating the global load loss value of the warehouse area according to the resource load information and the resource load change information, and calculating the resource quantity to be scheduled corresponding to the subareas in the warehouse area by utilizing the global resource load information and the global load loss value of the warehouse area.

Specifically, after the resource load information and the resource load change information of each sub-area are obtained, further, resource scheduling needs to be completed among all the sub-areas related to the warehouse area, and in order to improve the overall operation efficiency of the warehouse area, the global aspect is required to be considered when resource allocation is performed. That is, the global load loss value of the storage area is integrated and calculated according to the resource load information and the resource load change information of each sub-area; on the basis, the global resource load information and the global load loss value of the warehouse area can be combined again, and when the overall load loss of the warehouse area is minimum, the resource quantity to be scheduled corresponding to each sub-area is calculated, so that the subsequent resource scheduling according to the resource quantity to be scheduled is realized, and the purpose of load balancing can be achieved.

The global load loss value specifically refers to a loss condition of production resources corresponding to a target resource type determined based on the whole warehouse area, and is used for reflecting the whole resource load change of the warehouse area. Correspondingly, the global resource load information specifically refers to load proportion information of the total job task number of the warehouse area compared with the total available resource number, and is used for describing the condition of certain type of resource load of the whole warehouse area in the current resource scheduling period. Correspondingly, the resource quantity to be scheduled specifically refers to the corresponding resource quantity to be scheduled when the overall load loss of the subarea in the warehouse area is minimum, wherein the resource quantity to be scheduled comprises the resource quantity to be increased or the resource quantity to be reduced.

Furthermore, in order to accurately embody the global load loss value corresponding to the warehouse area, the integration of the resource load information and the resource load change information of all the subareas is completed; in this embodiment, the specific implementation manner is as follows:

reading preset configuration parameters, and extracting a first loss coefficient and a second loss coefficient from the configuration parameters; calculating the resource load values of the areas corresponding to the subareas in the storage area according to the first loss coefficient and the resource load information corresponding to the subareas in the storage area respectively; calculating the region load change values corresponding to the subregions in the storage region according to the second loss coefficient and the resource load change information corresponding to the subregions in the storage region respectively; and determining regional load loss values corresponding to the subareas in the warehouse area based on the regional resource load values and the regional load change values corresponding to the subareas in the warehouse area, and calculating the global load loss value of the warehouse area according to the regional load loss values.

Specifically, the configuration parameter specifically refers to a parameter integrating the first loss coefficient and the second loss coefficient, which may be set according to the actual requirement according to the load information and the influence weight of the load change information, which is not limited in any way herein. Correspondingly, the regional resource load value specifically refers to a value calculated by combining the resource load information corresponding to the subarea and the first loss coefficient. The regional load change value specifically refers to a value calculated by combining the resource load change information corresponding to the subregion and the second loss coefficient. Correspondingly, the regional load loss value specifically refers to a value obtained by integrating regional resource load values and regional load change values corresponding to all the subareas, and is used for representing the overall load balancing loss of the storage region.

Based on the above, when calculating the global load loss value, in order to reflect the load balance loss of the production resource from the warehouse area as a whole, a preset configuration parameter can be read first, and a first loss coefficient and a second loss coefficient are extracted from the configuration parameter; at this time, according to the first loss coefficient and the resource load information corresponding to each sub-region in the storage region, calculating the resource load value of the region corresponding to each sub-region in the storage region; meanwhile, calculating a load change value of each sub-area corresponding area in the warehouse area according to the second loss coefficient and the resource load change information corresponding to each sub-area in the warehouse area; on the basis, the regional load loss values corresponding to the subareas in the warehouse area can be calculated based on the regional resource load values and the regional load change values corresponding to each subarea in the warehouse area, and the global load loss value of the warehouse area can be calculated according to the regional load loss values.

That is, after the first loss coefficient and the second loss coefficient are read, for each sub-area in the storage area, the area load balancing loss of each sub-area can be calculated based on the current task number to be worked and the available resource number, and when the area load balancing loss is calculated, the product of the first loss coefficient and the resource load information and the product of the second loss coefficient and the resource load change information can be calculated, and then the product results are summed, so that the area load loss value corresponding to the sub-area, namely the area load balancing loss, is obtained; and then, carrying out square sum calculation on the regional load loss value of each region in the warehouse region, and remembering the calculation result as the global load loss value of the warehouse region.

In summary, by calculating the global load loss value based on the area load change value corresponding to each sub-area in the warehouse area, the global load loss value can be ensured to more accurately reflect the overall resource load condition of the warehouse area, so that the resource quantity to be scheduled corresponding to each sub-area can be accurately calculated based on the follow-up condition.

Furthermore, when calculating the amount of resources to be scheduled, considering that the number of tasks processed by each sub-area in the current resource scheduling period and the number of missing or redundant resources are different, the optimization algorithm is required to calculate the optimal solution, and in this embodiment, the specific implementation manner is as follows:

Acquiring global available resource information and global task information to be operated corresponding to the warehouse area; calculating global resource load information corresponding to the warehouse area according to the global available resource information and the global task information to be operated; and calculating the global resource load information and the global load loss value by using a preset optimization algorithm, and determining the resource quantity to be scheduled corresponding to the subareas in the storage area according to a calculation result.

Specifically, the global available resource information specifically refers to the total available production resource amount of the currently specified type in the warehouse area. Correspondingly, the global task information to be operated specifically refers to the total amount of tasks to be operated corresponding to various types of production resources. Correspondingly, the preset optimization algorithm specifically means that when the global load loss value is set to be minimum, the optimal resource number which should be configured in each sub-area can be solved, and the production resource number which is increased or decreased through scheduling, for example, the optimization algorithm can select a genetic algorithm, wherein the genetic algorithm is a method for searching an optimal solution through simulating a natural evolution process. The algorithm converts the solving process of the problem into processes like crossing, mutation and the like of chromosome genes in biological evolution by using a computer simulation operation in a mathematical mode.

Based on the above, when calculating the resource quantity to be scheduled corresponding to each sub-region in the warehouse region, global available resource information and global task information to be operated corresponding to the warehouse region can be acquired first; the method comprises the steps of calculating global resource load information corresponding to a storage area according to global available resource information and global task information to be operated; and at the moment, calculating the global resource load information and the global load loss value by using a preset optimization algorithm, and determining the resource quantity to be scheduled corresponding to the subareas in the storage area according to the calculation result.

In conclusion, the resource scheduling efficiency can be effectively improved by adopting an optimization algorithm to calculate the amount of resources to be scheduled in each sub-area in a mode of solving under the set condition.

On the basis, as different subareas may have the condition of resource demand or release, different amounts of resources to be scheduled need to be created according to different conditions, so that when tasks are created and executed, reasonable utilization of the resources can be ensured; in this embodiment, the determining the amount of resources to be scheduled corresponding to any one of the sub-areas in the warehouse area includes:

determining reference resource information corresponding to the target sub-region according to the calculation result; according to the reference resource information, determining the required resource quantity or redundant resource quantity of the target subarea in the current resource scheduling period; and taking the required resource amount or the redundant resource amount as the resource amount to be scheduled corresponding to the target subarea.

Specifically, the reference resource information specifically refers to the number of resources that should be allocated to each sub-area in the case of setting the total available number of resources in the warehouse area. Correspondingly, the required resource amount specifically refers to the resource amount required by the target sub-area, and the redundant resource amount specifically refers to the resource amount required to be reduced by the target sub-area.

Based on the above, for any target sub-region, after the calculation is completed, determining the reference resource information corresponding to the target sub-region; then, according to the reference resource information, the required resource amount or redundant resource amount of the target subarea in the current resource scheduling period can be determined; and taking the required resource amount or the redundant resource amount as the resource amount to be scheduled corresponding to the target subarea.

That is, the total amount of available resources of the designated type and the total number of tasks to be worked corresponding to the production resources of the various types in all the areas of the warehouse area need to be read, and the global resource load information of the warehouse area, namely the preferred average load value of the production resources of the designated type, can be obtained by calculating the ratio of the total number of tasks to be worked to the total amount of the available resources. On the basis, a genetic algorithm can be used for calculating the number of resources which are required to be configured under each subarea when the overall load balancing loss of the warehouse area is minimized, and the number of resources which are required to be increased or decreased through scheduling, so that the resource scheduling task is conveniently established subsequently, and the resource reallocation is realized.

Along the above example, after obtaining the average load and average load variation trend of the resources corresponding to the type a in the areas 1, 2 and 3, the total number of available resources corresponding to the type a resources in the current period of the M warehouse and the total number of tasks to be worked corresponding to the types of resources can be obtained, and the average load F of the M warehouse is obtained by calculating the ratio of the total number of tasks to be worked to the total number of available resources.

Further, firstly, obtaining a loss coefficient N1 and a loss coefficient N2; secondly, for the area 1, the area load balancing loss h1=n1×f11+n2×g1 can be obtained by calculating the product of the loss coefficient N1 and the average load F11 and the product of the loss coefficient N2 and the average load change trend G1, and summing the product results to obtain the area 1 on the premise of the task number b1 to be operated and the available resource number a 1; for the area 2, the area load balancing loss h2=n1×f12+n2×g2 under the premise that the number of tasks to be operated b2 and the number of available resources a2 of the area 2 are obtained by calculating the product of the loss coefficient N1 and the average load F12 and the product of the loss coefficient N2 and the average load change trend G2 and summing the product results; for the area 3, the area load balancing loss h3=n1×f13+n2×g3 can be obtained by calculating the product of the loss coefficient N1 and the average load F13 and the product of the loss coefficient N2 and the average load change trend G3, and then summing the product results on the premise that the task number b3 to be worked and the available resource number a3 of the area 3. And thirdly, square sum calculation can be carried out on the regional load balancing loss corresponding to each region, so that the overall load balancing loss L corresponding to the M warehouse is obtained.

Further, using a genetic algorithm, calculating the number of type a resources to be configured corresponding to each region and the number of type a resources to be increased or decreased for each region when the overall load balancing loss corresponding to the M warehouse is minimized. Determining that the resource quantity of the A type resource to be configured in the area 1 is X1 according to the calculation result, and the resource quantity of the A type resource to be added is Y1; the number of resources of the type A resources should be configured as X2 in the area 2, and the number of resources of the type A resources needs to be increased as Y2; the number of resources of the A type resources should be configured as X3 in the area 3, and the number of resources of the A type resources needs to be reduced as Y3, so that the subsequent establishment of scheduling tasks can be performed based on the number of the resources of the A type resources, and the reasonable allocation of the A type resources among the areas is realized.

In sum, by accurately calculating the resource quantity to be scheduled corresponding to each sub-region, a more reasonable resource scheduling task can be created for scheduling types, resource types and scheduling quantities later, resources can be reasonably allocated among all sub-regions contained in the warehouse region, and therefore the operation efficiency of the warehouse region is integrally improved.

Step S208, determining a resource scheduling type corresponding to the resource quantity to be scheduled, creating a resource scheduling task corresponding to the storage area according to the resource scheduling type and the resource quantity to be scheduled, and executing the resource scheduling task.

Specifically, after determining the resource quantity to be scheduled corresponding to each sub-area, in order to be able to determine the resource quantity to be increased in each area and the resource quantity to be reduced in each area when creating the scheduling task, the resource scheduling type corresponding to the resource quantity to be scheduled can be determined first, the required area and the supply area can be divided according to the type, the resource scheduling task which is completed but not executed currently can be combined, the resource scheduling task corresponding to the warehouse area can be created according to the resource scheduling type and the resource quantity to be scheduled, and the available resource load in the warehouse area can be balanced by executing the resource scheduling task subsequently, so that the resource is fully utilized and other jobs are not influenced.

The resource scheduling type specifically refers to a demand resource scheduling type and a supply resource scheduling type determined according to the amount of resources to be scheduled, and is used for defining the resource demand or reduction condition of each sub-area. Accordingly, a resource scheduling task specifically refers to a task for scheduling a target type of resource, for determining how much the resource in each region should be reduced or increased, and which sub-region the resource should be provided by or allocated to.

Furthermore, when a resource scheduling task is created, in order to achieve the balance of the available resource load corresponding to the warehouse area, a matching relationship can be established by combining the demand area and the supply area, so that complementation between the area resources is performed according to the matching relationship, and the resource scheduling task is established to achieve the balance of the resource load; in this embodiment, the specific implementation manner is as follows:

determining resource scheduling types of the resource amounts to be scheduled, which correspond to the subareas in the storage area respectively; selecting a subarea with a resource scheduling type as a resource supply type to form a resource supply set, and selecting a subarea with a resource scheduling type as a resource demand type to form a resource demand set; establishing a region matching relationship between the supply region elements in the resource supply set and the demand region elements in the resource demand set; and creating a resource scheduling task corresponding to the storage area according to the building result of the area matching relation and executing the resource scheduling task.

In particular, a resource supply set refers in particular to a set consisting of sub-regions providing available resources; the supply region element is the sub-region of the set that provides the available resources. Correspondingly, the resource demand set specifically refers to a set composed of sub-areas requiring available resources; the required area element is the sub-area of the set that requires available resources. The region matching relationship is used for matching a demand region and a supply region, for example, n transfer robots are needed in a sorting region, and m transfer robots are more than m transfer robots in a receiving region, so that the sorting region and the receiving region have matching relationship. In the preferred case where n=m is not equal, the two sub-regions matching the minimum value of n-m may be matched.

Based on the above, after obtaining the resource types to be scheduled corresponding to each sub-region, in order to accurately complete resource scheduling, the resource scheduling types of the resource amounts to be scheduled corresponding to the sub-regions in the storage region can be determined; the method comprises the steps of realizing that a resource supply set is formed by selecting a sub-region with a resource scheduling type as a resource supply type, and a resource demand set is formed by selecting a sub-region with a resource scheduling type as a resource demand type; thereafter, by establishing a region matching relationship between the supply region elements in the resource supply set and the demand region elements in the resource demand set; the matching of the supply area and the demand area is realized, so that a resource scheduling task corresponding to the storage area can be created according to the establishment result of the area matching relation, and the resource reallocation of the target resource type can be accurately completed through the execution task.

That is, after the amount of resources to be scheduled corresponding to each sub-area in the storage area is obtained through the above processing procedure, for the sub-area where the production resources need to be reduced, a corresponding amount of resources may be selected to form a resource supply set. Similarly, for areas where resources need to be added, each available resource corresponds to a requirement, and a resource requirement set is formed. On the basis of the two sets, a preferable matching relation can be found, so that a resource scheduling task is established according to the matching relation.

By comprehensively matching the demand area and the supply area in an area matching mode, two areas with complementary relations can be rapidly determined, and resource scheduling tasks can be rapidly realized by creating the resource scheduling tasks, so that the aim of balancing the resource load of the warehouse area is fulfilled.

Furthermore, when the resource scheduling task is created, the resource type, the required resource and the supply resource are combined to complete the construction of the triples, and the resource scheduling task can be accurately generated based on the triples; in this embodiment, the specific implementation manner is as follows:

constructing a task triplet according to the region matching relationship; creating a resource scheduling task corresponding to the warehouse area based on the available resource type, the supply area information and the demand area information contained in the task triplet; and writing the resource scheduling task into a resource scheduling task set, and sequentially executing the resource scheduling tasks contained in the resource scheduling task set.

Specifically, the task triplet specifically refers to a data structure composed of available resource types, supply area information and demand area information, wherein the available resource types are target resource types to be scheduled in the current resource scheduling period; the supply area information specifically refers to an area where the type of resource is provided, and the demand area information specifically refers to an area where the type of resource is required. Correspondingly, the resource scheduling task set specifically refers to a set of cached resource scheduling tasks for subsequent resource scheduling processing.

In practical application, when executing a resource scheduling task, if the resource type is a mobile device such as a robot, the departure place and destination of the robot can be determined directly according to the supply area information and the demand area information in the task, then the available under-robot issuing route and job task at the current moment are selected, and the robot is driven to move from the supply area to the demand area to perform the job. If the resource type is operator, the scheduling information can be sent to the operator terminal, so that the operator can determine a new job task and a job site after reading the scheduling information, and the operator can move from the supply area to the demand area to perform the job.

Based on the above, after the matching relationship is established, a task triplet can be established according to the region matching relationship; at the moment, a resource scheduling task corresponding to the warehouse area can be created based on the available resource type, the supply area information and the demand area information contained in the task triplet; after the task is established, the resource scheduling task can be written into the resource scheduling task set, so that the subsequent resource scheduling processing is completed by sequentially executing the resource scheduling tasks contained in the resource scheduling task set.

In practical application, in order to realize matching quickly and accurately when the matching relationship is established, a Hungary algorithm can be used for searching the matching relationship, wherein the Hungary algorithm is a combined optimization algorithm for solving task allocation problems in polynomial time. That is, the algorithm can solve the problem of one-to-one matching of each element in the resource supply set to each element in the resource demand set with the minimum task execution time as a target, so as to obtain a triplet < resource type, supply area, demand area >, and write the triplet into the set to facilitate subsequent generation of the task to be scheduled.

In addition, considering that the resource scheduling task generated in the previous resource scheduling period may not be executed yet, after a new task is regenerated at this time, the problem that the tasks overlap or the real-time state is not updated timely may occur; in order to achieve the purpose of real-time dynamic scheduling of resources, task comparison processing can be performed before task writing into the set; in this embodiment, the specific implementation manner is as follows:

placing the resource scheduling task into a candidate task set and acquiring a historical resource scheduling task set; performing task comparison on the candidate task set and the historical resource scheduling task set, and canceling complementary resource scheduling tasks in the historical resource scheduling task set according to a task comparison result; and canceling the historical resource scheduling task set of the complementary resource scheduling task to be used as the resource scheduling task set.

Specifically, the candidate task set refers to a set of temporarily placing resource scheduling tasks before determining the resource scheduling task set, and aims to compare with the historical resource scheduling task set and reject unnecessary resource scheduling tasks. Accordingly, the complementary resource scheduling task specifically refers to a resource scheduling task that needs to be deleted, and has a complementary relationship with a certain scheduling candidate task in the currently obtained candidate task set. Accordingly, the historical resource scheduling task set specifically refers to a set composed of resource scheduling tasks that have been generated but not executed before the current resource scheduling period.

Based on the above, after obtaining the resource scheduling task, the resource scheduling task can be put into the candidate task set, and the history resource scheduling task set is obtained; the candidate task set and the historical resource scheduling task set are subjected to task comparison, so that complementary resource scheduling tasks can be cancelled in the historical resource scheduling task set according to the task comparison result; and then taking the historical resource scheduling task set with the complementary resource scheduling task cancelled as the resource scheduling task set for subsequent use.

That is, after obtaining the triples, each triplet may be used as a resource scheduling task to be generated and form a candidate task set. And then, a historical resource scheduling task set consisting of generated but unexecuted resource scheduling tasks can be associated with the current resource scheduling period, and then, for each task in the historical resource scheduling task set, if a providing area is exactly a required area of a certain task in the historical resource scheduling task set and is exactly a providing area of the task in the historical resource scheduling task set, the task which is not completed in the historical resource scheduling task set can be cancelled by traversing the candidate task set. Otherwise, the task to be generated in the current traversal candidate task set can be written into the resource scheduling task set, and the resource scheduling task set is the history resource scheduling task set after the complementary task is cancelled. And finally, traversing newly added elements in the set, sequentially generating resource scheduling tasks according to the available resource types, the supply area information and the demand area information in the triples, and writing the resource scheduling tasks into the set to be executed.

Along the above example, after obtaining the resource types and the resource requirements and the supply quantity information corresponding to the areas 1, 2 and 3 respectively, an area composition resource supply set needing to reduce the type-a resources can be selected, the resource supply set comprises the area 3, an area composition resource requirement set needing to increase the type-a resources is selected similarly, and the resource supply set comprises the areas 1 and 2.

Further, the matching relationship between the area 1 and the area 2 in the resource supply set and the area 3 in the resource demand set can be solved by using a hungarian algorithm with the minimum scheduling task execution time as a target, so as to obtain triples of < resource type a, supply area 3, demand area 1>, < resource type a, supply area 3, demand area 2>, and each triplet corresponds to one resource scheduling task to be generated, thereby forming the set 1.

Furthermore, the set 2 corresponding to the a-type resource which is generated before the current resource scheduling period and is not yet completed is read, the set 1 is traversed, the requirement area 3 is determined to be just the requirement area of the S task in the set 2, meanwhile, the requirement area 2 is just the requirement area of the S task in the set 2, the incomplete S task can be canceled in the set 2 at this time, and after the traversing is completed, the task to be generated in the set 1 is put into the set 3.

Finally, elements in the set 3 are traversed to obtain a triplet of resource type A, a supply area 3 and a demand area 1>, an A type resource scheduling task is created according to the resource type, the supply area and the supply area, and the task content is that X1A type resources are selected in the area 3 to be scheduled to the area 1 for operation.

According to the resource scheduling method provided by the specification, in order to improve the resource utilization rate of the warehouse area and the work efficiency, the resource load information and the historical resource load information corresponding to each sub-area in the warehouse area can be acquired first, the comparison of the resource load information and the historical resource load information is realized, the resource load change information corresponding to each sub-area is determined, and therefore the resource quantity and the activity interval of the task quantity of each sub-area are conveniently analyzed. Thereafter, in order to balance all available resources corresponding to the warehouse area and improve the operation efficiency, a global load loss value corresponding to the warehouse area can be calculated according to the resource load information and the resource load change information of each area, and global resource load information corresponding to the warehouse area is loaded at the same time; on the basis, the global load loss value and the global resource load information corresponding to the warehouse area can be combined, and the resource quantity to be scheduled corresponding to each sub-area is calculated, so that the average utilization rate of all resources of the warehouse area is improved; finally, the resource scheduling task of the warehouse area can be created by combining the resource quantity to be scheduled of each sub-area and the corresponding resource scheduling type, so that the resource load balancing is realized by executing the scheduling task, the resource scheduling is smoother, the aim of improving the average utilization rate of all the resources of the warehouse area is fulfilled, the resource scheduling can be dynamically completed without limiting time, and the overall operation efficiency of the warehouse area is effectively improved.

The resource scheduling method provided in the present specification is further described below by taking an application of the resource scheduling method in a resource scenario of a handling robot as an example with reference to fig. 3. Fig. 3 is a flowchart of a processing procedure of a resource scheduling method according to an embodiment of the present disclosure, which specifically includes the following steps.

Step S302, in response to a resource scheduling request submitted for the warehouse area, determining a target resource type in at least one resource type corresponding to the warehouse area.

Step S304, obtaining the subareas in the warehouse area, and respectively corresponding to the resource load information and the historical resource load information of the target resource type.

The determining of the resource load information and the historical resource load information corresponding to any one sub-area in the storage area comprises the following steps: acquiring available resource information of a region and task information to be worked of the region of a target sub-region in a current resource scheduling period; determining resource load information corresponding to the target subarea according to the available resource information of the area and the task information to be worked in the area; and acquiring resource load information corresponding to the last resource scheduling period of the current resource scheduling period, and taking the resource load information as historical resource load information corresponding to the target subarea.

Step S306, determining resource load change information corresponding to the subareas in the storage area according to the resource load information and the historical resource load information.

Step S308, a preset configuration parameter is read, and a first loss coefficient and a second loss coefficient are extracted from the configuration parameter.

Step S310, calculating the resource load values of the subareas in the storage area according to the first loss coefficient and the resource load information of the subareas in the storage area.

Step S312, calculating the regional load change values corresponding to the subregions in the warehouse region according to the second loss coefficient and the resource load change information corresponding to the subregions in the warehouse region.

Step S314, determining regional load loss values corresponding to the subareas in the warehouse area based on the regional resource load values and the regional load change values corresponding to the subareas in the warehouse area, and calculating the global load loss value of the warehouse area according to the regional load loss values.

Step S316, global available resource information and global task information to be worked corresponding to the warehouse area are obtained.

Step S318, calculating global resource load information corresponding to the warehouse area according to the global available resource information and the global task information to be operated.

And step S320, calculating global resource load information and a global load loss value by using a preset optimization algorithm, and determining the resource quantity to be scheduled corresponding to the subareas in the storage area according to the calculation result.

The determining of the resource quantity to be scheduled corresponding to any one sub-area in the storage area comprises the following steps: determining reference resource information corresponding to the target sub-region according to the calculation result; according to the reference resource information, determining the required resource quantity or redundant resource quantity of the target subarea in the current resource scheduling period; and taking the required resource quantity or the redundant resource quantity as the resource quantity to be scheduled corresponding to the target subarea.

Step S322, determining the resource scheduling type of the resource quantity to be scheduled corresponding to the subareas in the warehouse area.

In step S324, the sub-regions with the resource scheduling type being the resource supply type are selected to form the resource supply set, and the sub-regions with the resource scheduling type being the resource demand type are selected to form the resource demand set.

In step S326, a region matching relationship between the supply region elements in the resource supply set and the demand region elements in the resource demand set is established.

Step S328, a task triplet is constructed according to the region matching relationship, and a resource scheduling task corresponding to the warehouse region is created based on the available resource types, the supply region information and the demand region information contained in the task triplet.

Step S330, the resource scheduling task is put into the candidate task set, and the history resource scheduling task set is obtained.

Step S332, performing task comparison on the candidate task set and the historical resource scheduling task set, and canceling the complementary resource scheduling task in the historical resource scheduling task set according to the task comparison result.

Step S334, the historical resource scheduling task set of the complementary resource scheduling task is cancelled and used as the resource scheduling task set.

Step S336, the resource scheduling task is written into the resource scheduling task set, and the resource scheduling tasks contained in the resource scheduling task set are sequentially executed.

Corresponding to the method embodiment, the present disclosure further provides an embodiment of a resource scheduling device, and fig. 4 shows a schematic structural diagram of the resource scheduling device provided in one embodiment of the present disclosure. As shown in fig. 4, the apparatus includes:

an obtaining module 402, configured to obtain resource load information and historical resource load information corresponding to the sub-regions in the storage region respectively;

a determining module 404, configured to determine resource load change information corresponding to the subareas in the storage area according to the resource load information and the historical resource load information;

a calculating module 406, configured to calculate a global load loss value of the warehouse area according to the resource load information and the resource load change information, and calculate the resource amounts to be scheduled corresponding to the sub-areas in the warehouse area respectively by using the global resource load information and the global load loss value of the warehouse area;

the creating module 408 is configured to determine a resource scheduling type corresponding to the resource amount to be scheduled, and create and execute a resource scheduling task corresponding to the warehouse area according to the resource scheduling type and the resource amount to be scheduled.

In an alternative embodiment, the acquisition module 402 is further configured to:

In an optional embodiment, the determining the resource load information and the historical resource load information corresponding to any one of the sub-areas in the warehouse area includes:

In an alternative embodiment, the computing module 406 is further configured to:

In an optional embodiment, the determining the amount of resources to be scheduled corresponding to any one of the sub-areas in the warehouse area includes:

In an alternative embodiment, the creation module 408 is further configured to:

According to the resource scheduling device provided by the specification, in order to improve the resource utilization rate of the warehouse area and the work efficiency, the resource load information and the historical resource load information corresponding to each sub-area in the warehouse area can be acquired first, the comparison of the resource load information and the historical resource load information is realized, the resource load change information corresponding to each sub-area is determined, and therefore the resource quantity and the activity interval of the task quantity of each sub-area are conveniently analyzed. Thereafter, in order to balance all available resources corresponding to the warehouse area and improve the operation efficiency, a global load loss value corresponding to the warehouse area can be calculated according to the resource load information and the resource load change information of each area, and global resource load information corresponding to the warehouse area is loaded at the same time; on the basis, the global load loss value and the global resource load information corresponding to the warehouse area can be combined, and the resource quantity to be scheduled corresponding to each sub-area is calculated, so that the average utilization rate of all resources of the warehouse area is improved; finally, the resource scheduling task of the warehouse area can be created by combining the resource quantity to be scheduled of each sub-area and the corresponding resource scheduling type, so that the resource load balancing is realized by executing the scheduling task, the resource scheduling is smoother, the aim of improving the average utilization rate of all the resources of the warehouse area is fulfilled, the resource scheduling can be dynamically completed without limiting time, and the overall operation efficiency of the warehouse area is effectively improved.

The foregoing is a schematic scheme of a resource scheduling apparatus of this embodiment. It should be noted that, the technical solution of the resource scheduling device and the technical solution of the resource scheduling method belong to the same concept, and details of the technical solution of the resource scheduling device, which are not described in detail, can be referred to the description of the technical solution of the resource scheduling method.

Corresponding to the method embodiment, the specification also provides a resource scheduling system embodiment, wherein the resource scheduling system comprises a scheduling decision module and a task generating module; the scheduling decision module and the task generating module are used for storing the resource scheduling executable instruction, and the scheduling decision module and the task generating module realize the steps of the resource scheduling method when executing the resource scheduling executable instruction.

In an optional embodiment, the resource scheduling system further includes a parameter configuration module, a timing trigger module, a task statistics module, a resource monitoring module, a data cache module and a task cache module;

the parameter configuration module is used for collecting resource limit information corresponding to the subareas in the storage area respectively and feeding back to the scheduling decision module; the timing triggering module is used for setting resource scheduling time and sending a resource scheduling request to the scheduling decision module under the condition that the resource scheduling time is reached; the task statistics module is used for sending the region task information to be worked corresponding to the subareas in the warehouse region to the scheduling decision module; the resource monitoring module is used for sending the area available resource information corresponding to the subareas in the storage area to the scheduling decision module; the data caching module is used for storing resource load information associated with a resource scheduling period; the task cache module is used for storing resource scheduling tasks associated with the resource scheduling period.

The above is an exemplary scheme of a resource scheduling system of the present embodiment. It should be noted that, the technical solution of the resource scheduling system and the technical solution of the resource scheduling method belong to the same concept, and details of the technical solution of the resource scheduling system, which are not described in detail, can be referred to the description of the technical solution of the resource scheduling method.

Fig. 5 illustrates a block diagram of a computing device 500 provided in accordance with one embodiment of the present description. The components of the computing device 500 include, but are not limited to, a memory 510 and a processor 520. Processor 520 is coupled to memory 510 via bus 530 and database 550 is used to hold data.

Computing device 500 also includes access device 540, access device 540 enabling computing device 500 to communicate via one or more networks 560. Examples of such networks include public switched telephone networks (PSTN, public Switched Telephone Network), local area networks (LAN, local Area Network), wide area networks (WAN, wide Area Network), personal area networks (PAN, personal Area Network), or combinations of communication networks such as the internet. The access device 540 may include one or more of any type of network interface, wired or wireless (e.g., network interface card (NIC, network interface controller)), such as an IEEE802.11 wireless local area network (WLAN, wireless Local Area Network) wireless interface, a worldwide interoperability for microwave access (Wi-MAX, worldwide Interoperability for Microwave Access) interface, an ethernet interface, a universal serial bus (USB, universal Serial Bus) interface, a cellular network interface, a bluetooth interface, a near field communication (NFC, near Field Communication) interface, and so forth.

In one embodiment of the present application, the above-described components of computing device 500, as well as other components not shown in FIG. 5, may also be connected to each other, such as by a bus. It should be understood that the block diagram of the computing device illustrated in FIG. 5 is for exemplary purposes only and is not intended to limit the scope of the present application. Those skilled in the art may add or replace other components as desired.

Computing device 500 may be any type of stationary or mobile computing device, including a mobile computer or mobile computing device (e.g., tablet, personal digital assistant, laptop, notebook, netbook, etc.), mobile phone (e.g., smart phone), wearable computing device (e.g., smart watch, smart glasses, etc.), or other type of mobile device, or a stationary computing device such as a desktop computer or personal computer (PC, personal Computer). Computing device 500 may also be a mobile or stationary server.

Wherein the processor 520 is configured to execute computer-executable instructions that, when executed by the processor, perform the steps of the resource scheduling method described above.

The foregoing is a schematic illustration of a computing device of this embodiment. It should be noted that, the technical solution of the computing device and the technical solution of the resource scheduling method belong to the same concept, and details of the technical solution of the computing device, which are not described in detail, can be referred to the description of the technical solution of the resource scheduling method.

An embodiment of the present disclosure also provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the resource scheduling method described above.

The above is an exemplary version of a computer-readable storage medium of the present embodiment. It should be noted that, the technical solution of the storage medium and the technical solution of the resource scheduling method belong to the same concept, and details of the technical solution of the storage medium, which are not described in detail, can be referred to the description of the technical solution of the resource scheduling method.

An embodiment of the present disclosure further provides a computer program, where the computer program, when executed in a computer, causes the computer to perform the steps of the resource scheduling method described above.

The above is an exemplary version of a computer program of the present embodiment. It should be noted that, the technical solution of the computer program and the technical solution of the resource scheduling method belong to the same concept, and details of the technical solution of the computer program, which are not described in detail, can be referred to the description of the technical solution of the resource scheduling method.

The foregoing describes specific embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

The computer instructions include computer program code that may be in source code form, object code form, executable file or some intermediate form, etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth. It should be noted that the content of the computer readable medium can be increased or decreased appropriately according to the requirements of the patent practice, for example, in some areas, according to the patent practice, the computer readable medium does not include an electric carrier signal and a telecommunication signal.

It should be noted that, for simplicity of description, the foregoing method embodiments are all expressed as a series of combinations of actions, but it should be understood by those skilled in the art that the embodiments are not limited by the order of actions described, as some steps may be performed in other order or simultaneously according to the embodiments of the present disclosure. Further, those skilled in the art will appreciate that the embodiments described in the specification are all preferred embodiments, and that the acts and modules referred to are not necessarily all required for the embodiments described in the specification.

In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to the related descriptions of other embodiments.

The preferred embodiments of the present specification disclosed above are merely used to help clarify the present specification. Alternative embodiments are not intended to be exhaustive or to limit the invention to the precise form disclosed. Obviously, many modifications and variations are possible in light of the teaching of the embodiments. The embodiments were chosen and described in order to best explain the principles of the embodiments and the practical application, to thereby enable others skilled in the art to best understand and utilize the invention. This specification is to be limited only by the claims and the full scope and equivalents thereof.

Claims

1. A method of resource scheduling, comprising:

acquiring resource load information and historical resource load information respectively corresponding to subareas in a warehouse area, wherein the resource load information is load probability information of the number of tasks to be worked in the subareas in the warehouse area relative to the number of available resources, and the historical resource load information is resource load information corresponding to a previous resource scheduling period of a current resource scheduling period;

reading preset configuration parameters, extracting a first loss coefficient and a second loss coefficient from the configuration parameters, calculating regional resource load values corresponding to the subregions in the storage region according to the resource load information corresponding to the first loss coefficient and the subregions in the storage region, and calculating regional load change values corresponding to the subregions in the storage region according to the resource load change information corresponding to the second loss coefficient and the subregions in the storage region;

determining regional load loss values corresponding to the subareas in the storage area based on regional resource load values and regional load change values corresponding to the subareas in the storage area respectively, and calculating global load loss values of the storage area according to the regional load loss values, wherein the global load loss values are loss information of production resources corresponding to target resource types in the storage area;

Acquiring global available resource information and global job waiting task information corresponding to the warehouse area, and calculating global resource load information corresponding to the warehouse area according to the global available resource information and the global job waiting task information, wherein the global resource load information is load proportion information of the total job task number of the warehouse area compared with the total available resource number;

calculating the global resource load information and the global load loss value by utilizing a genetic algorithm, and determining the resource quantity to be scheduled corresponding to the subareas in the warehouse area according to a calculation result, wherein the resource quantity to be scheduled is the required resource quantity or the redundant resource quantity corresponding to the subareas, and determining the resource quantity to be allocated to each subarea under the condition that the reference resource information is set for the global available resource quantity of the warehouse area according to the reference resource information corresponding to the subareas, the required resource quantity is the resource quantity to be increased by the subareas, and the redundant resource quantity is the resource quantity to be reduced by the subareas;

determining resource scheduling types of the resource amounts to be scheduled, which correspond to the subareas in the warehouse area respectively, selecting the subareas with the resource scheduling types as resource supply types to form a resource supply set, and selecting the subareas with the resource scheduling types as resource demand types to form a resource demand set;

Establishing a region matching relation between supply region elements in the resource supply set and demand region elements in the resource demand set, constructing a task triplet according to the region matching relation, creating a resource scheduling task corresponding to the storage region based on available resource types, supply region information and demand region information contained in the task triplet, writing the resource scheduling task into the resource scheduling task set, and sequentially executing the resource scheduling tasks contained in the resource scheduling task set.

2. The method of claim 1, the obtaining resource load information and historical resource load information corresponding to sub-regions in a storage area, respectively, comprising:

responding to a resource scheduling request submitted for a warehouse area, and determining a target resource type in at least one resource type corresponding to the warehouse area;

and acquiring resource load information and historical resource load information of the subareas in the warehouse area, wherein the subareas correspond to the target resource types respectively.

3. The method of claim 2, wherein determining the resource load information and the historical resource load information corresponding to any one of the sub-regions in the warehouse region comprises:

Acquiring available resource information of a region and task information to be worked of the region of a target sub-region in a current resource scheduling period;

determining resource load information corresponding to the target subarea according to the available resource information of the area and the task information to be worked in the area;

and acquiring resource load information corresponding to a previous resource scheduling period of the current resource scheduling period as historical resource load information corresponding to the target sub-region.

4. The method of claim 1, wherein the determining the amount of resources to be scheduled corresponding to any one of the sub-areas in the warehouse area comprises:

determining reference resource information corresponding to the target sub-region according to the calculation result;

according to the reference resource information, determining the required resource quantity or redundant resource quantity of the target subarea in the current resource scheduling period;

and taking the required resource amount or the redundant resource amount as the resource amount to be scheduled corresponding to the target subarea.

5. The method of claim 1, further comprising, prior to the step of writing the resource scheduling task to the resource scheduling task set,:

placing the resource scheduling task into a candidate task set, and acquiring a historical resource scheduling task set, wherein the historical resource scheduling task set is a set formed by resource scheduling tasks which are generated before the current resource scheduling period and are not executed;

Performing task comparison on the candidate task set and the historical resource scheduling task set, and canceling a complementary resource scheduling task in the historical resource scheduling task set according to a task comparison result, wherein the complementary resource scheduling task is a resource scheduling task to be deleted, and the resource scheduling task to be deleted has a complementary relationship with a corresponding scheduling candidate task in the candidate task set;

and canceling the historical resource scheduling task set of the complementary resource scheduling task to be used as the resource scheduling task set.

6. A resource scheduling apparatus comprising:

the acquisition module is configured to acquire resource load information and historical resource load information corresponding to sub-areas in a warehouse area respectively, wherein the resource load information is load probability information of the number of tasks to be worked in the sub-areas in the warehouse area relative to the number of available resources, and the historical resource load information is resource load information corresponding to a previous resource scheduling period of a current resource scheduling period;

The calculation module is configured to read preset configuration parameters, extract a first loss coefficient and a second loss coefficient from the configuration parameters, calculate regional resource load values corresponding to the subregions in the storage region according to the resource load information corresponding to the subregions in the storage region respectively, and calculate regional load change values corresponding to the subregions in the storage region respectively according to the resource load change information corresponding to the subregions in the storage region respectively and the second loss coefficient; determining regional load loss values corresponding to the subareas in the storage area based on regional resource load values and regional load change values corresponding to the subareas in the storage area respectively, and calculating global load loss values of the storage area according to the regional load loss values, wherein the global load loss values are loss information of production resources corresponding to target resource types in the storage area; acquiring global available resource information and global job waiting task information corresponding to the warehouse area, and calculating global resource load information corresponding to the warehouse area according to the global available resource information and the global job waiting task information, wherein the global resource load information is load proportion information of the total job task number of the warehouse area compared with the total available resource number; calculating the global resource load information and the global load loss value by utilizing a genetic algorithm, and determining the resource quantity to be scheduled corresponding to the subareas in the warehouse area according to a calculation result, wherein the resource quantity to be scheduled is the required resource quantity or the redundant resource quantity corresponding to the subareas, and determining the resource quantity to be allocated to each subarea under the condition that the reference resource information is set for the global available resource quantity of the warehouse area according to the reference resource information corresponding to the subareas, the required resource quantity is the resource quantity to be increased by the subareas, and the redundant resource quantity is the resource quantity to be reduced by the subareas;

The creating module is configured to determine resource scheduling types of the to-be-scheduled resource amounts corresponding to the subareas in the storage area respectively, select the subareas with the resource scheduling types as resource supply types to form a resource supply set, and select the subareas with the resource scheduling types as resource demand types to form a resource demand set; establishing a region matching relation between supply region elements in the resource supply set and demand region elements in the resource demand set, constructing a task triplet according to the region matching relation, creating a resource scheduling task corresponding to the storage region based on available resource types, supply region information and demand region information contained in the task triplet, writing the resource scheduling task into the resource scheduling task set, and sequentially executing the resource scheduling tasks contained in the resource scheduling task set.

7. A resource scheduling system, comprising:

a scheduling decision module and a task generation module;

the scheduling decision module and the task generation module are configured to store resource scheduling executable instructions, and the scheduling decision module and the task generation module implement the steps of the method according to any one of claims 1 to 5 when executing the resource scheduling executable instructions.

8. The system of claim 7, the resource scheduling system further comprising a parameter configuration module, a timing trigger module, a task statistics module, a resource monitoring module, a data caching module, and a task caching module;

9. A computing device, comprising:

a memory and a processor;

the memory is configured to store computer executable instructions, the processor being configured to execute the computer executable instructions, which when executed by the processor, implement the steps of the method of any one of claims 1 to 5.

10. A computer readable storage medium storing computer executable instructions which when executed by a processor implement the steps of the method of any one of claims 1 to 5.