Dynamic multi-product integrated scheduling method with tight delivery deadlines

Abstract

The present invention proposes a dynamic multi-product comprehensive scheduling method with tight delivery deadlines. The method first adopts the "layer priority + short time + equipment priority" strategy to improve the parallel processing capability of the equipment; secondly, a product contribution value strategy is proposed to obtain the product contribution value according to the number of urgent processes, the maximum delivery date and the total processing time of the product, thereby determining the processing order of the product, effectively making multiple products processed on time within the delivery period; finally, a game process dynamic adjustment strategy is proposed to dynamically adjust the process according to different situations, so that the process is compactly processed, the idle time of the equipment is reduced, and the overall utilization rate of the equipment is improved.

Description

Technical Field

[0001] The invention belongs to the technical field of computer integrated manufacturing, and in particular relates to a dynamic multi-product comprehensive scheduling method with tight delivery deadlines. Background Art

[0002] Digitalization, networking and intelligence in intelligent manufacturing are cutting-edge academic research topics that are worth studying and summarizing.

[0003] In recent years, the product production process has become increasingly complex, and the production of multiple varieties and small batches has received more and more attention from enterprises. How to reduce production costs and improve production efficiency has become an important factor in the survival and development of enterprises. Summary of the invention

[0004] In the field of comprehensive scheduling research on complex products with multiple varieties and small batches, the present invention aims at the field of comprehensive scheduling of multiple products with delivery dates. Because the impact of the process processing order and process conflicts of multiple products on the delivery date is not fully considered, which leads to the problem of affecting the delivery date of multiple products, a dynamic comprehensive scheduling method for multiple products with tight delivery dates is proposed. Specifically, in the scheduling process of single-piece or small-batch tree-structured complex products with "simultaneous processing and assembly", the method of the present invention simultaneously achieves the optimization goals of shorter delivery dates and higher equipment utilization rates for multiple products, and the scheduling effect is better. The present invention first forms the initial processing order of multiple products according to the "equipment priority + short time + layer priority" strategy, then proposes a product contribution value strategy, and finally proposes a game process dynamic adjustment strategy, which effectively solves the conflict problem when multiple products are processed together.

[0005] The present invention is implemented by the following technical scheme, and proposes a dynamic multi-product comprehensive scheduling method with tight delivery period, and the method is specifically as follows:

[0006] Step 1: Determine the initial processing procedure set for multiple products through the "layer priority + short time + equipment priority" strategy;

[0007] Step 2: Calculate the number of urgent path lengths r respectively i and the maximum delivery time d i ;

[0008] Step 3: Calculate the product contribution value P according to the product contribution value strategy i ;

[0009] Step 4: Determine whether there is a game process in the initial processing process set. If yes, go to step 5; if not, go to step 6;

[0010] Step 5: Dynamically adjust the strategy according to the game process and select the process scheduling order;

[0011] Step 6: Store the process into the schedulable process set;

[0012] Step 7: Delete the process from the initial processing process set;

[0013] Step 8: Determine whether the initial processing procedure set is empty. If yes, go to step 9; if not, go to step 4.

[0014] Step 9: Determine whether the product meets its own delivery time constraints. If yes, go to step 11; if not, go to step 10;

[0015] Step 10: The product plan is terminated and no production is arranged;

[0016] Step 11: Scheduling is completed, exit.

[0017] Furthermore, the mathematical model of the method is as follows: Assume that there are G products planned to be produced, and each product contains U i A process needs to be processed on m equipment, and the equipment resource set is M = {M k}(1≤k≤m); let the starting processing time of product i be S i , the maximum delivery time of the product is d i TB ijk TE ijk They represent the jth process of the i-th product in equipment M k The start processing time and the completion processing time on the equipment M k The total time to complete all processes is TM k ;X ijef =1 means that the jth process in product i and the fth process in product e are processed on the same equipment and process j takes precedence over process f; then:

[0018] T=min(max{TM k}) (1)

[0019] stTM k =max(TE jik ) (2)

[0020] TE ijk ≤d i (3)

