Workshop scheduling method and device for material assembly type production, medium and product

By optimizing order clustering and genetic algorithms for material prefabricated production workshops, the problem of frequent opening and management of material storage units is solved, and efficient and stable production and production efficiency are achieved in the workshop.

CN119045426APending Publication Date: 2024-11-29BEIJING INST OF TECH
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411143596.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-20
Publication Date
2024-11-29

AI Technical Summary

Technical Problem

The existing material prefabricated production workshop scheduling methods cannot formulate a reasonable material storage unit activation strategy, resulting in frequent material storage units opening, confusion in management and extended order flow time.

Method used

By clustering orders, the order clustering results are determined, and the workshop scheduling plan is determined using material allocation algorithms and preset genetic algorithms, including the material storage units and materials required to be opened for each type of order in each material storage unit. placement position.

Benefits of technology

It realizes stable and synchronous production of all factors in the production line and efficient production, avoids frequent replacement of material storage content and confusion in production organization, optimizes production scheduling and production scheduling decisions, and improves production efficiency and organization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119045426A_ABST
    Figure CN119045426A_ABST
Patent Text Reader

Abstract

The invention provides a workshop scheduling method and device for material assembly type production, a medium and a product, and relates to the technical field of communication. The method comprises the following steps: clustering a plurality of orders according to materials required by the orders, and determining an order clustering result; according to the order clustering result, utilizing a material distribution algorithm to determine material attribute information corresponding to each type of orders; the material attribute information comprises a material storage unit required to be opened by each type of orders and a placement position of the material in each material storage unit; and determining a workshop scheduling scheme according to the material attribute information and a preset genetic algorithm. According to the scheme of the invention, a material assembly type production workshop scheduling scheme is provided, so that the total elements of the production line are stable and synchronous, and efficient production is realized.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of workshop manufacturing technology, and in particular to a workshop scheduling method, device, medium and product for material assembly production. Background Art

[0002] "Material assembly production" is a relatively common and distinctive production model. It is not only widely used in the final assembly of products such as automobiles, missiles, and aircraft, but is also often used in the production of industrial products such as worker tool boxes and individual equipment boxes, where the finished products are in boxes and contain multiple sub-materials. Different from ordinary flexible job shop scheduling and job shop scheduling, which is the fundamental scheduling goal of sorting processes or selecting machines for processes, in the "material assembly production" model, all orders enter the production line in sequence along the conveyor belt or in other ways. Material storage units are arranged around both sides of the production line, which can store materials of different types or different models of the same type. When the order flows to the material storage unit, the materials in the material storage unit are used to assemble or pack the order, and finally form a finished product.

[0003] Based on the above description, two common "material assembly production" workshops are listed: (1) In automobile production, the order is the automobile body frame, which enters the production line along the conveyor belt. The material storage units around the production line can be used to store materials such as automobile wing doors and engine hoods of different styles. When the automobile body frame arrives at the corresponding material storage unit, the workers will use the corresponding materials to assemble the automobile body frame. (2) In the production of individual equipment boxes, the order is a box containing all the equipment used by soldiers in combat. The equipment box enters the production line along the conveyor belt. The material storage units around the production line are used to store clothes of different types and sizes, combat communication tools with different functions, and other materials. When the equipment box arrives at the corresponding material storage unit, the workers will put the specified materials into the equipment box. The scheduling scheme of "material assembly production" in the existing technology is mostly carried out manually, and it is impossible to formulate a reasonable material storage unit activation strategy. There will be problems such as frequent opening of material storage units, chaotic management, and greatly extended order flow time. Summary of the invention

[0004] The purpose of this application is to provide a workshop scheduling method, device, medium and product for material assembly production, so as to solve the problems in the prior art of material assembly production, such as the inability to formulate a reasonable material storage unit activation strategy, frequent opening of material storage units, chaotic management, and greatly extended order flow time.

[0005] To achieve the above-mentioned purpose, an embodiment of the present application provides a workshop scheduling method for material assembly production, comprising:

[0006] Cluster multiple orders according to the required materials of the orders and determine the order clustering results;

[0007] According to the order clustering results, the material attribute information corresponding to each type of order is determined by using a material allocation algorithm; the material attribute information includes the material storage unit that needs to be opened for each type of order and the placement position of the material in each of the material storage units;

[0008] A workshop scheduling plan is determined according to the material attribute information and a preset genetic algorithm.

[0009] Optionally, multiple orders are clustered according to the required materials of the orders to determine order clustering results, including:

[0010] According to the types of materials required for the order, the order is encoded and an order material matrix is ​​established;

[0011] Determine a clustering feature tree according to the order material matrix and a preset clustering algorithm; the order material data corresponding to all clustering feature nodes in the last leaf node of the clustering feature tree are of the same category;

[0012] According to the clustering feature tree, the order clustering result is determined.

[0013] Optionally, determining a clustering feature tree according to the order material matrix and a preset clustering algorithm includes:

[0014] Initialize clustering parameters; the clustering parameters include: the branch balance factor of the internal nodes of the clustering feature tree, the leaf balance factor of each leaf node and the sample radius threshold of each leaf node;

[0015] Determine whether all data points in the order material matrix have been read;

[0016] If all data points have not been read, determining clustering feature values ​​of the data points according to the data points and the preset clustering algorithm;

[0017] If all data points have been read, the cluster feature tree is determined based on all the cluster feature values.

[0018] Optionally, if all data points have not been read, determining the clustering feature values ​​of the data points according to the data points and the preset clustering algorithm includes:

[0019] Determine the total number of all data points in the order material matrix, the sum vector of the feature dimensions corresponding to the data points, and the sum of the squares of all feature dimensions;

[0020] According to the total number of all data points, the sum vector and the square sum, the clustering feature value of the data point is determined using the preset clustering algorithm.

[0021] Optionally, after determining the clustering feature values ​​of the data points, the method further includes:

[0022] When a new data point is read, the clustering feature value of the leaf node closest to the new data point is searched downward from the root node; the root node is the clustering feature value initially calculated when reading the data point;

[0023] Calculating a current radius threshold after adding the new data point, and determining whether the current radius threshold is greater than the sample radius threshold;

[0024] In the case where the current radius threshold is less than or equal to the sample radius threshold, all clustering feature values ​​are updated, and a step of determining whether all data points in the order material matrix have been read is performed;

