Workshop scheduling method, device, equipment and storage medium based on industrial Internet

Abstract

The present invention discloses a workshop scheduling method, apparatus, equipment, and storage medium based on the Industrial Internet. The workshop scheduling method includes: inserting the current scheduled unit at different positions of the original processing sequence of the target operation unit to form candidate processing sequences, wherein the original processing sequence is used to represent the original processing order of each scheduled unit in the target operation unit; calculating the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit; and determining the candidate processing sequence whose corresponding objective function meets preset conditions as the current processing sequence of the target operation unit. The workshop scheduling method has the technical effects of high scheduling efficiency, good scheduling performance, reduced production costs, and load balancing.

Description

Technical Field

[0001] The present invention relates to the field of intelligent scheduling technology, and in particular to a workshop scheduling method, device, equipment and storage medium based on the Industrial Internet. Background Art

[0002] In modern manufacturing, production processes are becoming increasingly complex, and the volume and variety of tasks are constantly increasing. This makes shop floor scheduling more complex and challenging. Since total production costs typically represent a significant portion of any enterprise, every company strives to find an efficient shop floor design and the optimal processing sequence for each machine or line, tailored to each order. Properly allocating orders can minimize core business metrics such as overdue periods.

[0003] Currently, there are many kinds of workshop scheduling algorithms that have been applied in practice. For example, optimization algorithms such as genetic algorithms can be applied to workshop scheduling problems.

[0004] However, although genetic algorithms have excellent search capabilities, they have high time complexity when optimizing large-scale problems. Summary of the Invention

[0005] The present invention provides a workshop scheduling method, device, equipment and storage medium based on the Industrial Internet to solve the technical problem of high time complexity of scheduling algorithms in related technologies.

[0006] According to one aspect of the present invention, a workshop scheduling method based on the Industrial Internet is provided, comprising:

[0007] Inserting the currently scheduled unit at different positions of the original processing sequence of the target operation unit to form candidate processing sequences; wherein the original processing sequence is used to represent the original processing order of each scheduled unit in the target operation unit;

[0008] Calculating an objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit;

[0009] The candidate processing sequence whose corresponding objective function meets the preset conditions is determined as the current processing sequence of the target operation unit.

[0010] According to another aspect of the present invention, a workshop scheduling device based on the Industrial Internet is provided, comprising:

[0011] A first determining module is configured to insert the currently scheduled unit into different positions of the original processing sequence of the target operation unit to form candidate processing sequences; wherein the original processing sequence is used to represent the original processing order of each scheduled unit in the target operation unit;

[0012] a second determining module, configured to calculate an objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit;

[0013] The third determining module is configured to determine a candidate processing sequence whose corresponding objective function satisfies a preset condition as the current processing sequence of the target operation unit.

[0014] According to another aspect of the present invention, there is provided an electronic device, comprising:

[0015] at least one processor; and

[0016] a memory communicatively connected to the at least one processor; wherein,

[0017] The memory stores a computer program that can be executed by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the workshop scheduling method based on the industrial Internet described in any embodiment of the present invention.

[0018] According to another aspect of the present invention, a computer-readable storage medium is provided, which stores computer instructions, and the computer instructions are used to enable a processor to implement the workshop scheduling method based on the industrial Internet as described in any embodiment of the present invention when executed.

[0019] The technical solution of an embodiment of the present invention includes: inserting the current scheduled unit at different positions of the original processing sequence of the target operation unit to form candidate processing sequences, wherein the original processing sequence is used to characterize the original processing order of each scheduled unit in the target operation unit; calculating the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit; and determining the candidate processing sequence whose corresponding objective function meets the preset conditions as the current processing sequence of the target operation unit. It has the following technical effects: on the one hand, based on the overdue delivery time of each scheduled unit in the candidate processing sequence, and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit, the objective function of each candidate processing sequence is calculated, and the current processing sequence is determined according to the objective function. Compared with the genetic algorithm in the related art, the workshop scheduling method provided by this embodiment only needs to determine the objective function of each candidate processing sequence and compare the objective functions, which can avoid a lot of search and sorting work, reduce the calculation complexity, have high efficiency and accuracy, higher scheduling efficiency and better scheduling performance; on the other hand, since the degree of inversion of the delivery time sequence is to a certain extent related to the inventory time of the scheduled unit, the scheduling method can be used to schedule the current processing sequence according to the objective function. Positive correlation, the current processing sequence determined in this embodiment takes into account both the overdue delivery time and the inventory time, and achieves a balance between the overdue delivery time and the inventory time. On the basis of meeting the delivery time as much as possible, the inventory is reduced, thereby reducing production costs; on the other hand, the workshop scheduling method provided in this embodiment takes into account the overdue delivery time of each scheduled unit in the objective function, the overdue delivery time of each scheduled unit is related to the delivery time of each scheduled unit and the completion time of each scheduled unit in the target operation unit, and the completion time of each scheduled unit in the target operation unit is related to the load of the target operation unit. Therefore, the workshop scheduling method can achieve load balancing of the target operation unit.

[0020] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present invention, nor is it intended to limit the scope of the present invention. Other features of the present invention will become readily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0022] Figure 1A flowchart of a workshop scheduling method based on the Industrial Internet provided in Example 1 of the present invention;

[0023] Figure 2 A schematic diagram of the processing time of the scheduled unit in each work unit;

[0024] Figure 3 A schematic diagram of a flow chart for calculating the objective function of each candidate processing sequence in the workshop scheduling method based on the Industrial Internet provided in the first embodiment of the present invention;

