A resource selection method and device for advanced planning scheduling

Abstract

This application relates to the field of intelligent manufacturing technology, specifically to a resource selection method and apparatus for advanced planning and scheduling. The resource selection method includes: acquiring the current task to be scheduled and a set of candidate resources; calculating the flow cost of each candidate resource from the previous process to the current resource as the preceding flow cost; calculating the predicted flow cost of each candidate resource to the subsequent process's reachable resource as the following flow cost; ranking the candidate resources based on the preceding and following flow costs; and selecting the target resource to execute the current task to be scheduled based on the ranking results. This application overcomes the shortcomings of existing technologies that rely solely on preceding information, leading to blind selection of the first process and local optima in intermediate processes, by simultaneously considering both preceding and following predicted costs. It achieves a shift from minimizing single-point costs to optimizing global flow efficiency, significantly improving the resource utilization and production efficiency of the scheduling scheme.

Description

Technical Field

[0001] This application relates to the field of intelligent manufacturing technology, specifically to a resource selection method and apparatus for advanced planning and scheduling. Background Technology

[0002] Advanced Planning and Scheduling (APS) systems are core tools for production management in modern manufacturing. Their primary task is to allocate appropriate resources and determine processing times for production tasks while meeting material, capacity, and process constraints. In the resource selection phase of an APS system, the time consumed by tasks moving between different equipment or work centers must be considered. The time spent moving resources between these equipment and work centers is a key factor affecting production cycle time and logistics costs. Current technologies typically maintain a resource flow matrix to obtain the time spent on handling or changing lines between equipment, using this as one of the bases for resource optimization, aiming to reduce non-value-adding time between processes.

[0003] In specific resource matching strategies, existing APS scheduling methods mainly rely on the "preceding flow" metric, which calculates the flow time from the equipment side of the previous completed process to the current candidate resource. This strategy can effectively reduce the entry waiting or handling costs of the current process when the process is in the middle and the preceding resources are fixed. The system usually uses this preceding flow cost as the main weight for sorting, prioritizing candidate resources that are more closely connected to the preceding equipment to achieve rapid connection between local processes, and uses this metric to score and sort candidate resource items in the resource idle matching stage.

[0004] However, the resource selection method described above, which relies solely on prior flow information, has significant limitations. Firstly, when the process is the first machining step on a part, since there is no equipment attributable to a previously completed process, the prior flow metric is ineffective or always zero for all candidate resources. This prevents the system from effectively distinguishing between equipment, forcing random or blind selection, potentially causing subsequent processes to incur unnecessary long flow costs. Secondly, when the process is in the middle, simply "looking forward" only ensures a lower cost of accessing resources already scheduled in the preceding sequence. It cannot guarantee rapid connection to subsequent processes that are not yet scheduled or have a large span, given a matrix, easily leading to local optima rather than global optima, thus affecting overall production efficiency. Summary of the Invention

[0005] In related technologies, the resource selection method of the APS system relies solely on the preceding flow measurement, which leads to problems such as the inability to effectively distinguish candidate resources in the first process and the neglect of subsequent connection costs in intermediate processes, thus affecting the overall production efficiency.

[0006] In a first aspect, embodiments of this application provide a resource selection method for advanced planning and scheduling, the resource selection method comprising: Get the currently scheduled tasks and their current candidate resource set; Calculate the transfer cost of each candidate resource in the current candidate resource set from the previous process to the current candidate resource as the previous transfer cost; Calculate the predicted flow consumption from each current candidate resource in the current candidate resource set to the subsequent reachable resources in the subsequent process as the subsequent flow value; Sort the current candidate resources in the current candidate resource set based on the value of the previous and subsequent circulation generations; Based on the sorting results, target resources are selected from the current candidate resource set to execute the currently scheduled tasks.

[0007] In conjunction with the first aspect, in one implementation, calculating the predicted flow consumption from each current candidate resource in the current candidate resource set to the subsequent reachable resource in the subsequent process as the subsequent flow cost includes: Identify the set of adjacent tasks following the currently scheduled task; Calculate the minimum turnaround time between each current candidate resource in the current candidate resource set and each subsequent reachable resource of each subsequent adjacent task; The minimum turnaround time corresponding to all subsequent adjacent tasks is aggregated to obtain the turnaround generation value of the current candidate resource set.