[0025] When the current radius threshold is greater than the sample radius threshold, split the current leaf node; the splitting of the current leaf node includes: selecting the two farthest nodes in the old leaf nodes as new leaf nodes, and putting the data of the new data point into all nodes according to the principle of closest distance;

[0026] Determine whether the data of the clustering feature value contained in the parent node of the current leaf node is greater than the branch balance factor;

[0027] If it is greater than the branch balance factor, the step of splitting the current leaf node is re-executed; if it is less than or equal to the branch balance factor, the step of determining whether all data points in the order material matrix have been read is executed.

[0028] Optionally, according to the order clustering result, a material allocation algorithm is used to determine the material attribute information corresponding to each type of order, including:

[0029] According to the order clustering results, a one-way linked list of material order corresponding to each type of the order is established;

[0030] According to the order of the material storage units that the order passes through on the production line, a unit list of the material storage unit is established, and according to the material types that the material storage unit can store, a material type unidirectional linked list composed of the material types that can be stored by each material storage unit in the unit list of the material storage unit is established;

[0031] According to the material sequence one-way linked list, the unit list one-way linked list and the material type one-way linked list are searched to obtain the start sequence of the material storage unit of each type of the order;

[0032] determining whether all orders establish the startup sequence;

[0033] If the activation sequence is not established for all orders, re-execute the step of obtaining the activation sequence of the material storage unit of each type of the order;

[0034] If the start sequence is not established for all orders, then a process time sequence for each order is created according to the start sequence and the one-way linked list of material types;

[0035] The material attribute information corresponding to each type of order is determined according to the material sequence one-way linked list and the largest material stored in the material storage unit.

[0036] Optionally, determining a workshop scheduling plan according to the material attribute information and a preset genetic algorithm includes:

[0037] Initialize the population according to the material attribute information and the preset genetic algorithm, and mark the position of the gene according to the order category;

[0038] Calculating a fitness function, normalizing the fitness function, and performing roulette wheel selection;

[0039] If the maximum number of iterations is not reached, dye crossover and gene sequence adjustment are performed according to the position markers, and the step of calculating the fitness function is re-executed;

[0040] When the maximum number of iterations is reached, the optimal individual is selected to be determined as the workshop scheduling plan, and the workshop scheduling plan includes an activation plan of the material storage unit and a sequence of material types that can be stored in the material storage unit.

[0041] To achieve the above-mentioned purpose, an embodiment of the present application provides a workshop scheduling device for material assembly production, comprising:

[0042] The first determination module is used to cluster multiple orders according to the required materials of the orders and determine the order clustering results;

[0043] A second determination module is used to determine the material attribute information corresponding to each type of order based on the order clustering result and using a material allocation algorithm; the material attribute information includes the material storage unit that needs to be opened for each type of order and the placement position of the material in each of the material storage units;

[0044] The third determination module is used to determine a workshop scheduling plan according to the material attribute information and a preset genetic algorithm.

[0045] To achieve the above objectives, an embodiment of the present application provides a readable storage medium on which a program or instruction is stored. When the program or instruction is executed by a processor, the steps in the scheduling method described above are implemented.

[0046] To achieve the above objective, an embodiment of the present application provides a computer program product, including computer instructions, which implement the steps of the above method when executed by a processor.

[0047] The beneficial effects of the above technical solution of the present application are as follows:

[0048] In an embodiment of the present application, the method includes: clustering multiple orders according to the required materials of the orders to determine the order clustering results; determining the material attribute information corresponding to each type of order using a material allocation algorithm based on the order clustering results; the material attribute information includes the material storage units that need to be opened for each type of order and the placement position of the materials in each material storage unit; determining the workshop scheduling plan based on the material attribute information and a preset genetic algorithm. The present application provides a workshop scheduling plan for material assembly production, which can make all elements of the production line stable, synchronous and efficient. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Figure 1 A flow chart of a workshop scheduling method for material assembly production provided in an embodiment of the present application;

[0050] Figure 2 A schematic diagram of the process of the order clustering algorithm provided in the embodiment of the present application;

[0051] Figure 3 A schematic diagram of the process of material storage unit activation and material allocation algorithm provided in an embodiment of the present application;

[0052] Figure 4 A schematic diagram of an improved genetic algorithm flow chart provided in an embodiment of the present application;

[0053] Figure 5 An example diagram of the crossover and internal gene order adjustment operation of the improved genetic algorithm provided in the embodiment of the present application;

[0054] Figure 6 A structural diagram of a workshop scheduling device for material assembly production provided in an embodiment of the present application. DETAILED DESCRIPTION

[0055] In order to make the technical problems, technical solutions and advantages to be solved by the present application clearer, a detailed description will be given below with reference to the accompanying drawings and specific embodiments.

[0056] It should be understood that the references to "one embodiment" or "an embodiment" throughout the specification mean that the specific features, structures, or characteristics associated with the embodiment are included in at least one embodiment of the present application. Therefore, the references to "in one embodiment" or "in an embodiment" appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0057] In the embodiments of the present application, the term "and / or" describes the association relationship of the associated objects, indicating that three relationships may exist. For example, A and / or B may represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the associated objects before and after are in an "or" relationship.

[0058] In the embodiments of the present application, the term "plurality" refers to two or more than two, and other quantifiers are similar.

[0059] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0060] The embodiments of the present application provide a workshop scheduling method, device, medium and product for material assembly production. The method and device are based on the same application concept. Since the principles of solving problems by the method and device are similar, the implementation of the device and method can refer to each other, and the repeated parts will not be repeated.

[0061] It should be known that "material assembly production" is widely used in the manufacturing field, so it is of great significance to propose a systematic scheduling plan based on the characteristics of its production model.

[0062] Reference Figure 1 As shown, the embodiment of the present application provides a workshop scheduling method for material assembly production, including:

[0063] Step 11, clustering multiple orders according to the required materials of the orders, and determining the order clustering results;

[0064] Step 12, according to the order clustering result, using the material allocation algorithm, determine the material attribute information corresponding to each type of order; the material attribute information includes the material storage unit that needs to be opened for each type of order and the placement position of the material in each of the material storage units;

[0065] Step 13: Determine a workshop scheduling plan based on the material attribute information and a preset genetic algorithm.