[0025] Figure 4 A schematic diagram of obtaining the current processing sequence based on the industrial Internet-based workshop scheduling method provided in the first embodiment of the present invention;

[0026] Figure 5 This is a flow chart of a workshop scheduling method based on the Industrial Internet provided in Example 2 of the present invention;

[0027] Figure 6 A schematic structural diagram of a workshop scheduling device based on the Industrial Internet according to an embodiment of the present invention;

[0028] Figure 7 A schematic structural diagram of another industrial Internet-based workshop scheduling device provided according to an embodiment of the present invention;

[0029] Figure 8 A structural diagram of an electronic device for implementing the workshop scheduling method based on the industrial Internet according to an embodiment of the present invention. DETAILED DESCRIPTION

[0030] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the embodiments described are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of the present invention.

[0031] It should be noted that the terms "target", "original", "current" and "final" in the description and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the term "comprises" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0032] Figure 1 This is a flow chart of a workshop scheduling method based on the industrial Internet provided in the first embodiment of the present invention. This embodiment is applicable to the case of scheduling the scheduled units in the factory workshop. The method can be executed by a workshop scheduling device, which can be implemented in the form of hardware and / or software. The workshop scheduling device can be configured in a computer device such as a server or an electronic device. Figure 1 As shown, the method includes the following steps:

[0033] Step 101: inserting the currently scheduled unit into different positions of the original processing sequence of the target operation unit to form candidate processing sequences.

[0034] The original processing sequence is used to represent the original processing order of each scheduled unit in the target operation unit.

[0035] The Industrial Internet-based workshop scheduling method in this embodiment can be used to solve the job shop scheduling problem (JSSP). For example, the workshop here can be an automotive parts processing workshop, a household appliance parts processing workshop, etc. Scheduling in this embodiment refers to determining the processing order of the scheduled units within the work unit.

[0036] The Industrial Internet (IIoT) is a new type of infrastructure, application model, and industrial ecosystem that deeply integrates next-generation information and communication technologies with the industrial economy. By comprehensively connecting people, machines, objects, and systems, it builds a new manufacturing and service system covering the entire industrial chain and value chain, providing a path for the digitalization, networking, and intelligent development of industry and even the entire industry. The workshop scheduling method in this embodiment can be implemented based on the IIoT.

[0037] In this embodiment, the dispatched unit refers to a component, product, or other object that can be processed in a work unit. The specific form of the dispatched unit varies in different scenarios. For example, in a final assembly workshop, the dispatched unit may be a final assembly part. This final assembly part, for example, may be a drive shaft. A drive shaft consists of a shaft, a sleeve, and a spherical housing. The final assembly workshop is responsible for assembling the shaft, sleeve, and spherical housing to form the drive shaft. In this embodiment, the dispatched unit may be a final assembly part such as a drive shaft.

[0038] The working unit in this embodiment refers to a processing machine, a line, or other main body that can realize processing or production, for example, a horizontal line, a vertical assembly line, a press assembly line, etc.

[0039] In this embodiment, the target operation unit refers to the operation unit whose processing sequence is currently being determined. The currently scheduled unit in this embodiment refers to the scheduled unit whose processing sequence in the target operation unit currently needs to be determined.

[0040] In one implementation, the original processing sequence in this embodiment can be randomly generated. For example, the scheduled units that can be processed in the target operating unit can be determined based on the mapping relationship between the target operating unit and the scheduled units. Subsequently, the processing order of the scheduled units that can be processed in the target operating unit is randomly determined.

[0041] In another implementation, in a scenario where there are multiple currently scheduled units, the workshop scheduling method provided in this embodiment can be executed cyclically, and the original processing sequence refers to the processing sequence formed after the last scheduling is completed.

[0042] When the original processing sequence has only one element, the different positions of the original processing sequence refer to the position before the element and the position after the element.

[0043] When the original processing sequence has multiple elements, different positions of the original processing sequence refer to positions before the first element of the original processing sequence, positions between adjacent elements, and positions after the last element of the original processing sequence.

[0044] Inserting the currently scheduled unit at different positions of the original processing sequence of the target operation unit refers to traversing different positions of the original processing sequence and inserting the currently scheduled unit at each position. After inserting the currently scheduled unit at each position, multiple candidate processing sequences can be formed.

[0045] For example, assuming the original processing sequence is (X, Y, Z), the different positions in the original processing sequence refer to the position before X, the position between X and Y, the position between Y and Z, and the position after Z. Assuming the currently scheduled unit is R, the candidate processing sequences are: (R, X, Y, Z), (X, R, Y, Z), (X, Y, R, Z), and (X, Y, Z, R).

[0046] Step 102: Calculate the objective function of each candidate processing sequence according to the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit.

[0047] In this embodiment, after obtaining multiple candidate processing sequences, an objective function is calculated for each candidate processing sequence. Specifically, the objective function is calculated based on the overdue delivery time of each scheduled unit and the degree of inversion of the delivery time sequence formed by the delivery times of each scheduled unit. The objective function in this embodiment is used to measure the performance of the candidate processing sequence.

[0048] In one embodiment, Figure 3 Schematic diagram of the process of calculating the objective function of each candidate processing sequence in the workshop scheduling method based on the industrial Internet provided in the first embodiment of the present invention. Figure 3 As shown, the implementation process of step 102 can be as follows.

[0049] Step 1021: Determine the overdue delivery time of each scheduled unit in the candidate processing sequence according to the delivery time of each scheduled unit in the candidate processing sequence and the completion time of each scheduled unit in the target operation unit.

[0050] Step 1022: sorting the delivery time of each scheduled unit according to the processing order of each scheduled unit in the candidate processing sequence to generate a delivery time sequence.

