A multi-resource parallel production model scheduling method
Through the multi-resource parallel production model, the resource matrix that uniformly handles factors such as machines, personnel, inventory space, etc., solves the problem of high complexity of the traditional scheduling model, realizes intelligent production scheduling management, and improves production efficiency and system adaptability .
Patent Information
- Application Number
- CN202111426709.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-11-27
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2041-11-27
AI Technical Summary
The traditional multi-resource restricted operation workshop scheduling model is complex and it is difficult to effectively solve the production scheduling management problems through standardized computer programs. Especially in complex production environments, it is impossible to effectively deal with the constraints and conflicts of factors such as machines, personnel, and inventory space.
A multi-resource parallel production model is proposed, and a resource occupation matrix is formed by unifying factors such as abstract machines, personnel, and inventory space. The resource matrix logic operation is carried out to resolve resource conflicts and scheduling optimization. .
It lowers the application threshold of production scheduling software, improves the efficiency of production scheduling, adapts to the high complexity in complex production environments, and realizes the unified processing of intelligent production scheduling management.
Smart Images

Figure CN114139926B_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the field of control science and relates to a scheduling design method for a multi-resource parallel production model. Background Art
[0002] The multi-resource constrained job shop scheduling problem is a classic job shop scheduling problem. In many real production environments, the traditional model mainly considers the occupancy of the machine. The result of the model is the machine's processing tasks in the time dimension and the workpiece's processing procedures in different machines in the time dimension; factors such as personnel occupancy, inventory occupancy, and production tool occupancy are all reflected in the model in the form of constraints. As a result, in a complex production demand environment, the complexity of the model increases sharply, which is not conducive to solving production scheduling management with the help of standardized computer programs and the use of information and automation methods.
[0003] Therefore, the present invention proposes a multi-resource parallel production scheduling model method. Summary of the invention
[0004] The model involved in the present invention abstracts factors such as machines, personnel, inventory space, and production tools into production resources, abstracts and unifies constraints such as process constraints, machine blocking constraints, personnel conflicts, inventory space conflicts, and production tool conflicts involved in the production process, and forms a multi-production resource parallel model, which facilitates the subsequent use of intelligent production scheduling methods for unified processing and provides new ideas for subsequent workshop scheduling problems.
[0005] To solve the above problems, the present invention adopts the following technical solution: a multi-resource parallel production model scheduling method, comprising the following steps:
[0006] Step 1: Determine the production tasks involved in each link process, equipment requirements, processing time, and production resource constraints such as personnel, equipment, tools, auxiliary materials, inventory space, etc. In addition to time, factors such as personnel, equipment, tools, auxiliary materials, and inventory space are called physical resources occupied by production.
[0007] Step 2: Define separate resource state variables for each physical resource that needs to be considered separately in production. Depending on the resource status of "occupied" or "idle" in production, the state variable takes the value of logical "1" or logical "0".
[0008] Step 3: In the spatial dimension, all resource variables are arranged in a fixed order to form the resource phasor of the model. In the time dimension, if the production task of the production scheduling plan is determined in a certain unit time, then the occupation status of all physical resources in the unit time is determined, and the resource phasor value of the unit time is determined.
[0009] Step 4: Define a resource occupancy status matrix for a process. The row phasors of the matrix correspond to the resource phasors per unit time. The number of rows of the matrix is determined by the number of processing unit durations of the process. Each unit duration corresponds sequentially to a row of resource phasors in the matrix. The values of each row of the matrix are determined based on the occupancy status of all physical resources of the process in each time unit.
[0010] Step 5: Represent various constraints between machines, personnel, inventory space, and production tools in the form of a resource matrix.
[0011] Step 6: Perform logical operations on the resource occupancy matrices corresponding to the two processes to determine whether there is a resource conflict between the two processes in the same time period.
[0012] Step 7: Determine the evaluation indicators for scheduling, and use the branch and bound method or heuristic optimization algorithm to obtain the production scheduling plan with the best evaluation indicators.
[0013] Preferably, step 1 specifically includes the following steps:
[0014] The factory uses three machines abc to produce three workpieces J1, J2, and J3. Workpiece J1 includes processes O11 and O12; process O11 is required to be completed before process O12. Workpiece J2 includes processes O21 and O22; process O21 is required to be completed before process O22. Workpiece J3 includes process O31.
[0015] The physical resources required for the production process within the workpiece and the physical resource occupancy matrix generated by each process are as follows: Figure 1 As shown in the figure. The multi-resource parallel production model can describe the physical resources occupied by the production process as a resource occupation matrix containing only "0" and "1". The resource occupation matrix is in rows, and in each row, the column set to "1" means that the machine corresponding to the column needs to participate in the production of the process in this time period.
[0016] As a preferred embodiment, step 2 specifically includes the following steps: each entity resource is arranged in a fixed order. The result of arranging the resource phases is as follows: Figure 2 First line.
[0017] Formulate rules for occupying physical resources. The initial physical resource status is idle. The "idle" status is "0" and the "occupied" status is "1".
[0018] Preferably, step 3 specifically includes the following steps:
[0019] In the spatial dimension, physical resources are arranged in a fixed order, and in the temporal dimension, production tasks are arranged in sequence. While determining the process sequence, the resource occupancy matrix corresponding to each process is arranged in sequence, and finally the resource occupancy matrix assigns a value to the physical resource status. For example, when producing according to processes O11, O12, O21, O22, and O31, the physical resource status is as follows: Figure 2 .
[0020] Preferably, step 5 specifically includes the following steps:
[0021] Step 5.1: The constraints of the multi-resource parallel production model include the front-end constraints and non-blocking constraints of workshop scheduling.
[0022] The before and after constraint formulas of the process are:
[0023] C ik -T ik +M(1-A ihk )≥C ih
[0024] Where i, j = 1, 2, ..., n; k = 1, 2, ..., m; T ik and C ik and respectively represent the processing time and completion time of workpiece i on machine k; M is a large number; A ihk is 1 or 0 (1 when the workpiece processing procedure on machine h is earlier than that on machine k, and 0 otherwise); C ih represents the completion time of job i on machine h.
[0025] The non-blocking constraint formula of the process is:
[0026] C jk -C ik +M(1-X ijk )≥T jk
[0027] Where i, j = 1, 2, ..., n; k = 1, 2, ..., m; T jk and C jk They represent the processing time and completion time of workpiece j on machine k respectively; C ik represents the completion time of workpiece i on machine k; M is a large number; X ijk is 1 or 0 (when i reaches machine k before j, it is 1, otherwise it is 0);
[0028] Step 5.2: The front and back constraints of the multi-resource parallel production model are specifically reflected in the production sequence of the workpiece, which must be arranged in a pre-determined order, otherwise there will be an arrangement error. Figure 3There are 6 ways of arrangement, among which method 1, method 4, and method 5 satisfy the front and back constraints; method 2, method 3, and method 6 do not satisfy the front and back constraints.
[0029] Step 5.3: The non-blocking constraint of the multi-resource parallel production model is specifically embodied as follows: each machine can only process one process at a time. When solving this type of constraint problem, the present invention uses logical operations between model matrices to solve it. For example Figure 4 In the figure, the logical "AND" result of process O11 and process O12 and the logical "AND" result of process O11 and process O21 are all zero matrices, indicating that they meet the non-blocking constraint and can be put into production at the same time. The logical "AND" result of process O11 and process O31 is not all zero, indicating that they do not meet the non-blocking constraint, and putting them into production at the same time will cause resource conflicts.
[0030] Preferably, step 6 specifically includes the following steps:
[0031] Step 6.1, take the physical resources required for the two-step production process to form a resource occupancy matrix for logical operation.
[0032] The resource occupancy matrix refers to the form of expression of the fixed resources required for the production of the process. Figure 2 The resource occupancy matrix generated by process O11 is:
[0033]
[0034] The actual meaning is that the production of process O11 requires the physical resource machine a for 2 time periods.
[0035] Step 6.2, between processes, perform logical operations on the resource occupancy matrix. The same resource can only be occupied by one process, that is, the value of the matrix at this location cannot be 1 at the same time.
[0036] The logical operations between resource occupancy matrices include the logical operations between processes and the logical operations between the weighted matrices and the subsequent processes.
[0037] Among them, the logical operations between processes are mainly divided into four steps:
[0038] The first step is to take the process and process
[0039] The second step is to logically AND the first two lines of process O11 and process O12.
[0040] In the third step, if the result of the logical "AND" is a zero matrix, the two matrices are logically "OR" again. If it is not a zero matrix, then the process O12 is logically "AND" with the 2nd and 3rd rows of matrix a (the newly added row is
[000] ). This is repeated until the result of "with" is a zero matrix, and then logically "OR" is performed again. If the result of the "AND" of the two matrices is zero, there will be no conflict between the processes, so there will be no blockage.
[0041] The fourth step is to take the result of the third step as the weighting matrix. The result of the weighting matrix is The practical meaning is that process O11 and process O12 occupy physical resource 1 and physical resource 2 respectively, and invest 2 units of time in production at the same time, which reduces machine idleness and improves production efficiency.
[0042] As mentioned above, the advantages of the present invention are:
[0043] 1. By analyzing the multi-resource scheduling process in workshop production scheduling, the present invention unifies the models involved in the scheduling process, such as machines, personnel, inventory space, production tools and other factors, into production resources. Based on the above factors, the model abstracts and unifies the constraints involved in the production process, such as process constraints, machine blocking constraints, personnel conflicts, inventory space conflicts, production tool conflicts, etc., to form a multi-production resource parallelization model.
[0044] 2. Through the integration of workshop production scheduling and multi-production resource parallelization models, the limitations of scheduling algorithms can be improved and the impact of business complexity on scheduling software can be reduced to adapt to the problem of rapidly increasing complexity in complex production environments. The application threshold of scheduling software is lowered to facilitate the subsequent use of intelligent scheduling methods for unified processing, which is conducive to the promotion and application of scheduling management systems. BRIEF DESCRIPTION OF THE DRAWINGS
[0045] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0046] Figure 1 A schematic diagram of information of workpieces to be produced and physical resources in a multi-resource parallel production scheduling model method provided by an embodiment of the present invention.
[0047] Figure 2 A schematic diagram of a workshop information resource matrix after being processed by the model of the present invention in a multi-resource parallel production scheduling model method provided by an embodiment of the present invention.
[0048] Figure 3A diagram of the logical operation results of some workshop processes in a multi-resource parallel production scheduling model method provided by an embodiment of the present invention.
[0049] Figure 4 A schematic diagram of the structure of a multi-resource parallel workshop production scheduling model in a multi-resource parallel production scheduling model method provided in an embodiment of the present invention.
[0050] Figure 5 A schematic diagram of a resource occupancy matrix of a multi-resource parallel workshop after being processed by the model in a multi-resource parallel production scheduling model method provided in an embodiment of the present invention.
[0051] Figure 6 A schematic diagram of a new weighted resource occupancy matrix generated by a logical operation between two processes in a multi-resource parallel production scheduling model method provided by an embodiment of the present invention.
[0052] Figure 7 An overall flow chart of a multi-resource parallel production scheduling model method provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0053] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution 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 described embodiments are 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.
[0054] Combine the following Figure 1 and Figure 2 The method for determining the production process and physical resources of the embodiment of the present invention is described, which specifically includes reading the basic information of the workshop's pending processing process and physical resources. The data is determined based on the type and quantity of the workpieces in each order and the physical resources available in the workshop.
[0055] Combine the following Figure 3 The method for converting the obtained workshop information into a workshop scheduling method without forward and backward constraints according to an embodiment of the present invention is described, which specifically includes the following steps:
[0056] Step 1: Physical resources are arranged in a fixed parallel pattern to form a resource vector, and each process forms a resource occupancy matrix.
[0057] Step 2: The processes can be produced in any order without any ordering, provided that there is no conflict in resources. For example: prioritize process O11, process O12, process O21, and then process O22 and process O31. Alternatively, process O11, process O22, process O31 can be produced first, and then process O12 and process O21.
[0058] Combine the following Figure 4 The workshop production scheduling method with process blocking constraints according to an embodiment of the present invention is described, which specifically includes the following steps:
[0059] Step 1: Read the basic information of the workshop's processing procedures and physical resources. Physical resources are arranged in a fixed order to form a resource vector, and each process forms a resource occupancy matrix.
[0060] Step 2: A machine can only process one process at a time, and can only process the next process after the current process is completed. The logical operation between matrices is also reflected in the model. That is, the model of the present invention itself already contains the blocking constraints of the process. For example: process O31 can only be produced after process O21 is completed, or process O31 can be produced first and then process O21. In short, the two cannot occupy machine c in the same time dimension.
[0061] Combine the following Figure 3 and Figure 4 The method for shop scheduling with both front-end and back-end constraints and blocking constraints according to an embodiment of the present invention is described, and specifically includes the following steps:
[0062] Step 1: Figure 1 It can be seen that workpiece 1 includes two processes, process O11 and process O12, and workpiece 2 includes two processes, process O21 and process O22. Among them, process O11 is prior to process O12, and process O21 is prior to process O22. And workpiece 3 includes one process, process O31.
[0063] Step 2: There is no order of precedence between the workpieces. The processes within the workpiece must strictly follow the order of precedence. That is, process O12 must wait until process O11 is completed, and process O22 must wait until process O21 is completed. For example: complete process O11 and process O21 first, then complete process O12 and process O22, and finally process O31.
[0064] Combine the following Figure 5 The multi-resource parallel workshop production scheduling method according to an embodiment of the present invention is described, which specifically includes the following steps:
[0065] Step 1: Read the basic information of the workshop's processing procedures and physical resources. Physical resources are arranged in a fixed order to form a resource vector, and each process forms a resource occupancy matrix.
[0066] Step 2: Figure 4 It can be seen that processes O11, O12, O21, and O22 are all completed by two resources, machines and personnel, in the same time dimension.
[0067] Combine the following Figure 6 The specific process of logical operation between processes in the multi-resource parallel workshop production scheduling method of the embodiment of the present invention is described, specifically including: under the premise of no conflict, process O11 can occupy physical resources in the same time dimension as process O12 and process O21. However, there will be a conflict with process O31 during logical operation.
Claims
1. A multi-resource parallel production model scheduling method, characterized by: It includes the following steps: Step 1: Determine the production process, equipment requirements, processing time, and production resource constraints of personnel, equipment, tools, auxiliary materials, and inventory space involved in the production task; in addition to time, personnel, equipment, tools, auxiliary materials, and inventory space are called physical resources occupied by production; Step 2: Define separate resource status variables for each physical resource that needs to be considered separately in production; the status variables take the value of logic "1" or logic "0" according to the two states of "occupied" or "idle" in production; Step 3: In the spatial dimension, all resource variables are arranged in a fixed order to form the resource phasor of the model; in the time dimension, if the production task of the production scheduling plan is determined in a certain unit time, then the occupation status of all physical resources in the unit time is determined, and the resource phasor value of the unit time is determined; Step 4: Define a resource occupancy state matrix for a process. The row phasor of the matrix corresponds to the resource phasor per unit time. The number of rows of the matrix is determined by the number of processing unit durations of the process. Each unit duration corresponds to a row of resource phasors in the matrix. The values of each row of the matrix are determined according to the occupancy state of all physical resources of the process in each time unit. Step 5: Represent various constraints between machines, personnel, inventory space, and production tools in the form of a resource matrix; Step 6: Perform logical operations on the resource occupancy matrices corresponding to the two processes to determine whether there is a resource conflict between the two processes in the same time period; Step 7: Determine the evaluation index of the scheduling, and use the branch and bound method or heuristic optimization algorithm to obtain the production scheduling plan with the best evaluation index; Step 1 specifically includes the following steps: The factory uses three machines abc to produce three workpieces J1, J2, and J3; workpiece J1 includes processes O11 and O12; process O11 is required to be completed before process O12; workpiece J2 includes processes O21 and O22; process O21 is required to be completed before process O22; workpiece J3 includes process O31; In the physical resources required for the production of the process within the workpiece and the physical resource occupancy matrix generated by each process, the multi-resource parallel production model describes the physical resources occupied by the process production as a resource occupancy matrix containing only "0" and "1"; the resource occupancy matrix is in rows, and in each row, the column set to "1" indicates that the machine corresponding to the column needs to participate in the production of the process in this time period; Step 5 specifically includes the following steps: Step 5.1, the constraints of the multi-resource parallel production model include the front-end constraints and non-blocking constraints of the workshop scheduling; The before and after constraint formulas of the process are: C ik -T ik +M(1-A ihk )≥C ih Where i, j = 1, 2, ..., n; k = 1, 2, ..., m; T ik and C ik and respectively represent the processing time and completion time of workpiece i on machine k; M is a large number; A ihk is 1 or 0. It is 1 when the workpiece processing procedure on machine h is earlier than that on machine k, and 0 otherwise. ih represents the completion time of workpiece i on machine h; The non-blocking constraint formula of the process is: C jk -C ik +M(1-X ijk )≥T jk Where i, j = 1, 2, ..., n; k = 1, 2, ..., m; T jk and C jk They represent the processing time and completion time of workpiece j on machine k respectively; C ik represents the completion time of workpiece i on machine k; M is a large number; X ijk is 1 or 0; Step 5.2: The front and back constraints of the multi-resource parallel production model are specifically reflected in the production sequence of the processes within the workpiece, which must be arranged in a pre-determined order, otherwise there will be an arrangement error; Step 5.3: The non-blocking constraint of the multi-resource parallel production model is specifically reflected as follows: each machine can only process one process at a time; logical operations are performed between model matrices, and the results of the logical "AND" of process O11 and process O12 and the results of the logical "AND" of process O11 and process O21 are all-zero matrices, indicating that they meet the non-blocking constraint and are put into production at the same time; the results of the logical "AND" of process O11 and process O31 are not all zero, indicating that the non-blocking constraint is not met, and putting them into production at the same time will cause resource conflicts; Step 6 specifically includes the following steps: Step 6.1, taking the physical resources required for the two-step production process to form a resource occupancy matrix for logical operation; The resource occupancy matrix refers to the form of expression of the fixed resources required for the production of the process; the resource occupancy matrix generated by process O11 is The actual meaning is that the production of process O11 requires the physical resource machine a for 2 time periods; Step 6.2: Perform logical operations on resource occupancy matrices between processes. The same resource can only be occupied by one process, that is, the value of the matrix at this location cannot be 1 at the same time. The logical operations between resource occupancy matrices include the logical operations between processes and the logical operations between the weighted matrices and the subsequent processes.
2. The multi-resource parallel production model scheduling method according to claim 1, characterized in that: Stage 2 specifically includes the following steps: each entity resource is arranged in a fixed order; Formulate rules for occupying physical resources. The initial physical resource status is idle; the "idle" status is "0" and the "occupied" status is "1".
3. The multi-resource parallel production model scheduling method according to claim 1, characterized in that: Step 3 specifically includes the following steps: In the spatial dimension, physical resources are arranged in a fixed order, and in the temporal dimension, production tasks are arranged in sequence. While determining the sequence of processes, the resource occupancy matrix corresponding to each process is arranged in sequence, and finally the resource occupancy matrix assigns values to the physical resource status.
4. The multi-resource parallel production model scheduling method according to claim 1, characterized in that: The logical operation between processes is divided into four steps: The first step is to take the process and process Step 2: Logically AND the first two lines of process O11 and process O12. In the third step, if the result of the logical "AND" is a zero matrix, the two matrices are logically "OR"ed again. If it is not a zero matrix, the process O12 is logically "AND"ed with the 2nd and 3rd rows of matrix a; until the result of the "AND" is a zero matrix, then the logical "OR" is performed again; if the result of the "AND" of the two matrices is zero, there will be no conflict between the processes, so there will be no congestion; The fourth step is to take the result of the third step as the weighting matrix. The result of the weighting matrix is Process O11 and process O12 occupy physical resource 1 and physical resource 2 respectively, and invest 2 units of time in production at the same time.