[0066] In the embodiment of the present application, facing the material assembly workshop production mode, firstly, the materials required for the order are obtained, and the clustering algorithm is executed to cluster multiple orders, and the workshop production orders are classified according to the materials they need, and the order clustering results are determined; based on the order clustering results, the material attribute information corresponding to each type of order is determined through the material storage unit activation and material allocation algorithm, that is, the material storage unit opened for each type of order and the storage location of the material in each storage unit are determined; finally, the improved genetic algorithm based on order clustering is used to obtain the final workshop scheduling plan.

[0067] This application solves the classification problem of a large number of orders in a material assembly production workshop through a complete set of algorithms, avoiding frequent switching of production lines under different production conditions; realizes the generation of scheduling plans based on order classification results, and optimizes the scheduling plans with the goal of minimizing maximum delay; finally, the material storage unit activation plan and the material arrangement plan in the storage unit are linked and generated according to the scheduling plan, so as to achieve the goal of stable, synchronous and efficient production of all elements of the production line.

[0068] The workshop scheduling method of "material assembly production" proposed in this application can solve the following key problems:

[0069] (1) It can solve the problem of frequent changes in the storage content of the material storage unit of the production line. Through the clustering algorithm, orders using the same or similar materials are classified and placed together, which can achieve the least possible change in the overall storage mode of the material storage unit, thereby avoiding wasting production time on switching the production line layout.

[0070] (2) It can solve the scheduling and production scheduling problems of "material assembly production". Based on the order clustering results, the improved genetic algorithm can be used to generate a scheduling plan with the maximum delay as the scheduling goal, realizing the centralized scheduling of the same type of production orders and the scheduling optimization decision between different types of orders. Starting from the production factors, the entire production process is gradually coordinated, avoiding many drawbacks such as chaotic production organization, and meeting the production delivery time as much as possible, improving production efficiency and production organization.

[0071] (3) It can solve the problems of material storage unit activation and material placement and arrangement in multiple material storage units. In actual production, not all material storage units need to be used for each production. If a reasonable material storage unit activation strategy cannot be formulated, it will cause problems such as frequent activation of material storage units, chaotic management, and greatly extended order turnover time. In addition, there are many types of materials involved in production, and how to layout and configure them on the opened material storage units is also urgent to consider. Therefore, a material storage unit activation and material allocation algorithm is designed. On the basis of determining the order production sequence, the material unit activation plan and the arrangement of materials in the material storage unit are accurately determined according to the principle of the minimum number of opened material storage units and the order of material placement according to the order category.

[0072] Optionally, step 11 of the present application includes:

[0073] According to the types of materials required for the order, the order is encoded and an order material matrix is ​​established;

[0074] Determine a clustering feature tree according to the order material matrix and a preset clustering algorithm; the order material data corresponding to all clustering feature nodes in the last leaf node of the clustering feature tree are of the same category;

[0075] According to the clustering feature tree, the order clustering result is determined.

[0076] In this application, the mathematical model of material assembly production can be expressed as follows: the entire production process uses a total of g different types and models of materials M ij , where i = 1, 2, .., n, j = 1, 2, .., m, n represents the type of material, m represents the model of the material; the type and model of the material have been determined before production, and g = m + n. In production, the number of p orders put into production each time is recorded as O k , where k = 1, 2, .., p, production order O k The required material sequence is denoted as M Ok . Material storage units are arranged around the production line x α (α=1,2,..,y), each material storage unit can store b xα . b xα Different types or different models of materials of the same type, and each material can be stored xα indivual.

[0077] In the embodiment of the present application, based on the above mathematical model, a clustering algorithm is executed according to the existing production orders to classify the orders according to the materials required for their production. Specifically, the orders are encoded according to the types of materials required by the orders, and the order material matrix μ is established. OFor each order O k Initialize a g*1 zero vector Then for each order O k In the same order, start from the first material M ij (i=1,j=1) Start searching all materials g times. If the Gth V (0<v<g, v∈Z, Z is the set of integers, which makes v not a decimal) order O is found in the search process k If this material is needed, the Gth V After changing the zero vectors of all orders to 1, we can combine them to get the order material matrix μ O , a possible order material matrix μ O An example is:

[0078]

[0079] Furthermore, the order material matrix μ O As sample data, the preset clustering algorithm can be selected as the Birch clustering algorithm (using the balanced iterative reduction and clustering of the hierarchical method), and a clustering feature (CF) tree is constructed. The CF tree is a data structure used to represent and store data clustering features. The clustering feature tree is used to classify orders containing similar materials and uniformly schedule production to determine the order clustering results.

[0080] Optionally, determining a clustering feature tree according to the order material matrix and a preset clustering algorithm includes:

[0081] Initialize clustering parameters; the clustering parameters include: the branch balance factor of the internal nodes of the clustering feature tree, the leaf balance factor of each leaf node and the sample radius threshold of each leaf node;

[0082] Determine whether all data points in the order material matrix have been read;

[0083] If all data points have not been read, determining clustering feature values ​​of the data points according to the data points and the preset clustering algorithm;

[0084] If all data points have been read, the cluster feature tree is determined based on all the cluster feature values.

[0085] In the embodiment of the present application, the clustering parameters are initialized; the maximum branch balance factor B of the internal nodes of the CF tree, the maximum leaf balance factor F of each leaf node and the maximum sample radius threshold R of each node CF are defined. Since the order scale in "material assembly production" is generally large, according to the algorithm execution process, the reference values ​​of various parameters are obtained according to the order scale from small to large, where the value range of B is 10-15, L is an integer multiple of 10, and R is 5-10. Each parameter can also be adaptively adjusted according to the actual situation.

[0086] Further, it is determined whether all data points in the order material matrix have been read. If all data points have not been read, the process of establishing the CF tree is stopped according to the data points and the preset. If all data points in the order material matrix have been read, the order material data corresponding to all CF nodes in the final leaf node of the CF tree are of the same type. If all data points have not been read, the clustering characteristic value (CF value) of the data point is determined according to the data points and the preset clustering algorithm. Each CF value represents a node, and the CF value calculated initially is the root node. If it has not been taken out, the order material data point is read from the order material matrix, and its CF value is calculated until each CF value corresponding to all data points is determined.

[0087] Specifically, if all data points are not completely read, determining the clustering feature values ​​of the data points according to the data points and the preset clustering algorithm includes:

[0088] Determine the total number of all data points in the order material matrix, the sum vector of the feature dimensions corresponding to the data points, and the sum of the squares of all feature dimensions;