[0051] Step 1023: Determine the degree of reversal of the delivery time sequence of each scheduled unit according to the delivery time sequence.

[0052] Step 1024: Calculate the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit.

[0053] In this embodiment, in step 1021, the makespan of the scheduled unit in the target operation unit is determined based on the makespan of the scheduled units that precede and are adjacent to the scheduled unit in the candidate processing sequence and the processing time of the scheduled unit in the target operation unit. Specifically, the makespan of the scheduled unit in the target operation unit can be determined as the sum of the makespan of the scheduled units that precede and are adjacent to the scheduled unit in the candidate processing sequence and the processing time of the scheduled unit in the target operation unit.

[0054] The processing time of the scheduled unit in the target operation unit can be determined by the takt value of the scheduled unit in the operation unit.

[0055] Figure 2 It is a schematic diagram of the processing time of the scheduled unit in each operation unit. Figure 2 As shown, the first column shows the scheduled units, and the first row shows the working units. Each scheduled unit has a corresponding processing beat ct for each working unit. i ={ct i1 ,ct i2 ,…,ct im}, where ct ij Indicates the cycle time (CT) of the jth work unit processing the ith scheduled unit, that is, the beat value. In conventional workshop scheduling problems, not all scheduled units can be produced on m work units. If they cannot be produced, ct ij is +∞.

[0056] The following describes how to determine the completion time of the scheduled unit in the target work unit.

[0057] Suppose a candidate processing sequence is: A=>B=>C=>D. Since the scheduled unit A is the first scheduled unit to be processed, the completion time of the scheduled unit A is the processing time ta of A in the target operation unit; the completion time of the scheduled unit B is the completion time of A in the target operation unit plus the processing time tb of B in the target operation unit: ta+tb; the completion time of the scheduled unit C is the completion time of B in the target operation unit plus the processing time tc of C in the target operation unit: ta+tb+tc; the completion time of the scheduled unit D is the completion time of C in the target operation unit plus the processing time td of D in the target operation unit: ta+tb+tc+td.

[0058] The delivery time of the scheduled units is predetermined based on factors such as customer demand, market demand, and production demand.

[0059] In one possible implementation, the overdue delivery time of each scheduled unit in the candidate processing sequence is determined in the following manner: for each scheduled unit, if the completion time of the scheduled unit in the target operation unit is greater than the delivery time of the scheduled unit, the overdue delivery time of the scheduled unit is determined as: the difference between the completion time of the scheduled unit in the target operation unit and the delivery time of the scheduled unit; if the completion time of the scheduled unit in the target operation unit is less than or equal to the delivery time of the scheduled unit, the overdue delivery time of the scheduled unit is determined to be zero.

[0060] In another possible implementation, the overdue delivery time of each scheduled unit in the candidate processing sequence is determined in the following manner: for each scheduled unit, if the completion time of the scheduled unit in the target operation unit is greater than the delivery time of the scheduled unit, the overdue delivery time of the scheduled unit is determined as: the product of the difference between the completion time of the scheduled unit in the target operation unit and the delivery time of the scheduled unit and a preset first weight; if the completion time of the scheduled unit in the target operation unit is less than or equal to the delivery time of the scheduled unit, the overdue delivery time of the scheduled unit is determined to be zero.

[0061] As can be seen, the same scheduled unit may have different completion times in different candidate processing sequences due to the different processing orders within each candidate processing sequence. It is understandable that the delivery time of a scheduled unit is fixed. Therefore, a change in the processing order of a scheduled unit will result in a corresponding change in the completion time of the scheduled unit, and thus a change in the overdue delivery time of the scheduled unit.

[0062] In step 1022 of this embodiment, the delivery time sequence is generated by sorting the delivery times of the scheduled units according to the processing order of the scheduled units in the candidate processing sequence. This refers to the sequence formed by sorting the delivery times of the scheduled units according to the processing order of the scheduled units in the candidate processing sequence. For example, assuming that the processing order of the scheduled units in a candidate processing sequence is (B, A, C), where the delivery time of A is 10, the delivery time of B is 9, and the delivery time of C is 9, then the delivery time sequence is (9, 10, 9).

[0063] The degree of reversal of the delivery time series in step 1023 of this embodiment refers to the degree of reversal of the numerical values ​​of the delivery time series.

[0064] In one possible implementation, the degree of inversion can be measured by the number of inversions in the delivery time series. Of course, the degree of inversion can also be measured by processing or converting the number of inversions in the delivery time series. This embodiment is not limited to this.

[0065] Optionally, in step 1023, determining the degree of reversal of the delivery time sequence of each of the scheduled units according to the delivery time sequence may specifically be: counting the number of reversals of the delivery time of each of the scheduled units in the delivery time sequence.

[0066] The inversion number is the cardinality of an inversion set and is often used to measure the degree of ordering of a permutation or sequence. In the above example, in the delivery time sequence (9, 10, 9), (10, 9) constitutes an inversion, so the inversion number of this delivery time sequence is 1. For another example, suppose the delivery time sequence is (1, 2). No inversions can be found in this delivery time sequence, so the inversion number is 0. For another example, suppose the delivery time sequence is (2, 3, 1). (2, 1) and (3, 1) constitute an inversion, so the inversion number of this delivery time sequence is 2.

[0067] In step 1024, when calculating the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the inverse number of the delivery time sequence formed by the delivery time of each scheduled unit, it can be specifically: determining the total overdue delivery time of the scheduled units in the candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence; and determining the objective function of the candidate processing sequence based on the total overdue delivery time and the inverse number of the delivery time of the scheduled units.