[0021] TB ijk ≥S i (4)

[0022] X ijef =1 T ij ≤T ef (5)

[0023] Formula (1) represents the optimization objective; Formula (2) represents the maximum value of the latest completion time of the processing process on each equipment resource; Formula (3) represents that each process in the product must be processed within the product delivery period; Formula (4) represents that the start processing time of each process in the product shall not be earlier than the start processing time of the product; Formula (5) represents that once the equipment starts processing a process, it must wait until the process is completed before starting to process other processes.

[0024] Furthermore, the contribution value of the product P i for:

[0025]

[0026] In formula (6): r i represents the number of urgent path lengths of product i; d i represents the maximum delivery time of product i; t i Represents the total processing time of product i.

[0027] Furthermore, the game process dynamic adjustment strategy refers to dynamic adjustment when different product processes seize the same equipment. The specific operations are:

[0028] (1) When urgent processes of different products conflict, the process with the largest contribution value will be scheduled first;

[0029] (2) When a common process with a large contribution value conflicts with an urgent process with a small contribution value, the urgent process with a small contribution value will be scheduled first;

[0030] (3) When a critical process with a large contribution value conflicts with a common process with a small contribution value, the critical process with a large contribution value will be scheduled first;

[0031] (4) When conflicts arise between the common processes of different products, the process with the largest contribution value will be scheduled first.

[0032] Furthermore, the urgent path refers to a path with the longest processing time on the secondary urgent path, and the secondary urgent path refers to a path with the largest number of longitudinal processes.

[0033] Furthermore, the urgent process refers to the process on the urgent path.

[0034] Furthermore, the initial processing process set refers to the process set of the initial processing sequence formed by multiple product processes, and the schedulable process set refers to the process set that can be processed at the current moment.

[0035] Furthermore, the maximum delivery time refers to the sum of the processing completion times of multiple products.

[0036] The present invention also proposes an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of the dynamic multi-product comprehensive scheduling method with tight delivery period are implemented.

[0037] The present invention also proposes a computer-readable storage medium for storing computer instructions, which, when executed by a processor, implement the steps of the dynamic multi-product comprehensive scheduling method with tight delivery dates.

[0038] The beneficial effects of the present invention are:

[0039] In the comprehensive scheduling of multiple products considering the delivery period, in order to solve the problem of process conflicts caused by the joint processing of multiple products, the present invention proposes a dynamic comprehensive scheduling method for multiple products with tight delivery period. In terms of vertical optimization, the product contribution value strategy determines the product processing order and effectively reduces the completion time of the process; in terms of horizontal optimization, the game process dynamic adjustment strategy enables the process to be processed compactly, effectively improving the equipment utilization rate. Therefore, on the basis of completing the work on time within the delivery period, the method of the present invention further optimizes the scheduling effect in both vertical and horizontal directions.

[0040] The present invention provides a new method for solving the comprehensive scheduling problem with tight delivery deadlines, which has certain theoretical significance and practical value, and also provides a basis for subsequent in-depth research on the comprehensive scheduling of multiple workshops considering delivery deadlines. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 This is a schematic diagram of the product scheduling process;

[0042] Figure 2 Design a flow chart for the dynamic multi-product comprehensive scheduling method with tight delivery deadlines described in the present invention;

[0043] Figure 3 This is a schematic diagram of the processing technology tree for complex product A;

[0044] Figure 4 This is a schematic diagram of the processing technology tree for complex product B;

[0045] Figure 5 Schedule 190 hours of work in the Gantt chart for product A;

[0046] Figure 6 Schedule the sequential Gantt chart for product B for 150 hours;

[0047] Figure 7 This is the Gantt chart of process conflicts for products A and B;

[0048] Figure 8 This is the overall scheduling sequence Gantt chart for products A and B;

[0049] Fig. 9 Gantt chart for forward process B1;

[0050] Fig.10 Gantt chart for forward process B4;

[0051] Fig.11 Gantt chart for forward process B6;

[0052] Fig.12 Scheduling a Gantt chart for the method of the present invention;