[0008] In conjunction with the first aspect, in one implementation, calculating the minimum turnaround time between each current candidate resource in the current candidate resource set and each subsequent reachable resource of a subsequent adjacent task includes: The scheduling status of subsequent adjacent tasks is determined; among them, If the subsequent adjacent task has been scheduled, the actual turnaround time between the selected subsequent resource and the current candidate resource is taken as the minimum turnaround time. If the subsequent adjacent task is not scheduled, calculate the predicted turnaround time from the current candidate resource to all available subsequent resources of the subsequent adjacent task, and select the minimum value among all predicted turnaround times as the minimum turnaround time corresponding to the subsequent adjacent task.

[0009] In conjunction with the first aspect, in one implementation, the aggregation of the minimum turnaround times corresponding to all subsequent adjacent tasks to obtain the subsequent turnaround generation value of the current candidate resource set includes: The maximum value among all minimum circulation times is used as the subsequent circulation value.

[0010] In conjunction with the first aspect, in one implementation, the step of sorting the current candidate resources in the current candidate resource set based on the preceding and following transfer generation values ​​includes: The current candidate resources in the current candidate resource set are sorted based on the previous transfer generation value; among them... If the difference in the prior circulation value among the current candidate resources is less than or equal to the first preset threshold, then the current candidate resources in the current candidate resource set are sorted according to the subsequent circulation value of the current candidate resources.

[0011] In conjunction with the first aspect, in one implementation, sorting the current candidate resources in the current candidate resource set according to the subsequent transfer generation value of the current candidate resources includes: The current candidate resources in the current candidate resource set are sorted based on the value of subsequent transfer generations; among them... If the difference in subsequent transfer value between current candidate resources is greater than the second preset threshold, then the current candidate resource with the smaller subsequent transfer value will be ranked first. If the difference in the subsequent transfer value between the current candidate resources is less than or equal to the second preset threshold, then the next priority strategy is used to compare the current candidate resources.

[0012] In conjunction with the first aspect, in one implementation, after calculating the predicted flow consumption of each current candidate resource in the current candidate resource set to the subsequent reachable resource in the subsequent process as the subsequent flow generation value, the method further includes: storing the preceding flow generation value and the subsequent flow generation value independently in the resource entry object.

[0013] In conjunction with the first aspect, in one implementation, before ranking the current candidate resources in the current candidate resource set based on the preceding and following transfer generation values, the method further includes: Based on the start time constraint parameter of the candidate resources, the current candidate resources that are not available or cannot be executed are eliminated from the current candidate resource set.

[0014] In conjunction with the first aspect, in one implementation, after calculating the transfer cost of each candidate resource in the current candidate resource set from the previous process to the current candidate resource as the previous transfer cost, the method further includes: The earliest start time for all current candidate resources is adjusted based on the value of the previous transfer.

[0015] Secondly, embodiments of this application provide a resource selection apparatus for advanced planning and scheduling, comprising: The task acquisition module is used to acquire the currently scheduled tasks and their current candidate resource set; The pre-processing module is used to calculate the flow consumption of each candidate resource in the current candidate resource set from the previous process to the current candidate resource as the pre-processing value. The post-prediction module is used to calculate the predicted flow consumption of each current candidate resource in the current candidate resource set to the subsequent reachable resources in the subsequent process as the post-flow value. The sorting module is used to sort the current candidate resources in the current candidate resource set based on the previous and subsequent transfer generation values; The selection module is used to select target resources from the current candidate resource set according to the sorting results for the execution of the current scheduled task.

[0016] The beneficial effects of the technical solutions provided in this application include: This application overcomes the shortcomings of existing technologies that rely solely on prior information, such as blind selection of the first process and local optima in intermediate processes, by simultaneously considering both upfront and subsequent forecasting costs. It achieves a shift from minimizing single-point costs to optimizing overall workflow efficiency, significantly improving the overall coherence and production efficiency of the scheduling scheme. Attached Figure Description

[0017] Figure 1 This is a flowchart illustrating one embodiment of the resource selection method of this application; Figure 2 This is a schematic diagram of the hardware structure of the resource selection device involved in the embodiments of this application. Detailed Implementation

[0018] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present application.

[0019] In related technologies, the resource selection method of the APS system relies solely on the preceding flow measurement, which leads to problems such as the inability to effectively distinguish candidate resources in the first process and the neglect of subsequent connection costs in intermediate processes, thus affecting the overall production efficiency.