[0089] According to the total number of all data points, the sum vector and the square sum, the clustering feature value of the data point is determined using the preset clustering algorithm.

[0090] In the embodiment of the present application, this step is the process of reading each data point to determine the corresponding CF value. Here, the process of calculating the CF value is represented by the following formula (1):

[0091]

[0092] Each CF value represents a node, and the initially calculated CF value is the root node. N represents the total number of order material data points that are continuously read in; Represents the sum vector of each feature dimension of the order material data point in the CF tree; TT represents the sum of the squares of all feature dimensions of the material order data point.

[0093] Optionally, after determining the clustering feature values ​​of the data points, the method further includes:

[0094] When a new data point is read, the clustering feature value of the leaf node closest to the new data point is searched downward from the root node; the root node is the clustering feature value initially calculated when reading the data point;

[0095] Calculating a current radius threshold after adding the new data point, and determining whether the current radius threshold is greater than the sample radius threshold;

[0096] In the case where the current radius threshold is less than or equal to the sample radius threshold, all clustering feature values ​​are updated, and a step of determining whether all data points in the order material matrix have been read is performed;

[0097] When the current radius threshold is greater than the sample radius threshold, split the current leaf node; the splitting of the current leaf node includes: selecting the two farthest nodes in the old leaf nodes as new leaf nodes, and putting the data of the new data point into all nodes according to the principle of closest distance;

[0098] Determine whether the data of the clustering feature value contained in the parent node of the current leaf node is greater than the branch balance factor;

[0099] If it is greater than the branch balance factor, the step of splitting the current leaf node is re-executed; if it is less than or equal to the branch balance factor, the step of determining whether all data points in the order material matrix have been read is executed.

[0100] In the embodiment of the present application, a CF value is calculated each time a data point is read. When reading a new data point, the clustering feature value of the leaf node closest to the new data point is searched downward from the root node; since the previous CF value may be updated each time a new data point is read, the present application uses the clustering feature value initially calculated when reading the data point as the root node. That is, continue to read in new data points of the order material, and use the following distance expression between the two CF values ​​to search downward from the root node for the CF value of the leaf node closest to the input order material data point. Among them, the calculated distance can be calculated using formula (2):

[0101]

[0102] Wherein, D represents the distance between two CF values; if the two CF values ​​are the first CF value and the second CF value, then N1 represents the total number of order material data points after the first CF value is read in, and N2 represents the total number of order material data points after the second CF value is read in; TT1 represents the sum of squares of all feature dimensions of the material order data points after the first CF value is read in, and TT2 represents the sum of squares of all feature dimensions of the material order data points after the second CF value is read in; It represents the sum vector of each feature dimension of the order material data point in the CF tree after the first CF value is read in. Represents the sum vector of each feature dimension of the order material data point in the CF tree after the second CF value is read in.

[0103] Furthermore, after adding the new data point of the order material to the CF value closest to it, the CF value is updated, and the current radius threshold after adding the new data point is calculated, that is, according to the following formula (3), the current radius threshold R' is calculated to be less than or equal to the set sample radius threshold R. If R' is less than R, all CF values ​​are updated upward from this CF value, and then the step of "determining whether all data points in the order material matrix have been read" is executed. Otherwise, when the current radius threshold is greater than the sample radius threshold, it is determined whether the number of CF nodes of the current leaf node is less than the leaf balance factor F.

[0104]

[0105] If it is determined that the number of CF nodes of the current leaf node is less than the leaf balance factor F, a new CF node is created under the current leaf node, the new order material data is placed in it, and all CF values ​​on the path are updated; otherwise, the current leaf node is split.

[0106] Optionally, split the current leaf node, including:

[0107] Split the current leaf node, solve the mutual distance of all CF tuples in the old leaf node, and select the two CF tuples with the farthest distance, and use the two CF tuples as the first CF nodes of the two new leaf nodes respectively. Then put the new order material data together with other tuples into the leaf node closest to itself, and check whether the parent node needs to be split step by step. If it is found that the number of CF values ​​contained in the parent node exceeds the branch balance factor B, then it needs to be split, and the same splitting process as the child node is performed. If it does not exceed, execute the step of "determining whether all data points in the order material matrix have been read".

[0108] Reference Figure 2In a specific embodiment shown, step 11 of the present application is specifically as follows: encode the order, establish a material matrix (i.e., order material matrix), initialize clustering parameters, and determine the branch balance factor B, leaf balance factor F, and sample radius threshold R in the CF tree. Determine whether all sample points in the order material matrix have been read. If they have been read, build a CF tree based on the CF values ​​corresponding to all data points. If not all data points have been read, the CF value of the current new data point is calculated each time a new data point is read, and the distance between the CF values ​​is calculated to find the CF value of the leaf node closest to the new sample from the root node downward, and the current sample radius threshold is calculated after adding the new sample, that is, the current sample threshold is calculated, and the current sample threshold is compared with the set sample radius threshold. If the current sample threshold is greater than the set value (the set sample radius threshold), a splitting step is performed, otherwise, all CF values ​​are updated. When performing the splitting step, split the original leaf node, select the two farthest nodes in the old leaf node as the new leaf node, and put all the nodes back into it according to the principle of closest distance; determine whether the number of CF values ​​contained in the parent node exceeds the set value. If so, return to the previous splitting step. If not, re-execute the step of determining whether the sample points have been read.

[0109] Optionally, step 12 of the present application includes:

[0110] According to the order clustering results, a one-way linked list of material order corresponding to each type of the order is established;

[0111] According to the order of the material storage units that the order passes through on the production line, a unit list of the material storage unit is established, and according to the material types that the material storage unit can store, a material type unidirectional linked list composed of the material types that can be stored by each material storage unit in the unit list of the material storage unit is established;

[0112] According to the material sequence one-way linked list, the unit list one-way linked list and the material type one-way linked list are searched to obtain the start sequence of the material storage unit of each type of the order;

[0113] determining whether all orders establish the startup sequence;

[0114] If the activation sequence is not established for all orders, re-execute the step of obtaining the activation sequence of the material storage unit of each type of the order;

[0115] If the start sequence is not established for all orders, then a process time sequence for each order is created according to the start sequence and the one-way linked list of material types;