[0053] Fig.13 Gantt chart for scheduling method based on delivery deadline urgency;

[0054] Fig.14 Gantt chart of the dynamic multi-product scheduling method considering the delivery time constraints. DETAILED DESCRIPTION

[0055] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments 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 creative work are within the scope of protection of the present invention.

[0056] The main task of the comprehensive scheduling problem considering the delivery date is how to arrange the process sequence more reasonably so that a better production plan can be obtained between the start time and the delivery date of the product. Therefore, the present invention proposes a dynamic multi-product comprehensive scheduling method with tight delivery date. The main tasks of the method are:

[0057] (1) For the delivery time problem of multiple products, the maximum delivery time is determined by adopting the strategy of "equipment priority + short time + layer priority" and inserting the idle time of equipment into the process in sequence;

[0058] (2) In the comprehensive scheduling of multiple products, propose product contribution value strategies and determine the processing order of products;

[0059] (3) For the process conflict problem of multiple products, a game process dynamic adjustment strategy is proposed to dynamically adjust the process processing sequence to make the process compact.

[0060] Technical term explanation:

[0061] Definition 1: Game process: a process that competes for the same equipment resources at the same time.

[0062] Define the secondary urgent path: the path with the largest number of vertical processes.

[0063] Definition 3: Urgent path: The path with the longest processing time on the second most urgent path.

[0064] Definition 4: Urgent process: The process on the urgent path.

[0065] Definition 5: Initial processing sequence set: the set of processes in the initial processing sequence formed by multiple product processes.

[0066] Definition 6: Schedulable process set: the set of processes that can be processed at the current moment.

[0067] Definition 7: Maximum delivery time: the sum of the processing completion time of multiple products.

[0068] Combination Figure 1-Figure 14 The present invention proposes a dynamic multi-product comprehensive scheduling method with tight delivery period, and the method is specifically as follows:

[0069] Step 1: Determine the initial processing procedure set for multiple products through the "layer priority + short time + equipment priority" strategy;

[0070] Step 2: Calculate the number of urgent path lengths r respectively i and the maximum delivery time d i ;

[0071] Step 3: Calculate the product contribution value P according to the product contribution value strategy i ;

[0072] Step 4: Determine whether there is a game process in the initial processing process set. If yes, go to step 5; if not, go to step 6;

[0073] Step 5: Dynamically adjust the strategy according to the game process and select the process scheduling order;

[0074] Step 6: Store the process into the schedulable process set;

[0075] Step 7: Delete the process from the initial processing process set;

[0076] Step 8: Determine whether the initial processing procedure set is empty. If yes, go to step 9; if not, go to step 4.

[0077] Step 9: Determine whether the product meets its own delivery time constraints. If yes, go to step 11; if not, go to step 10;

[0078] Step 10: The product plan is terminated and no production is arranged;

[0079] Step 11: Scheduling is completed, exit.

[0080] The mathematical model of the method is as follows: Assume that there are G products to be produced, and each product contains U iA process needs to be processed on m equipment, and the equipment resource set is M = {M k}(1≤k≤m); let the starting processing time of product i be S i , the maximum delivery time of the product is d i TB ijk TE ijk They represent the jth process of the i-th product in equipment M k The start processing time and the completion processing time on the equipment M k The total time to complete all processes is TM k ;X ijef =1 means that the jth process in product i and the fth process in product e are processed on the same equipment and process j takes precedence over process f; then:

[0081] T=min(max{TM k}) (1)

[0082] stTM k =max(TE jik ) (2)

[0083] TE ijk ≤d i (3)

[0084] TB ijk ≥S i (4)

[0085] X ijef =1 T ij ≤T ef (5)

[0086] Formula (1) represents the optimization objective; Formula (2) represents the maximum value of the latest completion time of the processing process on each equipment resource; Formula (3) represents that each process in the product must be processed within the product delivery period; Formula (4) represents that the start processing time of each process in the product shall not be earlier than the start processing time of the product; Formula (5) represents that once the equipment starts processing a process, it must wait until the process is completed before starting to process other processes.