[0020] In a first aspect, embodiments of this application provide a resource selection method for advanced planning and scheduling, the resource selection method comprising: Step S1: Obtain the current tasks to be scheduled and their current set of candidate resources.

[0021] Step S1 above includes: Step S1a: Define the current task to be scheduled, the current set of candidate resources, and the set of subsequent adjacent tasks, and unify the input semantics.

[0022] Specifically, let the task currently entering resource selection be... ,remember The finite set of candidate resource entries is It also carries a set of machine resource identifiers, mold resource identifiers, and a set of rated working hours. .

[0023] Understandably, a three-element model using task-resource-post set can be used; optional additions include process family and production line tags.

[0024] Step S1b: Determine whether to enable the post-prediction strategy through a triple gating check.

[0025] It should be noted that the gating check is used to determine whether the resource flow capability is enabled, whether the current process is the last process (i.e. there is no subsequent process), and whether the current candidate resource is not associated with a specific device. If any of the three conditions are met, degradation is performed and no further post-calculation is performed, thus maintaining zero intrusion into the original resource selection process.

[0026] In some specific implementations, the necessary conditions for entering the post-prediction step are defined as follows:

[0027] in, This indicates that resource flow capability is enabled, which means that the flow matrix or flow weight between resources is allowed. If this switch is turned off, no subsequent flow prediction will be performed.

[0028] This indicates that the current process has a subsequent process. This represents the number of tasks directly following the current process. If the final process has no subsequent processes to connect with.

[0029] and This indicates that the current candidate resource entry can be resolved to an actual device resource. If the current candidate resource does not correspond to a specific device, it is impossible to query the "transfer time from the current device to the downstream device".

[0030] Understandably, this method will not force calculations or affect the original APS scheduling logic when the conditions for post-prediction are not met, such as when the function is not enabled, the current process has no subsequent process, or the current resource cannot be resolved. This avoids invalid calculations, null reference exceptions, and incorrect ordering, allowing this post-prediction strategy to be stably integrated into the existing system as an optional strategy. By setting a global capability switch, a joint gating condition for the existence of subsequent tasks, and the resolvability of the current resource, post-processing prediction only takes effect when there is a computational basis; when the final process, the function is disabled, or resource information is missing, the prediction score naturally degrades to zero, thus maintaining zero intrusion into the original resource selection process.

[0031] Step S1c: In each round, the pre-processing and post-processing of each current candidate resource are reset to eliminate the influence of the previous round of resource selection or other residuals on the current round.

[0032] Preferably, the reset process defaults to a double-field reset. Optionally, a round stamp is added to prevent concurrent remnants.

[0033] Step S2: Calculate the transfer cost of each candidate resource in the current candidate resource set from the previous process to the current candidate resource as the previous transfer cost.

[0034] Understandably, the value of the preceding process flow represents the time required for the resources occupied by the completed or scheduled preceding process to be transferred to the current candidate resource, including handling, line changing, waiting, or transshipment.

[0035] In some preferred embodiments, the earliest start time of all current candidate resources is adjusted based on the previous turnover value.

[0036] Specifically, during forward scheduling:

[0037] in, This is the earliest possible start time for the current candidate resources; It refers to the time when the preceding processes can be completed seamlessly. It refers to the pre-processing time.

[0038] It's understandable that the idle status of a current candidate resource (such as equipment) does not equate to the immediate commencement of the current process. For example, if the previous process was completed at 10:00, but it takes 30 minutes to move the equipment from the previous process to the current candidate equipment, even if the current candidate equipment is idle at 10:00, the process cannot start until at least 10:30. Therefore, the lead time needs to be added to the current process's startability boundary for adjustment, ensuring that subsequent resource selection and prioritization are based on actual startability conditions.

[0039] Step S3: Calculate the predicted flow consumption of each current candidate resource in the current candidate resource set to the subsequent reachable resources of the subsequent process as the subsequent flow value.

[0040] Understandably, this step, by refining the calculation steps for the cost of subsequent processes, establishes the processing logic for aggregating the minimum processing time of all subsequent adjacent tasks, ensuring a comprehensive evaluation of all potential downstream connection paths, and providing a quantitative and comprehensive data foundation for subsequent resource sorting.

[0041] The above step S3 specifically includes: Step S3a: Identify the set of adjacent tasks following the currently scheduled task.