[0068] Exemplarily, the total overdue delivery time of the scheduled units in the candidate processing sequence refers to the sum of the overdue delivery times of each scheduled unit, or the value after processing or converting the sum of the overdue delivery times of each scheduled unit, or the sum of the values ​​after processing or converting the overdue delivery times of each scheduled unit.

[0069] For example, the objective function of the candidate processing sequence is determined based on the total overdue delivery time and the inverse of the delivery time of the scheduled units. Alternatively, the sum of the total overdue delivery time and the inverse may be used as the objective function of the candidate processing sequence, or the sum of the total overdue delivery time and the inverse may be processed or converted to determine the objective function of the candidate processing sequence, or the sum of the total overdue delivery time and the inverse may be processed or converted to determine the objective function of the candidate processing sequence. This embodiment is not limited to this.

[0070] In one implementation, the objective function of the candidate processing sequence is objective=total overdue delivery time+number of reversed sequences.

[0071] Step 103: Determine the candidate processing sequence whose corresponding objective function meets the preset conditions as the current processing sequence of the target operation unit.

[0072] In this embodiment, after determining the objective function of each candidate processing sequence, a candidate processing sequence that meets the requirements is screened out according to the objective function and is used as the current processing sequence of the target operation unit.

[0073] For example, the preset condition here can be that the objective function is minimized. Alternatively, the preset condition can be that the objective function is second smallest. This can be set according to actual scheduling requirements.

[0074] The Industrial Internet-based workshop scheduling method provided in this embodiment can be applied in the following scenario: In an automotive parts factory, the machining and assembly workshops complete machining and assembly process groups, producing products such as shafts, sleeves, and ball shells. The final assembly workshop completes the assembly of shafts, sleeves, and ball shells to form drive shafts. The final assembly line in the final assembly workshop is responsible for assembling the drive shaft. Currently, the automotive parts factory has six final assembly lines that can produce six final assembly parts in parallel. The company adopts an inventory-driven production management model and requires that mold changes be minimized on the same final assembly line, ensuring continuous production while meeting delivery requirements. To meet the personalized needs of the automotive company, it is necessary to ensure continuous production across the six final assembly lines and balance the load. Therefore, the workshop scheduling method provided in this embodiment can be used to determine the current processing sequence of each assembly line—that is, the processing order of each final assembly part within each line—to achieve load balancing, improve scheduling efficiency, ensure on-time delivery, reduce inventory, and lower production costs.

[0075] Figure 4 A schematic diagram of obtaining the current processing sequence based on the workshop scheduling method based on the industrial Internet provided in the first embodiment of the present invention. Figure 4 As shown, suppose that the processing time of scheduled unit A is 1 second and the delivery time is the 10th second; the processing time of scheduled unit B is 9 seconds and the delivery time is the 10th second; the processing time of scheduled unit C is 5 seconds and the delivery time is the 9th second. Assume that the original processing sequence is (B, A) and the current scheduled unit is C. Assume that the objective function objective = total overdue delivery time + number of inversions.

[0076] Candidate processing sequence 1 is (C, B, A), the completion time sequence of each scheduled unit is (5, 14, 15), the total overdue delivery time is: 9, the delivery time sequence is (9, 10, 10), and the reverse sequence number is 0. The objective function of candidate processing sequence 1 is 9.

[0077] Candidate processing sequence 2 is (B, C, A), the completion time sequence of each scheduled unit is (9, 14, 15), the total overdue delivery time is 10, the delivery time sequence is (10, 9, 10), and the reverse sequence number is 1. The objective function of candidate processing sequence 2 is 11.

[0078] Candidate processing sequence 3 is (B, A, C), the completion time sequence of each scheduled unit is (9, 10, 15), the total overdue delivery time is 6, the delivery time sequence is (10, 10, 9), and the reverse sequence number is 2. The objective function of candidate processing sequence 3 is 8.

[0079] Therefore, candidate processing sequence 3 (B, A, C) is determined as the current processing sequence of the target work unit.

[0080] It is understood that the degree of reverse order of the delivery time series in this embodiment is positively correlated to the inventory time of the scheduled units. The greater the degree of reverse order of the delivery time series, the higher the priority of the scheduled units delivered later in production, and the longer the inventory time required.

[0081] In this embodiment, the objective function of each candidate processing sequence is calculated based on the overdue delivery time of each scheduled unit and the degree of inversion of the delivery time sequence formed by the delivery times of each scheduled unit. This allows the final determined current processing sequence to take into account both overdue delivery time and inventory time. In other words, production according to the current processing sequence determined by this workshop scheduling method can achieve a balance between overdue delivery time and inventory time, reducing inventory while minimizing delivery time, thereby lowering production costs. Under the precondition of minimizing the objective function, the current processing sequence determined by this workshop scheduling method can ensure both the minimum overdue delivery time and the minimum inventory, further reducing production costs. Furthermore, since the overdue delivery time of each scheduled unit is related to its delivery time and its completion time in the target work unit, and the completion time of each scheduled unit in the target work unit is related to the load of the target work unit, to avoid large overdue delivery times, it is necessary to consider the load of each work unit and balance the load to avoid long overdue deliveries. Therefore, this workshop scheduling method can achieve load balancing for the target work units.

[0082] The workshop scheduling method based on the industrial Internet provided in this embodiment has the following technical effects.

[0083] Improve production efficiency and quality: The workshop scheduling method provided by the present invention can optimize the workshop scheduling problem by utilizing the degree of reverse order of the delivery time series and the overdue delivery time, so as to maximize the purpose of reasonable configuration and reasonable arrangement of production line materials, thereby improving production efficiency and product quality.