[0087] The present invention adopts a combination strategy to optimize the scheduling process. First, the "layer priority + short time + equipment priority" strategy is adopted to improve the parallel processing capability of the equipment; secondly, a product contribution value strategy is proposed, and the contribution value of the product is obtained according to the number of urgent processes of the product, the maximum delivery time and the total processing time, so as to determine the processing order of the products, and effectively make multiple products processed on time within the delivery period; finally, a game process dynamic adjustment strategy is proposed, and the process is dynamically adjusted according to different situations, so that the process is compactly processed, the idle time of the equipment is reduced, and the overall utilization rate of the equipment is improved.

[0088] Product contribution value strategy: This invention analyzes the different processing times and urgent process quantities of different products. In order to reasonably arrange the processing order of multiple products, the product contribution value P is defined as follows: i for:

[0089]

[0090] In formula (6): r i represents the number of urgent path lengths of product i; d i represents the maximum delivery time of product i; t i Indicates the total processing time of product i. The larger the contribution value of product i in this strategy, the more urgent the time requirement of the product is, and the closer the completion time of the product is to the delivery date.

[0091] Game process dynamic adjustment strategy: Game process dynamic adjustment strategy refers to dynamic adjustment when different product processes seize the same equipment. Specific operations:

[0092] (1) When urgent processes of different products conflict, the process with the largest contribution value will be scheduled first;

[0093] (2) When a common process with a large contribution value conflicts with an urgent process with a small contribution value, the urgent process with a small contribution value will be scheduled first;

[0094] (3) When a critical process with a large contribution value conflicts with a common process with a small contribution value, the critical process with a large contribution value will be scheduled first;

[0095] (4) When conflicts arise between the common processes of different products, the process with the largest contribution value will be scheduled first.

[0096] The specific operation forms are shown in Table 1.

[0097] Table 1 Dynamic adjustment of game process strategy table

[0098]

[0099] According to the product contribution value strategy and the game process dynamic adjustment strategy proposed by the method of the present invention, the product scheduling process diagram is as follows: Figure 1 As shown. Based on the initial scheduling plan P0, the first set of game process sets {Ai, Bi} is selected. After the game process dynamic adjustment strategy, the priority scheduling process is selected, and the processing order is dynamically adjusted to generate the scheduling plan P1. This cycle is repeated until all products are processed and the final scheduling plan PN is generated.

[0100] Complexity analysis of the method: The time complexity of determining the initial processing set of each product through the "layer priority + short time + equipment priority" strategy is O(n); the time complexity of calculating the urgent path length of the product is O(n); the time complexity of calculating the contribution value of the product is O(n). 2 ); For the existing game process, call the game process dynamic coordination strategy, the time complexity is O(n 2 ); In summary, the time complexity of the method of the present invention is max(O(n),O(n 2 ))=O(n 2 ).

[0101] Scheduling Example Demonstration of the Invention

[0102] Assume that there are multiple varieties of small batch products A and B. The process nodes on the processing technology tree have the attributes of process number, corresponding processing equipment number and its own time. Figure 3 , Figure 4 shown.

[0103] Process scheduling sequence for multiple products: For product A, the strategy of "equipment priority + shortest time + layer priority" is adopted, and the process scheduling sequence is {A1, A4, A3, A5, A2, A6, A7, A9, A8, A10, A11}, and the completion time is 190 working hours. The scheduling Gantt chart of product A is as follows Figure 5 As shown in the figure. For product B, the strategy of "equipment priority + shortest time + layer priority" is adopted, and the process scheduling sequence is {B2, B1, B3, B5, B4, B6, B7, B8}, and the completion time is 150 working hours. The scheduling Gantt chart of product B is shown in the figure. Figure 6 shown.