[0042] Step S3b: Calculate the minimum transit time between each current candidate resource in the current candidate resource set and each subsequent reachable resource of the subsequent adjacent task.

[0043] Specifically, step S3b includes: determining the scheduling status of the subsequent adjacent tasks; wherein, Case 1: If the subsequent adjacent task has been scheduled, the actual turnaround time between the selected subsequent resource and the current candidate resource is taken as the minimum turnaround time. Scenario 2: If the subsequent adjacent task is not scheduled, calculate the predicted turnaround time from the current candidate resource to all available subsequent resources of the subsequent adjacent task, and select the minimum value among all predicted turnaround times as the minimum turnaround time corresponding to the subsequent adjacent task.

[0044] It should be noted that this step dynamically adjusts the calculation strategy based on the scheduling status of subsequent tasks. For fixed tasks, the actual value is used to ensure accuracy, while for unfixed tasks, the optimal predicted value (minimum duration) is used to retain flexibility. This ensures data reliability while taking into account the dynamic adaptability of the scheduling system.

[0045] Step S3c: Aggregate the minimum turnaround time corresponding to all subsequent adjacent tasks to obtain the subsequent turnaround generation value of the current candidate resource set.

[0046] In some optional implementations, the minimum turnaround times corresponding to all subsequent adjacent tasks are aggregated. Preferably, the maximum value among all minimum turnaround times is used as the subsequent turnaround time value.

[0047] Understandably, the maximum value among all minimum turnaround times represents "the cost of the most difficult downstream process to connect when the current candidate resource faces multiple downstream processes." This aggregation method ensures that resource selection results don't overlook the severe turnaround risks of other downstream processes simply because one downstream process has the lowest turnaround time (i.e., it's optimal). If only the minimum value is taken, the sorting process might only see how convenient the current resource is for one downstream process, ignoring how inconvenient it is for another. If the average value is taken, a particularly poor downstream connection cost might be "diluted" by other smaller values, making the bottleneck less obvious. Therefore, taking the maximum value is to expose the "most unfavorable downstream connection cost," reduce local optima, and improve the overall scheduling stability.

[0048] Step S3d: Store the pre-transfer value and post-transfer value independently in the resource entry object.

[0049] Understandably, storing the pre-transfer value and post-transfer value independently achieves data isolation for scoring data of different dimensions, prevents field contamination or cross-referencing during the calculation process, facilitates the subsequent strategy module to independently read the scores of specific dimensions, and also supports independent debugging of scores of different dimensions.

[0050] Step S3e: Based on the start time constraint parameters of the candidate resources, remove the current candidate resources that are not available or cannot be executed from the current candidate resource set.

[0051] It should be noted that step S3e, after obtaining the preceding and following flow generation values, continues to determine whether candidate resources can actually be used in the scheduling. By introducing a feasibility elimination step based on constraint parameters before resource sorting, the size of the candidate set is effectively reduced, the computational load is decreased, and it is ensured that all resources participating in the sorting are actually executable, avoiding scheduling failures or secondary adjustments due to resource unavailability.

[0052] Optionally, the above-mentioned start-up time constraint parameters include: material constraints, outsourcing constraints, external resource or calendar constraints, and equipment and mold coupling constraints. These constraint parameters are denoted as... Wait, then unify and merge them into a stricter earliest start date. :

[0053] in, The earliest possible start time for the current candidate resource obtained from the aforementioned steps.

[0054] Specifically, the material constraint mentioned above represents: the actual arrival time of materials. That is, even if the equipment is idle at 8:00 AM, but the materials only arrive at 9:00 AM, the current process still cannot start at 8:00 AM. The outsourcing constraint mentioned above represents: if a pre-processing or related process requires outsourcing feedback, it must wait until the outsourcing cycle is met before it can be scheduled. The outbound resource or calendar constraint mentioned above represents: certain resources are only available within specific shifts, dates, or time windows, and the candidate time slot must fall within the available window. The equipment and mold coupling constraint represents: if the equipment is idle but the mold is not, or the mold is idle but the equipment is not, neither of these situations can form an executable candidate.

[0055] Furthermore, by adding step S3e, resource selection can be divided into two layers: the first layer is a scoring layer based on flow and post-prediction, used to determine which resource is more conducive to process connection. The second layer is an executable layer that determines whether candidate resources can be scheduled under realistic constraints.