[0084] Reduce production costs: The workshop scheduling method provided by the present invention can help enterprises arrange production tasks reasonably, improve production efficiency and quality, thereby reducing production costs and improving production benefits.

[0085] Improved enterprise competitiveness: The workshop scheduling method provided by this invention can help enterprises enhance their market competitiveness by improving production efficiency and quality. Furthermore, this workshop scheduling method is highly versatile and flexible, applicable to a variety of workshop scheduling problems, and enhances the overall production management level of enterprises.

[0086] In summary, the workshop scheduling method provided by the present invention can improve production efficiency and quality, reduce production costs, enhance enterprise competitiveness, and promote the intelligentization process of manufacturing. It has broad application prospects and has a positive role in promoting the intelligentization and sustainable development of manufacturing.

[0087] The workshop scheduling method based on the industrial Internet provided in this embodiment includes: inserting the current scheduled unit at different positions of the original processing sequence of the target work unit to form candidate processing sequences, wherein the original processing sequence is used to characterize the original processing order of each scheduled unit in the target work unit; calculating the objective function of each candidate processing sequence according to the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit; and determining the candidate processing sequence whose corresponding objective function meets the preset conditions as the current processing sequence of the target work unit. It has the following technical effects: on the one hand, based on the overdue delivery time of each scheduled unit in the candidate processing sequence, and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit, the objective function of each candidate processing sequence is calculated, and the current processing sequence is determined according to the objective function. Compared with the genetic algorithm in the related art, the workshop scheduling method provided by this embodiment only needs to determine the objective function of each candidate processing sequence and compare the objective functions, which can avoid a lot of search and sorting work, reduce the calculation complexity, have high efficiency and accuracy, and have higher scheduling efficiency and better scheduling performance; on the other hand, since the degree of inversion of the delivery time sequence is to a certain extent related to the inventory time of the scheduled unit, the scheduling method can be used to schedule the units in the future. The current processing sequence determined in this embodiment takes into account both the overdue delivery time and the inventory time, and achieves a balance between the overdue delivery time and the inventory time. On the basis of meeting the delivery time as much as possible, the inventory is reduced, thereby reducing production costs. On the other hand, the scheduling method provided in this embodiment takes into account the overdue delivery time of each scheduled unit in the objective function. The overdue delivery time of each scheduled unit is related to the delivery time of each scheduled unit and the completion time of each scheduled unit in the target operation unit, and the completion time of each scheduled unit in the target operation unit is related to the load of the target operation unit. Therefore, the workshop scheduling method can achieve load balancing of the target operation unit.

[0088] Figure 5This is a flow chart of the workshop scheduling method based on the industrial Internet provided in the second embodiment of the present invention. Figure 1 Based on the illustrated embodiment and various optional implementations, a detailed description of the implementation of the workshop scheduling method in a scenario where the number of currently scheduled units is multiple is given. Figure 5 As shown, the workshop scheduling method provided in this embodiment includes the following steps:

[0089] Step 501: insert each of the multiple currently scheduled units into a different position of the original processing sequence to form candidate processing sequences.

[0090] In this embodiment, if there are multiple currently scheduled units, each currently scheduled unit is inserted into a different position of the original processing sequence to form candidate processing sequences.

[0091] For example, assuming that the currently scheduled units are C and D, and the original processing sequence is (A, B), the candidate processing sequences obtained can be: (C, A, B), (A, C, B), (A, B, C), (D, A, B), (A, D, B), (A, B, D).

[0092] Step 502: Calculate the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit.

[0093] Step 503: Determine the candidate processing sequence whose corresponding objective function meets the preset conditions as the current processing sequence of the target operation unit.

[0094] The implementation process and technical principles of step 502 and step 202, and step 503 and step 203 are similar, and will not be repeated here.

[0095] Step 504: remove the currently scheduled units that are newly inserted into the current processing sequence compared to the original processing sequence from the unscheduled scheduled units of the target operation unit to form the remaining currently scheduled units.

[0096] In step 504, since there are multiple currently scheduled units, after determining the current processing sequence, the remaining currently scheduled units are determined. In the above example, the currently scheduled units are C and D, and the original processing sequence is (A, B). Assuming that the current processing sequence determined in step 503 is (A, B, D), the remaining currently scheduled unit is C.

[0097] Step 505 : If the remaining currently scheduled units are not empty, the remaining currently scheduled units are determined as a new plurality of currently scheduled units, the current processing sequence is used as a new original processing sequence, and the process returns to step 501 .

[0098] Step 506: If the remaining currently scheduled units are empty, the current processing sequence is determined as the final processing sequence of the target operation unit.

[0099] In steps 505 and 506, if the remaining currently scheduled units are not empty, it means that scheduling needs to be continued, and the process returns to step 501. If the remaining currently scheduled units are empty, the current processing sequence is determined as the final processing sequence of the target operation unit.

[0100] The following example illustrates the above process. Assume that scheduled unit A has a processing time of 1 second and a delivery time of 10 seconds; scheduled unit B has a processing time of 9 seconds and a delivery time of 10 seconds; and scheduled unit C has a processing time of 5 seconds and a delivery time of 9 seconds. Assume that the objective function is objective = total overdue delivery time + number of inversions.

[0101] In the first scheduling, the original processing sequence is empty. There are currently 3 scheduled units. Execute step 501, and the candidate processing sequences formed are:

[0102] Candidate processing sequence 1 is (A), completion time sequence is (1), total overdue delivery time is: 0, delivery time sequence is (10), and the reverse sequence number is 0. The objective function of candidate processing sequence 1 is 0.