[0104] Solve the maximum delivery time: Figure 5 , Figure 6 It can be seen that there is a conflict between the common processing steps of products A and B. Figure 7 As shown. According to the processing technology tree of products A and B above, the urgent process set of product A is {A1, A2, A6, A8, A10, A11}, the number of urgent processes is 6, and the urgent path length is 175 working hours. The urgent process set of product B is {B1, B4, B6, B7, B8}, the number of urgent processes is 5, and the urgent path length is 150 working hours. According to the maximum delivery time strategy, the urgent path lengths of product A and product B are compared, and it is concluded that the urgent path length of product A is greater than that of product B. Figure 7 Based on the above, insert the process of product B into the idle period of product A according to the scheduling order, and the subsequent processes are moved back in turn. The final total scheduling time is the maximum delivery time. The maximum delivery time of product A and product B is 285 hours. The overall scheduling sequence of products A and B is shown in the Gantt chart as follows Figure 8 shown.

[0105] Game process dynamic adjustment strategy: According to the processing technology tree of products A and B, the urgent process, the number of urgent processes, and the length of urgent paths of each product are calculated. The contribution value of each product is calculated in combination with the maximum delivery time of the product. At the same time, the processing order of the product is determined according to the contribution value. The information table of products A and B is shown in Table 2. Assuming that the start processing time of products A and B is 0, according to the information in Table 1, it can be determined that the contribution value of product A is 1.84 and the contribution value of product B is 1.11, so their processing order is determined to be A and B.

[0106] Table 2 Information of products A and B

[0107]

[0108]

[0109] Match the scheduling order of product A with the scheduling order of product B, dynamically adjust the strategy according to the game process, handle different situations, compare the game processes, and get the game results. The specific steps are as follows:

[0110] Step 1: Compare the game process sets {A1, B3}, {B3, A4}: A1 and A4 are urgent processes and ordinary processes, B3 is an ordinary process, and in the initial processing process set, A1 is processed before A4, so the scheduling order is A1, A4, B3.

[0111] Step 2: Compare the next game process set {A3, B2}: A3 is a common process, B2 is a common process, so the scheduling order is A3, B2.

[0112] Step 3: Compare the game process sets {A5, B1}, {A2, B1}: A5 and A2 are ordinary processes and urgent processes respectively, B1 is an urgent process, and A5 is processed before A2 in the initial processing process set, so the scheduling order is B1, A5, A2. Therefore, B1 is moved forward from t = 55 to t = 0 to start scheduling, and A5 and A2 are moved back to t = 25 and t = 65 respectively. Fig. 9 shown.

[0113] Step 4: Compare the game process set {A6, B6}: A6 and B6 are both urgent processes, so the scheduling order is A6, B6.

[0114] Step 5: Compare the game process set {A7, B4}: A7 is a common process, B4 is an urgent process, so the scheduling order is B4, A7. Therefore, B4 is moved forward from t = 130 to t = 45 to start scheduling, and A7 is moved back to t = 75. Fig.10shown.

[0115] Step 6: Compare the game process set {A9, B6}: A9 is a common process, B6 is an urgent process, so the scheduling order is B6, A9. Therefore, B6 is moved forward from t = 190 to t = 100 to start scheduling, and A9 is moved back to t = 260. Fig.11 shown.

[0116] According to the constraints between the processes, the process is repeated until all products are processed. The specific execution process is shown in Table 3. The completion time of products A and B is 255 hours and 220 hours respectively. The Gantt chart of the method of the present invention is as follows: Fig.12 shown.

[0117] Table 3 Game process scheduling execution table

[0118]

[0119]

[0120] The method of the present invention is now compared with representative methods in the same research field in recent years, and experimental results show that the method of the present invention is superior.

[0121] Still Figure 3 , Figure 4 Take the processing tree of as an example, the scheduling method based on the urgency of the delivery date is adopted. The priority value of product A is 0.58, and the priority value of product B is 0.63, so the processing order of the products is B, A. The scheduling order of the processes is B1, B2, B4, B5, B3, B7, B8; A1, A5, A2, A3, A4, A6, A7, A9, A8, A10, A11. Therefore, the completion time of products A and B is 265 hours and 240 hours respectively. The scheduling Gantt chart is as follows: Fig.13 shown.