[0056] It should be noted that the candidate resources that meet any of the following criteria can be eliminated through the execution layer: the current equipment does not have enough continuous idle time, the current equipment is idle but the mold is occupied by other tasks during this time period, the material has not arrived, the outsourcing cycle has not been completed, or the resource calendar does not allow the start of work during this time period.

[0057] Step S4: Sort the current candidate resources in the current candidate resource set based on the previous generation value and the subsequent generation value.

[0058] In some preferred embodiments, step S4 above employs a multi-strategy chain sorting and threshold discrimination method, which specifically includes: Step S4a: Sort all current candidate resources in the current candidate resource set based on the previous generation value.

[0059] Understandably, this step determines which candidate resource is more likely to take over the completed or scheduled preceding processes.

[0060] In one optional implementation, a first preset threshold is determined based on the current priority strategy: Case A: If the difference in the prior circulation value of two current candidate resources is greater than the first preset threshold, the one with the smaller prior circulation value will be ranked higher.

[0061] Case B: If the difference in the preceding transfer value of two current candidate resources is less than or equal to the first preset threshold configured in the preceding strategy, then it is considered that there is no significant difference between the two in the preceding transfer dimension. Proceed to the next priority strategy (i.e., step S4b).

[0062] Step S4b: Sort all current candidate resources in the current candidate resource set based on the value of the subsequent generation.

[0063] In one optional implementation, a second preset threshold is determined based on the current post-priority strategy: Case A: If the difference in subsequent transfer value between current candidate resources is greater than the second preset threshold, then the current candidate resource with the smaller subsequent transfer value will be ranked first. Case B: If the difference in the subsequent transfer value between the current candidate resources is less than or equal to the second preset threshold, then the next priority strategy (i.e. step S4c) is used to judge the current candidate resources.

[0064] Specifically, the next priority strategy in step B above includes priority strategies such as earliest start time, minimum load, and shortest processing time. Users can choose the appropriate priority strategy according to the actual working conditions.

[0065] It is worth noting that the above preferred implementation further refines the handover logic of the strategy chain. By setting a clear threshold boundary, it determines whether to maintain the previous priority or hand over to the next strategy, effectively eliminating the sorting instability caused by small data fluctuations.

[0066] Furthermore, the specific sorting strategy of this application is not limited to the priority strategy setting method in the preferred embodiment of step S4 above. Operators can adjust the sorting method as needed.

[0067] In some optional embodiments, step S4 above further includes: Step S4c: Cloning and replication consistency maintenance.

[0068] Specifically, during the scheduling search process, if a deep copy or branch copy of a resource entry is involved, the system synchronously copies the previous generation value and the subsequent prediction field value to the new object to ensure data consistency during parallel computing or backtracking search.

[0069] Step S4d: Encapsulate the aggregation method or flow calculation function from step S3 into an overwriteable method. This allows users to replace specific source logic or filtering rules through subclassing or plugin mechanisms to adapt to the specific business scenarios of different factories.

[0070] Step S5: Select target resources from the current candidate resource set according to the sorting results to execute the current scheduled task.

[0071] In summary, this invention effectively solves the technical problems of existing technologies that rely solely on pre-processing metrics, leading to the inability to distinguish candidate resources for the first process and the tendency for intermediate processes to fall into local optima. Specifically, this invention employs a "single post-processing minimum reachability, multiple post-processing maximum aggregation" strategy to calculate the post-processing prediction cost, which exposes potential bottlenecks and conservatively estimates the worst-case cost, thereby improving scheduling stability in multi-branch process scenarios. Simultaneously, by combining a chain-like sorting strategy based on threshold tolerance, it eliminates interference from minor data fluctuations while achieving smooth transfer and natural degradation of multi-level strategies, ensuring zero-intrusion compatibility in the final process or scenarios without post-processing. Furthermore, by performing feasibility elimination before sorting and time correction based on pre-processing, it further guarantees the physical executability and global flow efficiency of the scheduling plan, ultimately achieving the combined beneficial effects of shortened production cycles and reduced logistics costs.