[0116] The material attribute information corresponding to each type of order is determined according to the material sequence one-way linked list and the maximum material stored in the material storage unit. Here, the material attribute information includes the material storage unit to be opened for each type of order and the placement position of the material in each material storage unit.

[0117] In the embodiment of the present application, according to the order clustering results, the material storage unit activation and material allocation algorithm is executed to determine the material storage unit activated for each type of order and the storage location of the material in each storage unit. This step includes: according to the order clustering results, the orders are divided into d categories, and KI h ,h=1,2,…,d represents the total number of material types (different types or different models of the same type) in each type of order, and is included in the material type number sequence {KI1,KI2,…,KI d All types of materials involved in each type of order are sorted according to the order of their needs (determined according to the specific production situation, which may be the assembly order of materials on the order, the stacking order of materials in the container, etc.), and a one-way linked list of the material order corresponding to each type of order is obtained. d (M ij )={M 12 →M 22 →M 32 →M 54} represents a possible one-way linked list of material sequence corresponding to a certain type of order during the execution of the algorithm.

[0118] Starting from the first material storage unit on the production line where the order first passes, a one-way linked list of material storage units and a one-way linked list of material types in the entire production line are gradually established. The one-way linked list can only point from the material storage unit at the front of the production line to the material storage unit at the back. A possible one-way linked list of material storage units is {x1→x2→…→x y}, where x α (α=1,2,..,y) represents the name of the material storage unit. A possible one-way linked list of material types of material storage units is: in Represents material storage unit x α The types of materials that can be stored, and With x α It is a one-to-one relationship.

[0119] According to the material type sequence determined above, the two generated material storage unit one-way linked lists are searched to determine the activation status of the material storage unit for each type of order. hThen, a sequential search is performed from the material storage unit list to the first element in the linked list. At the same time, the corresponding one-way linked list of material storage unit material types is also taken according to the storage unit name. Value, if the condition is met Continue searching. If not satisfied, stop searching and create a material storage unit activation sequence corresponding to the material type sequence. Add all material storage unit names from the search start point to the search end point. Continue to read KI from the material type sequence h , and start searching from the end point of the last search. If the search reaches the last unit name in the linked list of the material storage unit list, the condition is still met. Then read in the new KI h Re-search until all KI h Search completed. If none of the conditions are met Then re-take the KI of any material storage unit activation sequence that has not been established from the material type sequence h , discard the existing search point and start searching from the first search point in the one-way linked list of the material storage unit. Repeat the above process until all KI h Each has its corresponding material storage unit activation sequence

[0120] For each order in each type of order, an order process time sequence is created, which consists of material acquisition time, flow time and additional time. K , the entire material assembly production can be regarded as having only one complete process. The total process time of each order can be calculated by the following expression. The total process time of all orders can be combined to obtain the order process time series. The order process time series can be expressed by the following formula (4):

[0121]

[0122] In formula (4), Indicates the total time to assemble all materials for an order, NU ij For each material M ij The number of pieces used, i, j, should be less than the total number of material types KI in the category of the order h , is the average time required to assemble a piece of material, Represents the total time that an order flows through the production line. is the total number of material storage units that the order has passed through, which is calculated from the list of material storage units determined above to the linked list. is the average time for an order to flow through a single material storage unit, Tε For additional time, a certain amount of flexible time is reserved for additional activities such as worker operation and machine equipment handling. If there is no additional activity, T ε Can be 0.

[0123] Calculate the material arrangement in each material storage unit for each order classification. First, create an empty linked list of storable material types for each material storage unit in the production line {x1→{},x2→{},...,x y →{}}. Then read the material sequence one-way linked list O of each type of order d (M ij ) and sequentially take out elements from it for accumulation. Each time the accumulation is done, the list of material storage units is read and the material storage unit name x in the linked list is added. a And take out the corresponding material type from the one-way linked list of the material storage unit If the judgment expression is satisfied Then add this type of material to the storable material type list of the material storage unit. If it is not satisfied, continue to read the material storage unit list to the next material storage unit name in the list, and repeat the above process until the O of each type of order is satisfied. d (M ij ) are searched. In the judgment expression, for each order, each containing an M ij , Both represent adding the integer 1 once.

[0124] exist Figure 3 In the specific embodiment shown, the above-mentioned step 12 can be specifically as follows: obtain material clustering results, establish a one-way linked list of material sequence corresponding to each order based on the material clustering results, and establish a one-way linked list of material storage units and a one-way linked list of material types that can be stored in the material storage unit.

[0125] According to the one-way linked list of material sequence, search the one-way linked list of material storage units and the one-way linked list of material types that can be stored in the material storage unit to obtain the material storage unit startup sequence of each type of order; determine whether the clustered orders have established a material storage unit startup sequence. If not, re-execute the step of "obtaining the material storage unit startup sequence of each type of order". If so, create a process time sequence for each order based on the material storage unit startup sequence of each type of order and the total number of material types used in the order. Create a linked list of material types that can be stored in each material storage unit based on the one-way linked list of the material sequence of the order and the maximum number of materials stored in the material storage unit.

[0126] Optionally, step 13 of the present application includes:

[0127] Initialize the population according to the material attribute information and the preset genetic algorithm, and mark the position of the gene according to the order category;

[0128] Calculating a fitness function, normalizing the fitness function, and performing roulette wheel selection;

[0129] If the maximum number of iterations is not reached, dye crossover and gene sequence adjustment are performed according to the position markers, and the step of calculating the fitness function is re-executed;

[0130] When the maximum number of iterations is reached, the optimal individual is selected to be determined as the workshop scheduling plan, and the workshop scheduling plan includes an activation plan of the material storage unit and a sequence of material types that can be stored in the material storage unit.

[0131] In an embodiment of the present application, a preset genetic algorithm based on order classification is used, that is, the improved genetic algorithm of the present application is used to obtain the final workshop scheduling plan. In step 12, the material storage units opened for the production of different orders have been determined, because the last step of scheduling is to determine the production order of the orders on the production line. First, determine the encoding method. In the improved genetic algorithm of the present application, each chromosome represents a production arrangement order that includes all orders. Therefore, the gene on the chromosome is the order number, and the order of arrangement of the gene is the order in which the order is produced. When encoding, it is necessary to use the order category KI calculated by the clustering algorithm. h , so that all orders contained in each type of order are arranged together to form a gene segment, and each type of order is assigned a gene position code denoted as In all subsequent chromosomes, the gene position codes for this order remain the same.

[0132] Furthermore, the population is initialized according to the encoding method. After initialization, the fitness function is calculated. The fitness function can be calculated using the following formula (5):

[0133]

[0134] in, For order delivery date, The start time of the order. is the processing time of the order on the production line, which has been calculated by the above steps.

[0135] This application uses a roulette wheel method for selection, and the selection probability is the fitness value P(i) of each chromosome. Since the fitness may be negative, the fitness value needs to be normalized according to the following formula (6) before selection.

[0136]

[0137] Among them, f i is the fitness value of the i-th chromosome, f min is the minimum fitness value in the chromosome, and NT is the total number of chromosomes.

[0138] In this application, it is determined whether the genetic algorithm has reached the maximum number of iterations. If it is satisfied, the algorithm is terminated, the chromosome of the optimal fitness function is found, and the workshop scheduling plan is obtained. The material arrangement and material storage unit activation plan of the workshop reads the material storage unit activation sequence in the above steps according to the final order arrangement order The material storage unit in the above steps may store a material type list.

[0139] If not, then perform chromosome crossover. By setting a certain crossover probability, select the chromosomes that need to be crossover from the initialized population, use the OX operator to perform crossover, and generate offspring chromosomes. When performing crossover operations, a single gene cannot be used as a benchmark, but the gene position is accurately identified in each operation, and the selection is made. and (1≤l<b) is used as the starting point and the ending point of the crossover operator.

[0140] Next, adjust the gene order within the chromosome. Set the order adjustment probability α (0 < α < 1) and traverse all positions of each newly generated offspring chromosome. Generate a random number between 0 and 1, if it is greater than the order adjustment probability, then the position Randomly sort all genes in the . Re-execute the step of calculating the fitness function.

[0141] Reference Figure 4 In the specific embodiment shown, after the population is initialized, the position of the gene is marked according to the order category, and then the fitness function is calculated, and then the fitness function is normalized, and a roulette wheel selection is performed to determine whether the maximum number of iterations has been reached. The maximum number of iterations is configured or pre-configured. If it is determined that the maximum number of iterations has been reached, the optimal individual is selected as the workshop scheduling plan, and the workshop scheduling plan includes the activation plan of the material storage unit and the material type sequence that can be stored in the material storage unit. If the maximum number of iterations has not been reached, dye crossover is performed according to the position mark, and the gene order is adjusted according to the position mark, and after the adjustment, the step of calculating the fitness function is re-executed.

[0142] Below through Figure 5 Explain population initialization, chromosome crossover and gene order adjustment:

[0143] As attached Figure 5As shown, parent 1 and parent 2 can be considered as the results of population initialization, where each gene segment corresponds to a type of order, and each gene segment has a unique position marker. For example, in order cluster 1, there are orders O1, O2, and O3, and their positions in the chromosome are recorded as By observing parent 2, we can find that all orders in order cluster 1 are still arranged together as adjacent gene fragments, and their positions in the chromosome are still

[0144] exist Figure 5 In the crossover process shown, the OX operator crossover process is performed by parent 1 and parent 2 to generate offspring 1 and offspring 2. Different from the traditional genetic algorithm that performs the OX operator, taking the generation of offspring 1 from parent 1 and parent 2 as an example, the crossover point position is first determined on parent 1 by the gene position code. Then keep it in offspring 1, and then find the gene position code from parent 2 The gene segments of parent 2 except the above gene segments are sequentially placed in the positions where the gene segments of offspring 1 are missing to form a complete offspring 1. Offspring 2 is formed by retaining some gene segments of parent 2 and adding some gene segments of parent 1.

[0145] like Figure 5 As shown, each gene position code in offspring 1 and offspring 2 is traversed respectively, and the Position and child 2 When the random number at the position is greater than the probability of order adjustment, the gene order in the gene segment is adjusted, and the O4, O5, O6 and O7, O8, O9 of the offspring 1 are adjusted to O5, O4, O6 and O7, O9, O8, and the O 10 , O 11 With O 14 , O 15 Replace with O 11 , O 10 With O 15 , O 14 .

[0146] In summary, the workshop scheduling method of "material assembly production" of this application can solve the following key problems:

[0147] (1) It can solve the problem of frequent changes in the storage content of the material storage unit of the production line. Through the clustering algorithm, orders using the same or similar materials are classified and placed together, which can achieve the least possible change in the overall storage mode of the material storage unit, thereby avoiding wasting production time on switching the production line layout.

[0148] (2) It can solve the scheduling and production scheduling problems of "material assembly production". Based on the order clustering results, the improved genetic algorithm can be used to generate a scheduling plan with the maximum delay as the scheduling goal, realizing the centralized scheduling of the same type of production orders and the scheduling optimization decision between different types of orders. Starting from the production factors, the entire production process is coordinated, avoiding many drawbacks such as chaotic production organization, and meeting the production delivery date as much as possible, improving production efficiency and production organization.

[0149] (3) It can solve the problems of material storage unit activation and material placement and arrangement in multiple material storage units. In actual production, not all material storage units need to be used for each production. If a reasonable material storage unit activation strategy cannot be formulated, it will cause problems such as frequent activation of material storage units, chaotic management, and greatly extended order turnover time. In addition, there are many types of materials involved in production, and how to layout and configure them on the opened material storage units is also urgent to consider. Therefore, a material storage unit activation and material allocation algorithm is designed. On the basis of determining the order production sequence, the material unit activation plan and the arrangement of materials in the material storage unit are accurately determined according to the principle of the minimum number of opened material storage units and the order of material placement according to the order category.

[0150] Reference Figure 6 As shown, the embodiment of the present application provides a workshop scheduling device for material assembly production, including:

[0151] A first determination module 61 is used to cluster multiple orders according to the required materials of the orders and determine the order clustering results;

[0152] A second determination module 62 is used to determine the material attribute information corresponding to each type of order based on the order clustering result and using a material allocation algorithm; the material attribute information includes the material storage unit that needs to be opened for each type of order and the placement position of the material in each of the material storage units;

[0153] The third determination module 63 is used to determine a workshop scheduling plan according to the material attribute information and a preset genetic algorithm.

[0154] Optionally, in the present application, the first determining module 61 includes:

[0155] The first establishment submodule is used to encode the order according to the type of materials required by the order and establish an order material matrix;

[0156] A first determination submodule is used to determine a clustering feature tree according to the order material matrix and a preset clustering algorithm; the order material data corresponding to all clustering feature nodes in the last leaf node of the clustering feature tree are of the same category;

[0157] The second determination submodule is used to determine the order clustering result according to the clustering feature tree.

[0158] Optionally, in the present application, the first determining submodule includes:

[0159] A first processing unit is used to initialize clustering parameters; the clustering parameters include: a branch balance factor of an internal node of the clustering feature tree, a leaf balance factor of each leaf node, and a sample radius threshold of each leaf node;

[0160] A first determination unit, used to determine whether all data points in the order material matrix have been read;

[0161] A second determination unit, configured to determine clustering feature values ​​of the data points according to the data points and the preset clustering algorithm if reading of all data points is not completed;

[0162] The third determining unit is used to determine the clustering feature tree according to all the clustering feature values ​​if all the data points have been read.

[0163] In the present application, the second determining unit is specifically used for:

[0164] Determine the total number of all data points in the order material matrix, the sum vector of the feature dimensions corresponding to the data points, and the sum of the squares of all feature dimensions;

[0165] According to the total number of all data points, the sum vector and the square sum, the clustering feature value of the data point is determined using the preset clustering algorithm.

[0166] In the present application, after determining the clustering feature value of the data point, the device further includes:

[0167] The first processing module is used to search for the clustering feature value of the leaf node closest to the new data point from the root node downward when reading a new data point; the root node is the clustering feature value initially calculated when reading the data point;

[0168] A second processing module, used for calculating a current radius threshold after adding the new data point, and determining whether the current radius threshold is greater than the sample radius threshold;

[0169] A third processing module is used for updating all clustering feature values ​​when the current radius threshold is less than or equal to the sample radius threshold, and executing the step of determining whether all data points in the order material matrix have been read;

[0170] The fourth processing module is used to split the current leaf node when the current radius threshold is greater than the sample radius threshold; the splitting of the current leaf node includes: selecting the two nodes with the farthest distance from the old leaf nodes as new leaf nodes, and putting the data of the new data point into all nodes according to the principle of the closest distance;

[0171] A fifth processing module, used to determine whether the data of the clustering feature value contained in the parent node of the current leaf node is greater than the branch balance factor;

[0172] The sixth processing module is used to re-execute the step of splitting the current leaf node if it is greater than the branch balance factor; if it is less than or equal to the branch balance factor, execute the step of determining whether all data points in the order material matrix have been read.

[0173] In the present application, the second determination module 62 includes:

[0174] A first establishing unit is used to establish a one-way linked list of material order corresponding to each type of the order according to the order clustering result;

[0175] A second establishing unit is used to establish a unit list directional list of the material storage unit according to the order of the material storage unit that the order passes through on the production line, and establish a material type unidirectional linked list composed of the material types that can be stored in each material storage unit in the unit list directional list of the material storage unit according to the material types that can be stored in the material storage unit;

[0176] A second processing unit is used to search the unit list unidirectional list and the material type unidirectional list according to the material sequence unidirectional list to obtain a start sequence of the material storage unit of each type of the order;

[0177] A fourth determination unit, used to determine whether all orders establish the startup sequence;

[0178] A third processing unit is used for re-executing the step of obtaining the start sequence of the material storage unit of each type of the order if the start sequence is not established for all orders;

[0179] A fourth processing unit is used to create a process time sequence for each of the orders according to the start sequence and the one-way linked list of material types if the start sequence is not established for all orders;

[0180] The fifth processing unit is used to determine the material attribute information corresponding to each type of order according to the material sequence one-way linked list and the maximum material stored in the material storage unit.

[0181] Optionally, in the present application, the third determining module 63 includes:

[0182] A sixth processing unit, configured to initialize the population according to the material attribute information and the preset genetic algorithm, and mark the position of the gene according to the order category;

[0183] a seventh processing unit, configured to calculate a fitness function, normalize the fitness function, and perform roulette selection;

[0184] an eighth processing unit, for performing dye crossover and gene sequence adjustment according to the position markers and re-executing the step of calculating the fitness function when the maximum number of iterations is not reached;

[0185] The sixth processing unit is used to select the best individual to be determined as the workshop scheduling plan when the maximum number of iterations is reached. The workshop scheduling plan includes the activation plan of the material storage unit and the sequence of material types that can be stored in the material storage unit.

[0186] Among them, the implementation embodiments of the above-mentioned workshop scheduling method for material assembly production are all applicable to the embodiments of the workshop scheduling device for material assembly production, and can also achieve the same technical effects.

[0187] A readable storage medium of an embodiment of the present application stores a program or instruction thereon. When the program or instruction is executed by a processor, the steps in the workshop scheduling method for material assembly production as described above are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

[0188] The processor is the processor in the workshop scheduling method for material assembly production described in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0189] The present application also provides a computer program product, including computer instructions, which, when executed by a processor, implement the above Figures 1 to 4 The various processes of the method embodiment shown in the figure can achieve the same technical effect. To avoid repetition, they will not be described again here.