[0122] The dynamic multi-product scheduling method considering the delivery time constraint is adopted. The urgency index of product A is 0.7 and the urgency index of product B is 0.52, so the processing order of the products is A and B. The scheduling order of the processes is A1, A2, A3, A5, A4, A7, A6, A9, A8, A10, A11; B1, B2, B3, B5, B4, B6, B7, B8. The completion time of products A and B is 190 hours and 285 hours respectively. The scheduling Gantt chart is as follows: Fig.14 shown.

[0123] The method of the present invention, the method based on the urgency of the delivery date, and the dynamic multi-product scheduling method considering the delivery date constraints, the total processing time of the scheduled products A and B are 255, 265, and 285 respectively, and the processing time of the method of the present invention is less. The reason why the present invention is better is mainly because:

[0124] (1) Aiming at the comprehensive scheduling problem of multiple products with tight delivery deadlines, the present invention proposes a product contribution value strategy to determine the product processing order, effectively reducing the process completion time. The scheduling method based on the urgency of delivery deadlines proposes a priority strategy to determine the priority of product scheduling according to the urgency, but ignores the impact of the number of urgent processes on the product processing order. The dynamic multi-product scheduling method considering the existence of delivery deadline constraints proposes a high urgency index product priority strategy to determine the product processing order by the urgency index, but ignores the impact of the urgent path and the number of urgent processes on the product processing order, resulting in delayed product completion time.

[0125] (2) The present invention aims at the equipment conflict problem between product processes and proposes a game process dynamic adjustment strategy to dynamically adjust the processing order of the process, so that the process is compactly processed and the idle time of the equipment is reduced. Fig.12 The equipment M2 in the middle is processed intensively from t = 0 to t = 200. The scheduling method based on the urgency of the delivery date determines the scheduling order of each product process according to the long path strategy and the short time strategy, but does not consider the full utilization of the equipment idle period, resulting in a lot of idle time. For example, Fig.13 The idle time of equipment M1 from t = 135 to t = 215 affects the overall processing of the product. The dynamic multi-product scheduling method with delivery time constraints uses the method of selecting appropriate process insertion during the equipment idle period, but does not comprehensively consider the dynamic adjustment of the relative positions of each process of the product, resulting in low equipment utilization.

[0126] The method of the present invention not only effectively shortens the total processing time of multiple products, but also improves the equipment utilization rate, which is 4.4% higher than the scheduling method based on the urgency of the delivery date, and 4.9% higher than the dynamic multi-product scheduling method considering the delivery date constraint. The scheduling results of the three algorithms and the equipment utilization rate are shown in Table 4.

[0127] Table 4 Scheduling results and equipment utilization of three methods of the present invention

[0128]

[0129] The experimental results show that:

[0130] In the study of comprehensive scheduling of multiple products, the scheduling results of the present invention reduce the processing time by 10 and 30 working hours respectively compared with the method based on delivery urgency and the dynamic multi-product scheduling method considering delivery constraints.

[0131] At the same time, the present invention proposes a game process dynamic adjustment strategy to address the equipment conflict problem between product processes, dynamically adjusts the processing order of the process, makes the process compact, and reduces the idle time of the equipment. Compared with the scheduling method based on the urgency of the delivery date, it is improved by 4.4%, and compared with the dynamic multi-product scheduling method considering the delivery date constraint, it is improved by 4.9%.

[0132] Therefore, in terms of vertical optimization, the product contribution value strategy of the present invention determines the product processing order and effectively reduces the completion time of the process; in terms of horizontal optimization, the game process dynamic adjustment strategy makes the process compact and effectively improves the equipment utilization rate.

[0133] The present invention also proposes an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of the dynamic multi-product comprehensive scheduling method with tight delivery period are implemented.

[0134] The present invention also proposes a computer-readable storage medium for storing computer instructions, which, when executed by a processor, implement the steps of the dynamic multi-product comprehensive scheduling method with tight delivery dates.

[0135] The memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM bus RAM (DRRAM). It should be noted that the memory of the method described in the present invention is intended to include, but is not limited to, these and any other suitable types of memory.