[0072] Secondly, this application provides a resource selection device for advanced planning and scheduling, comprising: a task acquisition module, a pre-calculation module, a post-prediction module, a sorting module, and a selection module; wherein, The system comprises the following modules: a task acquisition module, used to acquire the current task to be scheduled and its current candidate resource set; a pre-calculation module, used to calculate the flow consumption of each candidate resource in the current candidate resource set from the completion of the previous process to the current candidate resource as the pre-flow value; a post-prediction module, used to calculate the predicted flow consumption of each current candidate resource in the current candidate resource set to the subsequent reachable resources of the subsequent process as the post-flow value; a sorting module, used to sort the current candidate resources in the current candidate resource set based on the pre-flow value and the post-flow value; and a selection module, used to select target resources from the current candidate resource set according to the sorting results for executing the current task to be scheduled.

[0073] The functions of each module in the resource selection device correspond to the steps in the resource selection method embodiment, and their functions and implementation processes will not be described in detail here.

[0074] Thirdly, embodiments of this application provide a resource selection device, which can be a personal computer (PC), laptop computer, server, or other device with data processing capabilities.

[0075] Reference Figure 2 , Figure 2 This is a schematic diagram of the hardware structure of the resource selection device involved in the embodiments of this application. In the embodiments of this application, the resource selection device may include a processor, a memory, a communication interface, and a communication bus.

[0076] The communication bus can be of any type and is used to interconnect the processor, memory, and communication interface.

[0077] Communication interfaces include input / output (I / O) interfaces, physical interfaces, and logical interfaces used for interconnecting devices within the resource selection device, as well as interfaces used for interconnecting the resource selection device with other devices (such as other computing devices or user equipment). Physical interfaces can be Ethernet interfaces, fiber optic interfaces, ATM interfaces, etc.; user equipment can be displays, keyboards, etc.

[0078] Memory can be various types of storage media, such as random access memory (RAM), read-only memory (ROM), non-volatile RAM (NVRAM), flash memory, optical storage, hard disk, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), etc.

[0079] The processor can be a general-purpose processor, which can call a resource selection program stored in memory and execute the resource selection method provided in the embodiments of this application. For example, the general-purpose processor can be a central processing unit (CPU). The method executed when the resource selection program is called can be referred to in the various embodiments of the resource selection method of this application, and will not be repeated here.

[0080] Those skilled in the art will understand that Figure 2 The hardware structure shown does not constitute a limitation of this application and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0081] Fourthly, embodiments of this application also provide a computer-readable storage medium.

[0082] The present application provides a resource selection program stored on a computer-readable storage medium, wherein when the resource selection program is executed by a processor, it implements the steps of the resource selection method described above.

[0083] The method implemented when the resource selection procedure is executed can be referred to in various embodiments of the resource selection method of this application, and will not be repeated here.

[0084] It should be noted that the sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0085] The terms "comprising" and "having," and any variations thereof, in the specification, claims, and accompanying drawings of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus. The terms "first," "second," and "third," etc., are used to distinguish different objects, etc., and do not indicate a sequence, nor do they limit "first," "second," and "third" to different types.

[0086] In the description of the embodiments of this application, terms such as "exemplary," "for example," or "for instance" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplary," "for example," or "for instance" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary," "for example," or "for instance" is intended to present the relevant concepts in a concrete manner.

[0087] In the description of the embodiments of this application, unless otherwise stated, " / " means "or". For example, A / B can mean A or B. The "and / or" in the text is merely a description of the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. In addition, in the description of the embodiments of this application, "multiple" means two or more.

[0088] In some processes described in the embodiments of this application, multiple operations or steps are included in a specific order. However, it should be understood that these operations or steps may not be executed in the order they appear in the embodiments of this application, or they may be executed in parallel. The sequence number of the operation is only used to distinguish different operations, and the sequence number itself does not represent any execution order. In addition, these processes may include more or fewer operations, and these operations or steps may be executed sequentially or in parallel, and these operations or steps may be combined.

[0089] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes several instructions to cause a terminal device to execute the methods described in the various embodiments of this application.

[0090] The above are merely preferred embodiments of this application and do not limit the patent scope of this application. Any equivalent structural or procedural transformations made using the content of this application's specification and drawings, or direct or indirect applications in other related technical fields, are similarly included within the patent protection scope of this application.

Claims