[0190] It should be further noted that the modules in this specification may be implemented in software so that they can be executed by various types of processors. For example, an identified executable code module may include one or more physical or logical blocks of computer instructions, for example, which may be constructed as an object, process or function. Nevertheless, the executable code of the identified module need not be physically located together, but may include different instructions stored in different locations, which, when logically combined together, constitute the module and achieve the specified purpose of the module.

[0191] In fact, executable code module can be a single instruction or many instructions, and can even be distributed on a plurality of different code segments, distributed among different programs, and distributed across a plurality of memory devices. Similarly, operating data can be identified in the module, and can be implemented and organized in the data structure of any appropriate type according to any appropriate form. The operating data can be collected as a single data set, or can be distributed in different locations (including on different storage devices), and can only be present on a system or network as an electronic signal at least in part.

[0192] When a module can be implemented by software, considering the level of existing hardware technology, a person skilled in the art can build a corresponding hardware circuit to implement the corresponding function of the module that can be implemented by software without considering the cost. The hardware circuit includes a conventional very large scale integration (VLSI) circuit or gate array and existing semiconductors such as logic chips, transistors, or other discrete components. The module can also be implemented by a programmable hardware device, such as a field programmable gate array, a programmable array logic, a programmable logic device, etc.

[0193] The above exemplary embodiments are described with reference to the accompanying drawings, and many different forms and embodiments are feasible without departing from the spirit and teachings of the present application. Therefore, the present application should not be constructed as a limitation of the exemplary embodiments proposed herein. More specifically, these exemplary embodiments are provided so that the present application will be perfect and complete, and the scope of the present application will be conveyed to those who are familiar with the technology. In these figures, the component sizes and relative sizes may be exaggerated for clarity. The terms used here are only based on the purpose of describing specific exemplary embodiments and are not intended to be limiting. As used herein, unless the text clearly indicates otherwise, the singular forms "one", "an" and "the" are intended to include these multiple forms. It will be further understood that the terms "comprising" and / or "including" when used in this specification indicate the presence of the features, integers, steps, operations, components and / or components, but do not exclude the presence or increase of one or more other features, integers, steps, operations, components, components and / or their groups. Unless otherwise indicated, when stated, a range of values ​​includes the upper and lower limits of that range and any subranges therebetween.