[0103] Candidate processing sequence 2 is (B), the completion time sequence is (9), the total overdue delivery time is: 0, the delivery time sequence is (10), and the reverse sequence number is 0. The objective function of candidate processing sequence 2 is 0.

[0104] Candidate processing sequence 3 is (C), completion time sequence is (5), total overdue delivery time is: 0, delivery time sequence is (9), and the reverse sequence number is 0. The objective function of candidate processing sequence 3 is 0.

[0105] At this point, the objective functions of the candidate processing sequences are equal. A preset rule can be used. For example, the currently scheduled unit with the highest number is inserted into the original processing sequence. Assuming that A is numbered first, the current processing sequence formed after the first scheduling is (A). Then, execute step 504. The remaining currently scheduled units are determined to be (B, C). Execute step 505. Set the current processing sequence (A) as the new original processing sequence and (B, C) as the new multiple currently scheduled units, and return to execute step 501.

[0106] In the second scheduling, the original processing sequence is (A). There are currently two scheduled units: B and C. Executing step 501, the candidate processing sequences formed are:

[0107] Candidate processing sequence 1 is (B, A), the completion time sequence is (9, 10), the total overdue delivery time is: 0, the delivery time sequence is (10, 10), and the reverse sequence number is 0. The objective function of candidate processing sequence 1 is 0.

[0108] Candidate processing sequence 2 is (A, B), the completion time sequence is (1, 10), the total overdue delivery time is 0, the delivery time sequence is (10, 10), and the reverse sequence number is 0. The objective function of candidate processing sequence 2 is 0.

[0109] Candidate processing sequence 3 is (C, A), the completion time sequence is (5, 6), the total overdue delivery time is: 0, the delivery time sequence is (9, 10), and the reverse sequence number is 0. The objective function of candidate processing sequence 3 is 0.

[0110] Candidate processing sequence 4 is (A, C), completion time sequence is (1, 6), total overdue delivery time is: 0, delivery time sequence is (10, 9), and the reverse sequence number is 1. The objective function of candidate processing sequence 4 is 1.

[0111] The objective functions of candidate processing sequences 1 to 3 are all minimum and equal. A certain preset rule can be used. For example, the current scheduling unit with the first number is inserted into the original processing sequence. Assuming that B is numbered first, the objective functions of candidate processing sequence 1 and candidate processing sequence 2 are equal. At this time, a candidate processing sequence can be randomly determined as the current processing sequence, or determined by another rule. Assume that the current processing sequence formed after the second scheduling is (B, A). Afterwards, execute step 504. The remaining current scheduled units determined are (C). Execute step 505. Use the current processing sequence (B, A) as the new original processing sequence and (C) as the new multiple current scheduled units, and return to execute step 501.

[0112] In the third scheduling, the original processing sequence is (B, A). Currently, there is one unit being scheduled: C.

[0113] Execute step 501 to form candidate processing sequences:

[0114] Candidate processing sequence 1 is (C, B, A), the completion time sequence of each scheduled unit is (5, 14, 15), the total overdue delivery time is: 9, the delivery time sequence is (9, 10, 10), and the reverse sequence number is 0. The objective function of candidate processing sequence 1 is 9.

[0115] Candidate processing sequence 2 is (B, C, A), the completion time sequence of each scheduled unit is (9, 14, 15), the total overdue delivery time is 10, the delivery time sequence is (10, 9, 10), and the reverse sequence number is 1. The objective function of candidate processing sequence 2 is 11.

[0116] Candidate processing sequence 3 is (B, A, C), the completion time sequence of each scheduled unit is (9, 10, 15), the total overdue delivery time is 6, the delivery time sequence is (10, 10, 9), and the reverse sequence number is 2. The objective function of candidate processing sequence 3 is 8.

[0117] Therefore, candidate processing sequence 3 (B, A, C) is determined as the current processing sequence of the target work unit.

[0118] Then, step 504 is executed. If the remaining currently scheduled units are determined to be empty, step 506 is executed to determine the current processing sequence (B, A, C) as the final processing sequence of the target operation unit.

[0119] The workshop scheduling method based on the Industrial Internet provided in this embodiment can traverse the current scheduled unit and traverse different positions in the original processing sequence in the scenario where there are multiple currently scheduled units. From the candidate processing sequences obtained through traversal, a candidate processing sequence whose objective function meets the preset conditions is determined. This process is executed in a loop until the current scheduled unit is empty, and finally the final processing sequence of the target operation unit is determined. It has the following technical effects: on the one hand, the execution efficiency is still high in the scenario where there are multiple currently scheduled units; on the other hand, due to the loop traversal operation, the performance of the scheduling results can be improved; on the other hand, on the basis of meeting the delivery time as much as possible, inventory is reduced, thereby reducing production costs; on the other hand, load balancing can be achieved.

[0120] Figure 6 The structure diagram of a workshop scheduling device based on the industrial Internet according to an embodiment of the present invention is shown in FIG. The device can be set in an electronic device such as a computer device. Figure 6 As shown, the workshop scheduling device based on the industrial Internet provided in this embodiment includes the following modules: a first determination module 61, a second determination module 62 and a third determination module 63.

[0121] The first determining module 61 is configured to insert the currently scheduled unit into different positions of the original processing sequence of the target operation unit to form candidate processing sequences.

[0122] The original processing sequence is used to represent the original processing order of each scheduled unit in the target operation unit.

[0123] The second determining module 62 is configured to calculate the objective function of each candidate processing sequence according to the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit.