[0136] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a high-density digital video disc (DVD)), or a semiconductor medium (eg, a solid state disc (SSD)).

[0137] In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software. The steps of the method disclosed in conjunction with the embodiment of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software modules in a processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it is not described in detail here.

[0138] It should be noted that the processor in the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor can be combined and performed. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0139] The above is a detailed introduction to the dynamic multi-product integrated scheduling method with tight delivery date proposed in the present invention. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea; at the same time, for general technical personnel in this field, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A dynamic multi-product comprehensive scheduling method with tight delivery deadlines, characterized by: The method is specifically as follows: Step 1: Determine the initial processing procedure set for multiple products through the "layer priority + short time + equipment priority" strategy; Step 2: Calculate the number of urgent path lengths r respectively i and the maximum delivery time d i ; Step 3: Calculate the product contribution value P according to the product contribution value strategy i ; Step 4: Determine whether there is a game process in the initial processing process set. If yes, go to step 5; if not, go to step 6; Step 5: Dynamically adjust the strategy according to the game process and select the process scheduling order; Step 6: Store the process into the schedulable process set; Step 7: Delete the process from the initial processing process set; Step 8: Determine whether the initial processing procedure set is empty. If yes, go to step 9; if not, go to step 4. Step 9: Determine whether the product meets its own delivery time constraints. If yes, go to step 11; if not, go to step 10; Step 10: The product plan is terminated and no production is arranged; Step 11: Scheduling is completed and exit; The contribution value of the product P i for: In formula (6): r i represents the number of urgent path lengths of product i; d i represents the maximum delivery time of product i; t i represents the total processing time of product i; The game process dynamic adjustment strategy refers to dynamic adjustment when different product processes seize the same equipment. The specific operations are: (1) When urgent processes of different products conflict, the process with the largest contribution value will be scheduled first; (2) When a common process with a large contribution value conflicts with an urgent process with a small contribution value, the urgent process with a small contribution value will be scheduled first; (3) When a critical process with a large contribution value conflicts with a common process with a small contribution value, the critical process with a large contribution value will be scheduled first; (4) When conflicts arise between the common processes of different products, the process with the largest contribution value will be scheduled first.

2. The method according to claim 1, characterized in that The mathematical model of the method is as follows: Assume that there are G products to be produced, and each product contains U i A process needs to be processed on m equipment, and the equipment resource set is M = {M k }(1≤k≤m); let the starting processing time of product i be S i , the maximum delivery time of the product is d i TB ijk TE ijk They represent the jth process of the i-th product in equipment M k The start processing time and the completion processing time on the equipment M k The total time to complete all processes is TM k ;X ijef =1 means that the jth process in product i and the fth process in product e are processed on the same equipment and process j takes precedence over process f; then: T=min(max{TM k }) (1) stTM k =max(TE jik ) (2) THE ijk ≤d i (3) TB ijk ≥S i (4) X ijef =1 T ij ≤T ef (5) Formula (1) represents the optimization objective; Formula (2) represents the maximum value of the latest completion time of the processing process on each equipment resource; Formula (3) represents that each process in the product must be processed within the product delivery period; Formula (4) represents that the start processing time of each process in the product shall not be earlier than the start processing time of the product; Formula (5) represents that once the equipment starts processing a process, it must wait until the process is completed before starting to process other processes.

3. The method according to claim 1, characterized in that The urgent path refers to the path with the longest processing time on the secondary urgent path, and the secondary urgent path refers to the path with the largest number of longitudinal processes.

4. The method according to claim 1, characterized in that Urgent processes refer to processes on the urgent path.

5. The method according to claim 1, characterized in that The initial processing process set refers to the process set of the initial processing sequence formed by multiple product processes, and the schedulable process set refers to the process set that can be processed at the current moment.

6. The method according to claim 1, characterized in that The maximum delivery time refers to the sum of the processing completion time of multiple products.

7. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

8. A computer-readable storage medium for storing computer instructions, characterized in that: When the computer instructions are executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images