[0194] The above is a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles described in the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A workshop scheduling method for material assembly production, characterized in that: include: Cluster multiple orders according to the required materials of the orders and determine the order clustering results; According to the order clustering results, the material attribute information corresponding to each type of order is determined by using a material allocation algorithm; the material attribute information includes the material storage unit that needs to be opened for each type of order and the placement position of the material in each of the material storage units; A workshop scheduling plan is determined according to the material attribute information and a preset genetic algorithm.

2. The method according to claim 1, characterized in that Cluster multiple orders according to the required materials of the orders and determine the order clustering results, including: According to the types of materials required for the order, the order is encoded and an order material matrix is ​​established; Determine a clustering feature tree according to the order material matrix and a preset clustering algorithm; the order material data corresponding to all clustering feature nodes in the last leaf node of the clustering feature tree are of the same category; According to the clustering feature tree, the order clustering result is determined.

3. The method according to claim 2, characterized in that According to the order material matrix and the preset clustering algorithm, a clustering feature tree is determined, including: Initialize clustering parameters; the clustering parameters include: the branch balance factor of the internal nodes of the clustering feature tree, the leaf balance factor of each leaf node and the sample radius threshold of each leaf node; Determine whether all data points in the order material matrix have been read; If all data points have not been read, determining clustering feature values ​​of the data points according to the data points and the preset clustering algorithm; If all data points have been read, the cluster feature tree is determined based on all the cluster feature values.