1. A resource selection method for advanced planning and scheduling, characterized in that, The resource selection method includes: Get the currently scheduled tasks and their current candidate resource set; Calculate the transfer cost of each candidate resource in the current candidate resource set from the previous process to the current candidate resource as the previous transfer cost; Calculate the predicted flow consumption from each current candidate resource in the current candidate resource set to the subsequent reachable resources in the subsequent process as the subsequent flow value; Sort the current candidate resources in the current candidate resource set based on the value of the previous and subsequent circulation generations; Based on the sorting results, target resources are selected from the current candidate resource set to execute the currently scheduled tasks.

2. The resource selection method as described in claim 1, characterized in that, The calculation of the predicted flow consumption from each current candidate resource in the current candidate resource set to the subsequent reachable resource in the subsequent process as the subsequent flow cost includes: Identify the set of adjacent tasks following the currently scheduled task; Calculate the minimum turnaround time between each current candidate resource in the current candidate resource set and each subsequent reachable resource of each subsequent adjacent task; The minimum turnaround time corresponding to all subsequent adjacent tasks is aggregated to obtain the turnaround generation value of the current candidate resource set.

3. The resource selection method as described in claim 2, characterized in that, The calculation of the minimum turnaround time between each current candidate resource in the current candidate resource set and each subsequent reachable resource of its adjacent task includes: The scheduling status of subsequent adjacent tasks is determined; among them, If the subsequent adjacent task has been scheduled, the actual turnaround time between the selected subsequent resource and the current candidate resource is taken as the minimum turnaround time. If the subsequent adjacent task is not scheduled, calculate the predicted turnaround time from the current candidate resource to all available subsequent resources of the subsequent adjacent task, and select the minimum value among all predicted turnaround times as the minimum turnaround time corresponding to the subsequent adjacent task.

4. The resource selection method as described in claim 2, characterized in that, The aggregation of the minimum turnaround times corresponding to all subsequent adjacent tasks to obtain the subsequent turnaround generation value of the current candidate resource set includes: The maximum value among all minimum circulation times is taken as the subsequent circulation value.

5. The resource selection method as described in claim 1, characterized in that, The process of ranking the current candidate resources in the current candidate resource set based on the preceding and subsequent transfer generation values ​​includes: The current candidate resources in the current candidate resource set are sorted based on the previous transfer generation value; among them... If the difference in the prior circulation value among the current candidate resources is less than or equal to the first preset threshold, then the current candidate resources in the current candidate resource set are sorted according to the subsequent circulation value of the current candidate resources.

6. The resource selection method as described in claim 5, characterized in that, The process of sorting the current candidate resources in the current candidate resource set based on the subsequent transfer value of the current candidate resources includes: The current candidate resources in the current candidate resource set are sorted based on the value of subsequent transfer generations; among them... If the difference in subsequent transfer value between current candidate resources is greater than the second preset threshold, then the current candidate resource with the smaller subsequent transfer value will be ranked first. If the difference in the subsequent transfer value between the current candidate resources is less than or equal to the second preset threshold, then the next priority strategy is used to compare the current candidate resources.

7. The resource selection method as described in claim 1, characterized in that, After calculating the predicted flow consumption of each current candidate resource in the current candidate resource set to the subsequent reachable resource in the subsequent process as the subsequent flow generation value, the method further includes: storing the preceding flow generation value and the subsequent flow generation value independently in the resource entry object.

8. The resource selection method as described in claim 1, characterized in that, Before ranking the current candidate resources in the current candidate resource set based on the preceding and following transfer generation values, the process also includes: Based on the start time constraint parameter of the candidate resources, the current candidate resources that are not available or cannot be executed are eliminated from the current candidate resource set.

9. The resource selection method as described in claim 1, characterized in that, After calculating the transfer cost of each candidate resource in the current candidate resource set from the previous process to the current candidate resource as the previous transfer cost, the method further includes: The earliest start time for all current candidate resources is adjusted based on the value of the previous transfer.

10. A resource selection device for advanced planning and scheduling, characterized in that, include: The task acquisition module is used to acquire the currently scheduled tasks and their current candidate resource set; The pre-processing module is used to calculate the flow consumption of each candidate resource in the current candidate resource set from the previous process to the current candidate resource as the pre-processing value. The post-prediction module is used to calculate the predicted flow consumption of each current candidate resource in the current candidate resource set to the subsequent reachable resources in the subsequent process as the post-flow value. The sorting module is used to sort the current candidate resources in the current candidate resource set based on the previous and subsequent transfer generation values; The selection module is used to select target resources from the current candidate resource set according to the sorting results for the execution of the current scheduled task.

Images