[0124] In one embodiment, the second determination module 62 is specifically used to: determine the overdue delivery time of each scheduled unit in the candidate processing sequence based on the delivery time of each scheduled unit in the candidate processing sequence and the completion time of each scheduled unit in the target operation unit; sort the delivery time of each scheduled unit according to the processing order of each scheduled unit in the candidate processing sequence to generate a delivery time sequence; determine the degree of reversal of the delivery time sequence of each scheduled unit based on the delivery time sequence; calculate the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of reversal of the delivery time sequence formed by the delivery time of each scheduled unit.

[0125] In one embodiment, the degree of reversal includes a reversal number. In determining the degree of reversal of the delivery time sequence of each scheduled unit according to the delivery time sequence, the second determining module 62 is specifically configured to: count the reversal numbers of the delivery time of each scheduled unit in the delivery time sequence.

[0126] In one embodiment, in terms of determining the overdue delivery time of each scheduled unit in the candidate processing sequence based on the delivery time of each scheduled unit in the candidate processing sequence and the completion time of each scheduled unit in the target operation unit, the second determination module 62 is specifically used to: for each scheduled unit, if the completion time of the scheduled unit in the target operation unit is greater than the delivery time of the scheduled unit, then the overdue delivery time of the scheduled unit is determined to be: the difference between the completion time of the scheduled unit in the target operation unit and the delivery time of the scheduled unit; if the completion time of the scheduled unit in the target operation unit is less than or equal to the delivery time of the scheduled unit, then the overdue delivery time of the scheduled unit is determined to be zero.

[0127] In one embodiment, in terms of calculating the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit, the second determination module 62 is specifically used to: determine the total overdue delivery time of the scheduled units in the candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence; and determine the objective function of the candidate processing sequence based on the total overdue delivery time and the inversion number of the delivery time of the scheduled units.

[0128] The third determining module 63 is configured to determine a candidate processing sequence whose corresponding objective function satisfies a preset condition as the current processing sequence of the target operation unit.

[0129] The workshop scheduling device based on the industrial Internet provided by the embodiment of the present invention can execute the workshop scheduling method based on the industrial Internet provided by any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0130] Figure 7 This is a structural diagram of another workshop scheduling device based on the industrial Internet according to an embodiment of the present invention. Figure 7 Based on the embodiment shown, a detailed description of other modules included in the scheduling device is given. In this embodiment, the number of currently scheduled units is multiple. Figure 7 As shown, the workshop scheduling device based on the industrial Internet provided in this embodiment also includes: a fourth determination module 71, a fifth determination module 72 and a sixth determination module 73.

[0131] In this embodiment, the first determining module 61 is specifically configured to insert each of the multiple currently scheduled units into a different position of the original processing sequence to form candidate processing sequences.

[0132] The fourth determining module 71 is configured to remove the currently scheduled units that are newly inserted into the current processing sequence compared to the original processing sequence from the unscheduled scheduled units of the target operation unit to form remaining currently scheduled units.

[0133] The fifth determining module 72 is used to determine the remaining currently scheduled units as multiple new currently scheduled units when the remaining currently scheduled units are not empty, use the current processing sequence as the new original processing sequence, and return to execute the steps executed by the first determining module.

[0134] The sixth determining module 73 is configured to determine the current processing sequence as the final processing sequence of the target operation unit when the remaining currently scheduled units are empty.

[0135] The workshop scheduling device based on the industrial Internet provided by the embodiment of the present invention can execute the workshop scheduling method based on the industrial Internet provided by any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0136] Figure 8 A schematic structural diagram of an electronic device for implementing an industrial Internet-based workshop scheduling method according to an embodiment of the present invention. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0137] like Figure 8As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., which is communicatively connected to the at least one processor 11. The memory stores a computer program that can be executed by the at least one processor. The processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 into the random access memory (RAM) 13. Various programs and data required for the operation of the electronic device 10 can also be stored in the RAM 13. The processor 11, ROM 12, and RAM 13 are connected to each other via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0138] Multiple components in the electronic device 10 are connected to the I / O interface 15, including an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a magnetic disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks.

[0139] The processor 11 may be any general-purpose and / or specialized processing component with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above.

[0140] In some embodiments, the workshop scheduling method based on the industrial Internet can be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the workshop scheduling method based on the industrial Internet described above can be performed. Alternatively, in other embodiments, the processor 11 can be configured to execute the workshop scheduling method based on the industrial Internet in any other appropriate manner (for example, by means of firmware).

[0141] Various embodiments of the systems and techniques described herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), system-on-chip systems (SOCs), programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include being implemented in one or more computer programs that are executable and / or interpreted on a programmable system that includes at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0142] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when the computer program is executed by the processor, the functions / operations specified in the flowcharts and / or block diagrams are implemented. The computer program may be executed entirely on the machine, partially on the machine, as a stand-alone software package, partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0143] In the context of the present invention, computer-readable storage media can be tangible media that can contain or store a computer program for use with an instruction execution system, device or equipment or used in combination with an instruction execution system, device or equipment. Computer-readable storage media can include but are not limited to electronic, magnetic, optical, electromagnetic, infrared or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, computer-readable storage media can be machine-readable signal media. More specific examples of machine-readable storage media can include electrical connections based on one or more lines, portable computer disks, hard disks, random access memories (RAM), read-only memories (ROM), erasable programmable read-only memories (EPROM or flash memory), optical fibers, portable compact disk read-only memories (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0144] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0145] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0146] A computing system may include clients and servers. The clients and servers are typically remote from each other and typically interact via a communication network. This client-server relationship arises through computer programs running on the respective computers, creating a client-server relationship. The server may be a cloud server, also known as a cloud computing server or cloud host. This server is a hosting product within the cloud computing service ecosystem that addresses the management difficulties and limited scalability of traditional physical hosting and VPS services.