4. The method according to claim 3, characterized in that If all data points have not been read, determining the clustering feature values ​​of the data points according to the data points and the preset clustering algorithm includes: Determine the total number of all data points in the order material matrix, the sum vector of the feature dimensions corresponding to the data points, and the sum of the squares of all feature dimensions; According to the total number of all data points, the sum vector and the square sum, the clustering feature value of the data point is determined using the preset clustering algorithm.

5. The method according to claim 3, characterized in that: After determining the clustering characteristic values ​​of the data points, the method further includes: When a new data point is read in, the clustering feature value of the leaf node closest to the new data point is searched downward from the root node; the root node is the clustering feature value initially calculated when reading the data point; Calculating a current radius threshold after adding the new data point, and determining whether the current radius threshold is greater than the sample radius threshold; In the case where the current radius threshold is less than or equal to the sample radius threshold, all clustering feature values ​​are updated, and a step of determining whether all data points in the order material matrix have been read is performed; When the current radius threshold is greater than the sample radius threshold, split the current leaf node; the splitting of the current leaf node includes: selecting the two farthest nodes in the old leaf nodes as new leaf nodes, and putting the data of the new data point into all nodes according to the principle of closest distance; Determine whether the data of the clustering feature value contained in the parent node of the current leaf node is greater than the branch balance factor; If it is greater than the branch balance factor, the step of splitting the current leaf node is re-executed; if it is less than or equal to the branch balance factor, the step of determining whether all data points in the order material matrix have been read is executed.

6. The method according to claim 1, characterized in that According to the order clustering results, the material attribute information corresponding to each type of order is determined using the material allocation algorithm, including: According to the order clustering results, a one-way linked list of material order corresponding to each type of the order is established; According to the order of the material storage units that the order passes through on the production line, a unit list of the material storage unit is established, and according to the material types that the material storage unit can store, a material type unidirectional linked list composed of the material types that can be stored by each material storage unit in the unit list of the material storage unit is established; According to the material sequence one-way linked list, the unit list one-way linked list and the material type one-way linked list are searched to obtain the start sequence of the material storage unit of each type of the order; determining whether all orders establish the startup sequence; If the activation sequence is not established for all orders, re-execute the step of obtaining the activation sequence of the material storage unit of each type of the order; If the start sequence is not established for all orders, then a process time sequence for each order is created according to the start sequence and the one-way linked list of material types; The material attribute information corresponding to each type of order is determined according to the material sequence one-way linked list and the largest material stored in the material storage unit.

7. The method according to claim 1, characterized in that According to the material attribute information and the preset genetic algorithm, a workshop scheduling plan is determined, including: Initialize the population according to the material attribute information and the preset genetic algorithm, and mark the position of the gene according to the order category; Calculating a fitness function, normalizing the fitness function, and performing roulette wheel selection; If the maximum number of iterations is not reached, dye crossover and gene sequence adjustment are performed according to the position markers, and the step of calculating the fitness function is re-executed; When the maximum number of iterations is reached, the optimal individual is selected to be determined as the workshop scheduling plan, and the workshop scheduling plan includes an activation plan of the material storage unit and a sequence of material types that can be stored in the material storage unit.

8. A workshop scheduling device for material assembly production, characterized in that: include: The first determination module is used to cluster multiple orders according to the required materials of the orders and determine the order clustering results; A second determination module is used to determine the material attribute information corresponding to each type of order based on the order clustering result and using a material allocation algorithm; the material attribute information includes the material storage unit that needs to be opened for each type of order and the placement position of the material in each of the material storage units; The third determination module is used to determine a workshop scheduling plan according to the material attribute information and a preset genetic algorithm.

9. A readable storage medium having a program or instruction stored thereon, characterized in that: When the program or instruction is executed by a processor, the steps in the scheduling method according to any one of claims 1 to 7 are implemented.

10. A computer program product, characterized in that The method comprises computer instructions, which, when executed by a processor, implement the steps of the method according to any one of claims 1 to 7.

Citation Information

Cited By

  • Material data processing method and system

    CN120763641A