[0147] It should be understood that the various forms of the processes shown above can be used to reorder, add, or delete steps. For example, the steps described in the present invention can be performed in parallel, sequentially, or in a different order, as long as the desired results of the technical solution of the present invention can be achieved. This is not limited herein.

[0148] The above specific embodiments do not limit the scope of protection of the present invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions may be made based on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention are intended to be included within the scope of protection of the present invention.

Claims

1. A workshop scheduling method based on the Industrial Internet, characterized in that: include: Inserting the currently scheduled unit at different positions of the original processing sequence of the target operation unit to form candidate processing sequences; wherein the original processing sequence is used to represent the original processing order of each scheduled unit in the target operation unit; Calculating the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of reversal of the delivery time sequence formed by the delivery time of each scheduled unit includes: determining the overdue delivery time of each scheduled unit in the candidate processing sequence based on the delivery time of each scheduled unit and the completion time of each scheduled unit in the target operation unit; sorting the delivery time of each scheduled unit according to the processing order of each scheduled unit in the candidate processing sequence to generate a delivery time sequence; determining the degree of reversal of the delivery time sequence of each scheduled unit based on the delivery time sequence; calculating the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of reversal of the delivery time sequence formed by the delivery time of each scheduled unit; wherein the reversal degree includes a reversal number, and determining the degree of reversal of the delivery time sequence of each scheduled unit based on the delivery time sequence includes: counting the number of reversals of the delivery time of each scheduled unit in the delivery time sequence; The candidate processing sequence whose corresponding objective function meets a preset condition is determined as the current processing sequence of the target operation unit; wherein the preset condition is that the objective function is minimized.

2. The method according to claim 1, characterized in that If there are multiple units currently being scheduled, inserting the currently scheduled units at different positions of the original processing sequence of the target operation unit to form candidate processing sequences includes: Each of the multiple currently scheduled units is inserted into a different position of the original processing sequence to form candidate processing sequences.

3. The method according to claim 2, characterized in that After determining the candidate processing sequence whose corresponding objective function satisfies the preset condition as the current processing sequence of the target operation unit, the method further includes: removing the currently scheduled unit newly inserted into the current processing sequence compared to the original processing sequence from the unscheduled scheduled units of the target operation unit to form the remaining currently scheduled units; If the remaining currently scheduled units are not empty, the remaining currently scheduled units are determined as multiple new currently scheduled units, the current processing sequence is used as a new original processing sequence, and the process returns to the step of "inserting each of the multiple currently scheduled units into a different position of the original processing sequence to form candidate processing sequences." If the remaining currently scheduled units are empty, the current processing sequence is determined as the final processing sequence of the target operation unit.

4. The method according to claim 1, wherein The determining, based on the delivery time of each scheduled unit in the candidate processing sequence and the completion time of each scheduled unit in the target operation unit, of the overdue delivery time of each scheduled unit in the candidate processing sequence includes: For each scheduled unit, if the completion time of the scheduled unit in the target operation unit is greater than the delivery time of the scheduled unit, the overdue delivery time of the scheduled unit is determined as: the difference between the completion time of the scheduled unit in the target operation unit and the delivery time of the scheduled unit; If the completion time of the scheduled unit in the target operation unit is less than or equal to the delivery time of the scheduled unit, the overdue delivery time of the scheduled unit is determined to be zero.

5. The method according to claim 1, wherein Calculating the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit includes: Determining a total overdue delivery time of the scheduled units in the candidate processing sequence according to the overdue delivery time of each scheduled unit in the candidate processing sequence; An objective function of the candidate processing sequence is determined according to the inverse order of the total overdue delivery time and the delivery time of the scheduled units.

6. A workshop scheduling device based on the Industrial Internet, characterized in that: include: A first determining module is configured to insert the currently scheduled unit into different positions of the original processing sequence of the target operation unit to form candidate processing sequences; wherein the original processing sequence is used to represent the original processing order of each scheduled unit in the target operation unit; a second determining module, configured to calculate an objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of inversion of the delivery time sequence formed by the delivery time of each scheduled unit; A third determining module is configured to determine a candidate processing sequence whose corresponding objective function satisfies a preset condition as the current processing sequence of the target operation unit; wherein the preset condition is that the objective function is minimized; The second determination module is specifically configured to: determine the overdue delivery time of each scheduled unit in the candidate processing sequence based on the delivery time of each scheduled unit in the candidate processing sequence and the completion time of each scheduled unit in the target operation unit; sort the delivery time of each scheduled unit according to the processing order of each scheduled unit in the candidate processing sequence to generate a delivery time sequence; determine the degree of reversal of the delivery time sequence of each scheduled unit based on the delivery time sequence; calculate the objective function of each candidate processing sequence based on the overdue delivery time of each scheduled unit in the candidate processing sequence and the degree of reversal of the delivery time sequence formed by the delivery time of each scheduled unit; The degree of reversal includes a reversal number. In terms of determining the degree of reversal of the delivery time sequence of each scheduled unit based on the delivery time sequence, the second determination module is specifically used to: count the reversal numbers of the delivery time of each scheduled unit in the delivery time sequence.

7. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the workshop scheduling method based on the industrial Internet as described in any one of claims 1-5.

8. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the workshop scheduling method based on the industrial Internet as described in any one of claims 1 to 5 when executed.

Images