A method, device, equipment and storage medium for scheduling a numerical control machining production line
By constructing the scheduling model and constraints of CNC processing production lines, and using genetic algorithms and mountain climbing algorithms to optimize the solution, the problem of insufficient transportation time constraints in the existing technology is solved, and the production efficiency of the production line is improved.
Patent Information
- Application Number
- CN202410955955.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-17
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2044-07-17
AI Technical Summary
The existing CNC machining production line scheduling methods take less constraints on product transportation time, resulting in lower production efficiency.
A CNC machining production line scheduling method is proposed. By obtaining the production factor data set, building the production line scheduling model and constraints, using genetic algorithms and mountain climbing algorithms to optimize the solution, and obtaining the objective function to meet the preset threshold of the total processing time of the production order.
The production efficiency of the CNC machining production line has been improved, and the scheduling plan of the production line has been optimized by reasonably considering the processing parts, equipment, processes and transportation time.
Smart Images

Figure CN118502354B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of big data processing technology, and in particular to a CNC machining production line scheduling method, device, equipment and storage medium. Background Art
[0002] A flexible manufacturing unit is a processing unit consisting of one or more CNC machine tools or machining centers. In a CNC machining environment, the transportation link of the flexible manufacturing unit has a great impact on the entire production process, and the transportation time of the transportation mechanism can even become a bottleneck in the processing process.
[0003] However, the scheduling method in the prior art takes less consideration on the constraints of product transportation time, resulting in low production efficiency of the CNC machining production line. Summary of the invention
[0004] The main purpose of the present invention is to provide a CNC machining production line scheduling method, device, equipment and storage medium, aiming to solve the technical problem that the scheduling method in the prior art gives little consideration to the constraints on the transportation time of the product, resulting in low production efficiency of the CNC machining production line.
[0005] To achieve the above object, the present invention proposes a CNC machining production line scheduling method for a production line of a single transport structure with a linear layout; the method comprises the following steps:
[0006] Acquire a production factor data set of a CNC machining production line; the production factor data set includes: production orders, information on machining parts, information on machining equipment, information on processes, process machining time, and parts transportation time;
[0007] Based on the production factor data set, construct a production line scheduling model;
[0008] Constructing constraint conditions based on the information of the processed parts, the information of the processing equipment, the information of the process, the process processing time, and the part transportation time;
[0009] Based on the production line scheduling model and the constraint conditions, an optimization algorithm is used to calculate and solve to obtain an objective function; wherein the optimization algorithm includes: a genetic algorithm and a hill climbing algorithm;
[0010] Based on the objective function, a production line scheduling plan is obtained; wherein the total processing time of the production orders of the production line scheduling plan meets a preset threshold.
[0011] Optionally, the constraint conditions include:
[0012] Obtaining a target process, where the number of the target processes is ≥ N, where N is an integer greater than 1;
[0013] Obtaining a decision variable; if the target process is processed on the target processing equipment, the decision variable is assigned a value of true;
[0014] Based on the decision variables and the actual start processing time of a single target process on the target processing equipment, obtaining the actual start processing time of all the target processes;
[0015] Based on the decision variables and the processing time of a single target process on the target processing equipment, obtaining the processing time of all the target processes;
[0016] Acquire temporary variables based on the completion time of the previous process of the target processed part, the transportation time of the transportation mechanism moving the processed part from the previous process to the next process, and the idle time of the transportation mechanism moving to the processing equipment where the previous process is located;
[0017] Based on the estimated start time of the target process on the target processing device and the temporary variable, obtaining the actual start processing time of the target process on the target processing device;
[0018] Based on the actual start processing time of the target process on the target processing equipment and the processing time of the target process on the target processing equipment, the actual completion time of the target process on the target processing equipment is acquired.
[0019] Optionally, different processes of the same target processing part are arranged in sequence.
[0020] Optionally, the step of obtaining the actual start time of the target process on the target processing device based on the estimated start time of the target process on the target processing device and the temporary variable includes:
[0021] If the temporary variable is greater than or equal to the estimated start time of the target process on the target processing equipment, then the actual start time of the target process on the target processing equipment is equal to the temporary variable;
[0022] If the temporary variable is less than the estimated start time of the target process on the target processing equipment, then the actual start time of the target process on the target processing equipment = the estimated start time of the target process on the target processing equipment.
[0023] Optionally, the objective function is:
[0024]
[0025] in, T minrepresents the minimum time to complete the processing of all the target processing parts in a production order; C i Represents the completion time of the i-th target processing part.
[0026] Optionally, the step of obtaining the objective function by calculating and solving using an optimization algorithm based on the production line scheduling model and the constraint conditions includes:
[0027] Based on the production factor data set, chromosome encoding is performed to obtain a random original population;
[0028] Setting initial parameters; based on the initial parameters, dividing the random original population into a first subgroup A and a first subgroup B, using the hill climbing algorithm to perform local optimization on the first subgroup A to obtain a second subgroup; merging the first subgroup B and the second subgroup to obtain an initial population;
[0029] Constructing a population fitness model; using the population fitness model to calculate the individual fitness of each chromosome individual in the initial population;
[0030] Based on the individual fitness, optimizing the initial population to obtain an iterative population;
[0031] It is determined whether the iterative population has reached a preset number of iterations, and if so, the objective function is output.
[0032] Optionally, the step of encoding the production factor data set includes:
[0033] The processing of the CNC machining production line adopts three-layer chromosome coding; among them,
[0034] The length of the first layer chromosome is twice the total number of processes, and the first layer chromosome is divided into two parts: equipment selection and process sorting;
[0035] The second layer of chromosomes are connecting chromosomes and have a length half of the first layer of main chromosomes, and correspond to the device numbers actually selected in the device selection part from left to right;
[0036] The length of the third layer chromosome is consistent with that of the first layer chromosome; each gene position of the left half of the third layer chromosome corresponds to the processing time of each process on the selected processing equipment in turn, and the right half corresponds to the transportation time of the target processing parts.
[0037] Optionally, the population fitness model is:
[0038]
[0039] in, f fitrepresents the fitness of the population; T min It represents the minimum time required to complete the processing of all the target processing parts in a production order.
[0040] Optionally, the optimization operation includes a selection operation, a crossover operation and a mutation operation.
[0041] In addition, to achieve the above-mentioned purpose, the present invention also proposes a CNC machining production line scheduling device, comprising:
[0042] The first acquisition module is used to acquire a production factor data set of a CNC machining production line; the production factor data set includes: production orders, information on machining parts, information on machining equipment, information on processes, process machining time, and parts transportation time;
[0043] A first construction module is used to construct a production line scheduling model based on the production factor data set;
[0044] A second construction module is used to construct constraint conditions based on the information of the processed parts, the information of the processing equipment, the information of the process, the process processing time and the part transportation time;
[0045] A second acquisition module is used to obtain an objective function by using an optimization algorithm to calculate and solve the production line scheduling model and the constraint conditions; wherein the optimization algorithm includes: a genetic algorithm and a hill climbing algorithm;
[0046] The third acquisition module is used to obtain a production line scheduling plan based on the objective function; wherein the total processing time of the production orders of the production line scheduling plan meets a preset threshold.
[0047] In addition, to achieve the above-mentioned purpose, the present invention also proposes a computer device, which includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of any of the above-mentioned CNC machining production line scheduling methods.
[0048] In addition, to achieve the above objectives, the present invention also proposes a computer-readable storage medium, on which a computer program is stored, and a processor executes the computer program to implement the steps of any of the above-mentioned CNC machining production line scheduling methods.
[0049] In existing methods, production line scheduling pays little attention to the constraints on product transportation time, resulting in low production efficiency of CNC machining production lines.
[0050] However, using the method of the present invention, after constructing the production line scheduling model, based on the information of the processed parts, the information of the processing equipment, the information of the process, the process processing time and the parts transportation time, the constraint conditions are constructed; the production line scheduling model is solved by using an optimization algorithm to obtain the objective function; and then the production line scheduling plan is obtained based on the objective function. The production line scheduling plan of the present invention takes into account the information of the processed parts, the information of the processing equipment, the information of the process, the process processing time and the parts transportation time, so that the scheduling plan is more reasonable and the production efficiency of the production line is improved. BRIEF DESCRIPTION OF THE DRAWINGS
[0051] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the structures shown in these drawings without paying creative work.
[0052] Figure 1 A schematic diagram of the device structure of the hardware operating environment involved in the embodiment of the present application;
[0053] Figure 2 It is a flowchart of a method for scheduling a CNC machining production line according to an embodiment of the present application;
[0054] Figure 3 A Gantt chart showing the calculation results of this application example;
[0055] Figure 4 It is a structural block diagram of a CNC machining production line scheduling device according to an embodiment of the present invention.
[0056] The realization of the purpose, functional features and advantages of the present invention will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION
[0057] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0058] Production scheduling refers to the process of allocating production tasks to production resources. Under the premise of considering capacity and equipment, and with a certain amount of materials, the production order of each production task is arranged, the production order is optimized, and the production equipment is optimized to reduce waiting time and balance the production load of each machine and worker.
[0059] Regarding the production scheduling technology of flexible manufacturing units, existing research mainly focuses on two aspects: modeling methods and production scheduling. In terms of flexible manufacturing unit modeling, a flexible manufacturing unit system with a handling robot is modeled. At the same time, some researchers have considered constraints such as transportation costs and depreciation rates of processing equipment to minimize production costs to model the flexible manufacturing unit; in terms of flexible manufacturing unit production scheduling, existing research mainly includes flexible manufacturing unit production scheduling methods that consider constraints such as batch processing of parts and processing equipment load / failures, while taking into account multiple objectives such as minimizing the maximum production cycle and customer satisfaction, and solving them based on heuristic algorithms such as taboo search, particle swarm, and ant colony.
[0060] Most of the existing research on flexible manufacturing unit production scheduling focuses on the constraints of production resources, and less consideration is given to the constraints of the transportation time of parts during the processing. However, in the actual processing environment, the transportation link of the flexible manufacturing unit has a great impact on the entire production process, and the transportation time of the transportation mechanism can even become a bottleneck in the processing process. Therefore, factors such as the transportation and idle time of the loading and unloading mechanism during the processing are taken into account in the production scheduling optimization model of the flexible production line, and combined with the dynamic disturbance events that occur in the production process for research, which is more in line with the actual production environment of the current multi-variety and small batch production mode, and is an important part of improving the production efficiency of the flexible production line.
[0061] Reference Figure 1 , Figure 1 This is a schematic diagram of the device structure of the hardware operating environment involved in the embodiment of the present application.
[0062] like Figure 1 As shown, the electronic device may include: a processor 1001, such as a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. Among them, the communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a wireless fidelity (WIreless-FIdelity, WI-FI) interface). The memory 1005 may be a high-speed random access memory (Random Access Memory, RAM) memory, or a stable non-volatile memory (Non-Volatile Memory, NVM), such as a disk memory. The memory 1005 may also be a storage device independent of the aforementioned processor 1001.
[0063] Those skilled in the art will understand that Figure 1 The structure shown in the figure does not constitute a limitation on the electronic device, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.
[0064] like Figure 1 As shown, the memory 1005 as a storage medium may include an operating system, a network communication module, a user interface module, and an electronic program.
[0065] exist Figure 1 In the electronic device shown, the network interface 1004 is mainly used for data communication with the network server; the user interface 1003 is mainly used for data interaction with the user; the processor 1001 and the memory 1005 in the electronic device of the present invention can be set in the electronic device, and the electronic device calls the CNC machining production line scheduling device stored in the memory 1005 through the processor 1001, and executes the CNC machining production line scheduling method provided in the embodiment of the present application.
[0066] refer to Figure 2 The embodiment of the present application provides a method for scheduling a numerical control machining production line, which is used for a production line of a single transport structure with a linear layout; the method comprises the following steps:
[0067] S11, obtaining a production factor data set of a CNC machining production line; the production factor data set includes: production orders, information on machining parts, information on machining equipment, information on processes, process machining time, and parts transportation time.
[0068] The information of the processed parts may include the number of parts. The information of the processing equipment may include the number of processing equipment and the order of processing equipment. The information of the process may include the number of processes and the order of processes.
[0069] The process processing time may include: the completion time of the processed parts, the time when all processed parts start processing, the actual start time of different processes on different processing equipment, the processing time of all processes, the processing time of different processes on different processing equipment, the actual completion time of different processes on different processing equipment, the completion time of the previous process of the processed parts, the estimated start time of different processes on different processing equipment, etc.
[0070] The part transportation time may include: the transportation time of the transportation mechanism from the processing equipment corresponding to the previous process to the processing equipment corresponding to the next process, and the idle time of the transportation mechanism moving to the processing equipment corresponding to the previous process of the target process. The transportation mechanism may be a loading and unloading truss car.
[0071] The production factor data set can also include decision variables and temporary variables, etc.
[0072] In some embodiments, the production line of the present application can be composed of 5 devices (i.e. M 1. M 2. M 3. M 4 and M 5) and a straight-line production line consisting of a loading and unloading truss car. An order can include 2 processed parts (i.e. J 1 and J 2), each processed part can contain 3 processing steps (i.e. O 11 , O 12 , O 13 , O 21 , O 22 and O 23 ). Table 1 and Table 2 define the processing time of each process on the equipment and the transportation time of the transport trolley between the various equipments.
[0073] Table 1: Processing schedule of the process on the equipment
[0074]
[0075] Table 2: Transportation time of the transport trolley between various equipment
[0076]
[0077] S12. Constructing an initial production line scheduling model based on the production factor data set.
[0078] S13, constructing constraint conditions based on the information of the processed parts, the information of the processing equipment, the information of the process, the process processing time and the part transportation time.
[0079] Furthermore, the constraints may include the following conditions:
[0080] A1. Obtain target processes, where the number of target processes is ≥ N, where N is an integer greater than 1.
[0081] A2. Obtain decision variables; if the target process is processed on the processing equipment, the decision variable is assigned a value of true. The assignment relationship of the decision variable is:
[0082]
[0083] The meaning of formula (1) is that at the same time, a process can only be processed on one device.
[0084] In formula (1), X ijk represents the decision variable, when the target process O ij Target processing equipment k When processing, its value is 1, otherwise it is 0; k Indicates the number of target processing equipment, k =1,2,... m ; i represents the number of target processing parts, i =1,2,..., n ; j represents the number of target processes, j =1,2,..., h ; m, n and h all represent natural numbers.
[0085] A3. Based on the decision variables and the actual start processing time of a single target process on the target processing equipment, the actual start processing time of all target processes is obtained. The mathematical relationship of A3 is:
[0086]
[0087] In formula (2), Y ij Indicates all target processes O ij The actual start time of processing; Y ijk Represents a single target process O ij Target processing equipment k The actual start time of processing.
[0088] A4. Based on the decision variables and the processing time of a single target process on the target processing equipment, the processing time of all target processes is obtained. The mathematical relationship of A4 is:
[0089]
[0090] In formula (3), T ij Indicates all target processes O ij Processing time; T ijk Represents a single target process O ij Target processing equipment k Processing time on.
[0091] A5. The different processes of the same target processing part are arranged in sequence; the mathematical relationship of A5 is:
[0092]
[0093] In formula (4), Y ij Indicates the target process O ij Start processing time, Y i(j+1) Indicates the target process O i(j+1) Start processing time; i represents the number of target processing parts, i =1,2,..., n ; j represents the number of target processes, j =1,2,..., h .
[0094] A6, based on the completion time of the previous process of the target processed part, the transportation time of the transport mechanism moving the processed part from the previous process to the next process, and the idle time of the transport mechanism moving to the processing equipment where the previous process is located, obtain the temporary variable. The mathematical relationship of A6 is:
[0095]
[0096] In formula (5), T* Represents a temporary variable; C i(j-1)w Indicates the target processing part i The time when the previous process was completed; T i(j-1)wk It indicates the transportation time for the transportation mechanism to move the processed parts from the previous process to the next process; T i(j-1)p Indicates that the transport mechanism moves to the target process O ij The idle time of the processing equipment in the previous process.
[0097] A7. Based on the estimated start time of the target process on the target processing equipment and the temporary variable, obtain the actual start time of the target process on the target processing equipment;
[0098] Furthermore, if the temporary variable is greater than or equal to the estimated start time of the target process on the target processing equipment, then the actual start time of the target process on the target processing equipment = the temporary variable;
[0099] If the temporary variable is less than the estimated start time of the target process on the target processing equipment, then the actual start time of the target process on the target processing equipment = the estimated start time of the target process on the target processing equipment.
[0100] The mathematical relationship of A7 is:
[0101]
[0102] In formula (6), Y ijk Represents a single target process O ij Target processing equipment k The actual start time of processing; T * Represents a temporary variable; t ijk Indicates the target process O ij Target processing equipment k The estimated start time of
[0103] A8. Based on the actual start time of the target process on the target processing equipment and the processing time of the target process on the target processing equipment, the actual completion time of the target process on the target processing equipment is obtained. The mathematical relationship of A8 is:
[0104]
[0105] In formula (7), C ijk Indicates the target process O ij Target processing equipment k The actual completion time of the project; Y ijk Represents a single target process O ij Target processing equipment k The actual start time of processing; T ijk Represents a single target process O ij Target processing equipment k Processing time on.
[0106] S14. Based on the production line scheduling model and constraints, an optimization algorithm is used to calculate and solve to obtain an objective function; wherein the optimization algorithm includes: a genetic algorithm and a hill climbing algorithm.
[0107] The objective function is:
[0108] in, T min It represents the minimum time to complete the processing of all target processing parts in a production order; C i represents the completion time of the i-th target processing part.
[0109] Furthermore, based on the production factor data set, chromosome encoding is performed to obtain a random original population.
[0110] In some embodiments, the step of encoding the production factor dataset comprises:
[0111] Three-layer chromosome coding is used for the processing of CNC machining production lines;
[0112] In the chromosome encoding of some embodiments, the first layer is the master chromosome and the rest are slave chromosomes. The length of the first layer chromosome is set to twice the total number of processes required to complete the production order. The left half represents the equipment selection part MachineSelect (MS), and the right half represents the process sorting Operation Sort (OS). In the MS part, the gene bits are sorted in sequence from the first process of the first part to the last process of the last part. The numbers on the gene bits represent the number of the equipment selected by the current process in its optional equipment set; in the OS part, the numbers on each gene bit represent the number of the part, the number of times each number appears represents the total number of processes for the part, and the order of appearance represents the processing order of the part process.
[0113] The second layer is the connection chromosome, which is half the length of the first layer main chromosome, and corresponds to the device numbers actually selected in the MS part of the first layer from left to right.
[0114] The length of the third-layer chromosome is consistent with the length of the first-layer main chromosome. Each gene position in the left half corresponds to the processing time of each process on the selected processing equipment in turn, and the right half incorporates the transportation time of part processing, which is the transportation time of the part between two different equipment when the process is switched.
[0115] As an optional implementation, the data in Table 1 and Table 2 are used to perform actual encoding and randomly generate a scheduling plan.
[0116] In one example, after encoding the chromosome, initial parameters are set; based on the initial parameters, the random original population is divided into a first subgroup A and a first subgroup B, and the first subgroup A is locally optimized using a hill climbing algorithm to obtain a second subgroup; the first subgroup B and the second subgroup are merged to obtain an initial population.
[0117] Among them, the initial parameters include: the population size can be 200; the population generation gap can be 0.8; the crossover probability can be 0.7; the mutation probability can be 0.09; and the number of iterations can be 500.
[0118] Construct a population fitness model; use the population fitness model to calculate the individual fitness of each chromosome individual in the initial population.
[0119] The population fitness model is:
[0120]
[0121] in, f fit represents the fitness of the population; T min It represents the minimum time required to complete the processing of all the target processing parts in a production order.
[0122] In order to improve the overall computational efficiency, half of the randomly generated original population is selected (the selected population is recorded as F s ) and use the hill climbing algorithm to perform local optimization operations. F s Select an individual chromosome and calculate its fitness. Randomly select two gene sites in the chromosome and exchange them to obtain a new chromosome after gene mutation as the domain of the original chromosome. Recalculate the fitness of the new chromosome after gene mutation. If it is better than the original chromosome, replace the original chromosome, otherwise keep the original chromosome. Repeat the above process until the local optimal chromosome cannot be selected. F s After each chromosome individual in the , the optimized new population F s ’ The population is initialized by merging it with the other half of the randomly generated population to obtain the initial population.
[0123] Based on the individual fitness, the initial population is optimized to obtain an iterative population. Further, the optimization operation includes selection operation, crossover operation and mutation operation.
[0124] Determine whether the iterative population has reached the preset number of iterations. If so, output the objective function.
[0125] In the selection phase, in order to quickly obtain the "excellent genes" in the population, each individual in the initial population is sorted in ascending order of fitness, and the individual with the highest fitness is selected as the "preferred gene", and the individuals in the "preferred gene" are directly copied to the next generation, and the remaining individuals are selected from the initial population according to the principle of equal probability random selection. When the next generation population performs the selection operation here, the fitness value of each individual in the population is compared with the individuals in the "preferred gene". If any individual in the population has a worse fitness value than the individual in the "preferred gene", it will not be retained, and the copy operation of the "preferred gene" individual will continue.
[0126] If the number of individuals in the population with better fitness values than those in the "preferred gene" is within 15% of the population, these individuals will be directly retained in the next generation of the population, and the remaining individuals will be selected using the principle of equal probability random selection; if the number of individuals in the population with better fitness values than those in the "preferred gene" is greater than 15%, the first 15% of individuals will be directly retained in the next generation, and the rest will be put into the population. Repeated iterations are performed until the population iteration is completed.
[0127] In the crossover link, in order to ensure that the excellent individuals of the parent generation of the population can be retained in the process and the feasibility of the scheduling plan for the new individuals generated, the parts in the orders to be processed in the flexible production line are randomly divided into two sets , then select two parent chromosomes and mark them as F1 and F2, and copy the genes at each position of the parent chromosome containing part set A1 directly to the corresponding offspring S1 and S2 according to the original position, and then copy the genes of the parent chromosome containing part set A2 to the offspring S2 and S1 respectively to complete the crossover.
[0128] In the mutation phase, a gene position is randomly selected and the value on the gene is replaced with the number of other equipment in the optional processing equipment set of its corresponding process. The selection rule is that the equipment with the shortest processing time has the highest probability of being selected until the maximum number of iterations is reached.
[0129] S15. Based on the objective function, a production line scheduling plan is obtained; wherein the total processing time of the production orders of the production line scheduling plan meets a preset threshold, and the preset threshold can be set as needed.
[0130] refer to Figure 3 , Figure 3 The Gantt chart is a diagram showing the calculation results of the present application example, i.e., the production line scheduling plan.
[0131] The CNC machining production line scheduling method of this application studies the scheduling problem of flexible production lines, takes into account the transportation time of the loading and unloading truss car between various processing equipment, establishes a mathematical model that takes into account the transportation time of the loading and unloading truss car between different processing equipment as a constraint, and proposes a hybrid scheduling algorithm based on genetic algorithm, integrating hill climbing algorithm and "optimal gene" and equal probability random selection as operators to solve the model. After verification of the model and algorithm, the model can output effective scheduling results for the scheduling problem of flexible production lines. At the same time, based on the algorithm model proposed by this method, when solving the scheduling plan, it has better solution efficiency than the traditional genetic algorithm.
[0132] Based on the same inventive concept as the above embodiment, Figure 4 The embodiment of the present invention further provides a numerical control production line scheduling device, which is used in a computer device and includes:
[0133] The first acquisition module is used to acquire a production factor data set of a CNC machining production line; the production factor data set includes: production orders, information on machining parts, information on machining equipment, information on processes, process machining time, and parts transportation time;
[0134] A first construction module is used to construct a production line scheduling model based on a production factor data set;
[0135] The second building module is used to build constraint conditions based on information of processed parts, information of processing equipment, information of process, process processing time and part transportation time;
[0136] The second acquisition module is used to obtain the objective function by using an optimization algorithm to calculate and solve the production line scheduling model and constraint conditions; wherein the optimization algorithm includes a genetic algorithm and a hill climbing algorithm;
[0137] The third acquisition module is used to obtain a production line scheduling plan based on the objective function; wherein the total processing time of the production orders of the production line scheduling plan meets a preset threshold.
[0138] It should be noted that, since the steps executed by the device of this embodiment are the same as the steps of the aforementioned method embodiment, its specific implementation method and the technical effects that can be achieved can refer to the aforementioned embodiment and will not be repeated here.
[0139] In addition, in one embodiment, the present application further provides a computer storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the method in the aforementioned embodiment are implemented.
[0140] In some embodiments, the computer-readable storage medium may be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, flash memory, magnetic surface memory, optical disk, or CD-ROM; or various devices including one or any combination of the above memories. The computer may be various computing devices including intelligent terminals and servers.
[0141] In some embodiments, executable instructions may be in the form of a program, software, software module, script or code, written in any form of programming language (including compiled or interpreted languages, or declarative or procedural languages), and may be deployed in any form, including as a stand-alone program or as a module, component, subroutine or other unit suitable for use in a computing environment.
[0142] As an example, executable instructions may, but need not, correspond to a file in a file system, may be stored as part of a file storing other programs or data, such as in one or more scripts in a HyperText Markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files storing one or more modules, subroutines, or code portions).
[0143] By way of example, executable instructions may be deployed to be executed on one computing device, or on multiple computing devices located at one site, or on multiple computing devices distributed across multiple sites and interconnected by a communication network.
[0144] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.
[0145] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.
[0146] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as a read-only memory / random access memory, a magnetic disk, or an optical disk), and includes a number of instructions for enabling a multimedia terminal device (which can be a mobile phone, a computer, a television receiver, or a network device, etc.) to execute the methods described in each embodiment of the present application.
[0147] The above descriptions are only optional embodiments of the present invention, and are not intended to limit the patent scope of the present invention. All equivalent structural changes made using the contents of the present invention's specification and drawings, or directly / indirectly applied in other related technical fields, are included in the patent protection scope of the present invention.
Claims
1. A method for scheduling a CNC machining production line, characterized in that: Production lines for single transport structures in a linear layout; The method comprises the following steps: Acquire a production factor data set of a CNC machining production line; the production factor data set includes: production orders, information on machining parts, information on machining equipment, information on processes, process machining time, and parts transportation time; Based on the production factor data set, construct a production line scheduling model; Based on the information of the processed parts, the information of the processing equipment, the information of the process, the process processing time and the part transportation time, the constraint conditions are constructed; the constructed constraint conditions include: obtaining the target process, the number of the target processes ≥ N, N is an integer greater than 1; obtaining decision variables; if the target process is processed on the target processing equipment, the decision variable is assigned a value of true; based on the decision variables and the actual start processing time of a single target process on the target processing equipment, the actual start processing time of all the target processes is obtained; based on the decision variables and the processing time of a single target process on the target processing equipment, the processing time of all the target processes is obtained; based on the completion time of the previous process of the target processed part, the transportation time of the transportation mechanism to move the processed part from the previous process to the next process, and the idle time of the transportation mechanism to the processing equipment where the previous process is located, a temporary variable is obtained; based on the estimated start time of the target process on the target processing equipment and the temporary variables, the actual start processing time of the target process on the target processing equipment is obtained; based on the actual start processing time of the target process on the target processing equipment and the processing time of the target process on the target processing equipment, the actual completion time of the target process on the target processing equipment is obtained; Based on the production line scheduling model and the constraints, an optimization algorithm is used to calculate and solve to obtain an objective function; wherein the optimization algorithm includes: a genetic algorithm and a hill climbing algorithm; the steps of calculating and solving the objective function based on the production line scheduling model and the constraints using the optimization algorithm include: based on the production factor data set, chromosome encoding is performed to obtain a random original population; initial parameters are set; based on the initial parameters, the random original population is divided into a first subgroup A and a first subgroup B, and the first subgroup A is locally optimized using the hill climbing algorithm to obtain a second subgroup; the first subgroup B and the second subgroup are merged to obtain an initial population; a population fitness model is constructed; the individual fitness of each chromosome individual in the initial population is calculated using the population fitness model; based on the individual fitness, the initial population is optimized to obtain an iterative population; it is determined whether the iterative population has reached a preset number of iterations, and if so, the objective function is output; Based on the objective function, a production line scheduling plan is obtained; wherein the total processing time of the production orders of the production line scheduling plan meets a preset threshold.
2. The method for scheduling a CNC machining production line according to claim 1, wherein: Different processes of the same target processing part are arranged in sequence.
3. The CNC machining production line scheduling method according to claim 1, characterized in that: The step of obtaining the actual start time of the target process on the target processing device based on the estimated start time of the target process on the target processing device and the temporary variable comprises: If the temporary variable is greater than or equal to the estimated start time of the target process on the target processing equipment, then the actual start time of the target process on the target processing equipment is equal to the temporary variable; If the temporary variable is less than the estimated start time of the target process on the target processing equipment, then the actual start time of the target process on the target processing equipment = the estimated start time of the target process on the target processing equipment.
4. The method for scheduling a CNC machining production line according to claim 1, wherein: The objective function is: in, T min represents the minimum time to complete the processing of all the target processing parts in a production order; C i Represents the completion time of the i-th target processing part.
5. The method for scheduling a CNC machining production line according to claim 1, wherein: The step of performing chromosome encoding based on the production factor data set to obtain a random original population includes: The processing of the CNC machining production line adopts three-layer chromosome coding; among them, The length of the first layer chromosome is twice the total number of processes, and the first layer chromosome is divided into two parts: equipment selection and process sorting; The second layer of chromosomes are connecting chromosomes and have a length half that of the first layer of chromosomes, and correspond to the device numbers actually selected in the device selection part from left to right; The length of the third layer chromosome is consistent with that of the first layer chromosome; each gene position of the left half of the third layer chromosome corresponds to the processing time of each process on the selected processing equipment in turn, and the right half corresponds to the transportation time of the target processing parts.
6. The method for scheduling a CNC machining production line according to claim 1, wherein: The population fitness model is: in, f fit represents the fitness of the population; T min It represents the minimum time required to complete the processing of all the target processing parts in a production order.
7. The method for scheduling a CNC machining production line according to claim 1, wherein: The optimization operation includes a selection operation, a crossover operation and a mutation operation.
8. A CNC machining production line scheduling device, characterized in that: include: The first acquisition module is used to acquire a production factor data set of a CNC machining production line; The production factor data set includes: production orders, information on processed parts, information on processing equipment, information on processes, process processing time, and time for transporting parts; A first construction module is used to construct a production line scheduling model based on the production factor data set; The second construction module is used to construct constraint conditions based on the information of the processed parts, the information of the processing equipment, the information of the process, the process processing time and the part transportation time; the constructed constraint conditions include: obtaining the target process, the number of the target processes ≥ N, N is an integer greater than 1; obtaining decision variables; if the target process is processed on the target processing equipment, the decision variable is assigned to true; based on the decision variables and the actual start processing time of a single target process on the target processing equipment, the actual start processing time of all the target processes is obtained; based on the decision variables and the processing time of a single target process on the target processing equipment, the actual start processing time of all the target processes is obtained. The processing time of all the target processes; obtaining temporary variables based on the completion time of the previous process of the target processed part, the transportation time of the transportation mechanism to move the processed part from the previous process to the next process, and the idle time of the transportation mechanism to the processing equipment where the previous process is located; obtaining the actual start processing time of the target process on the target processing equipment based on the estimated start time of the target process on the target processing equipment and the temporary variables; obtaining the actual completion time of the target process on the target processing equipment based on the actual start processing time of the target process on the target processing equipment and the processing time of the target process on the target processing equipment; The second acquisition module is used to obtain the objective function by using the optimization algorithm to calculate and solve based on the production line scheduling model and the constraints; wherein the optimization algorithm includes: a genetic algorithm and a hill climbing algorithm; the steps of obtaining the objective function by using the optimization algorithm to calculate and solve based on the production line scheduling model and the constraints include: performing chromosome encoding based on the production factor data set to obtain a random original population; setting initial parameters; based on the initial parameters, dividing the random original population into a first subgroup A and a first subgroup B, and using the hill climbing algorithm to locally optimize the first subgroup A to obtain a second subgroup; merging the first subgroup B and the second subgroup to obtain an initial population; constructing a population fitness model; using the population fitness model to calculate the individual fitness of each chromosome individual in the initial population; based on the individual fitness, optimizing the initial population to obtain an iterative population; judging whether the iterative population has reached a preset number of iterations, and if so, outputting the objective function; The third acquisition module is used to obtain a production line scheduling plan based on the objective function; wherein the total processing time of the production orders of the production line scheduling plan meets a preset threshold.
9. A computer device, characterized in that: The computer device comprises a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the method according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the processor executes the computer program to implement the CNC machining production line scheduling method according to any one of claims 1 to 7.
Citation Information
Patent Citations
Workshop scheduling method for Job-shop discrete production
CN101533490A
Flexible job shop order insertion dynamic scheduling optimization method
CN107831745A
Production scheduling method and device, computer equipment and storage medium
CN114254927A
Semiconductor production scheduling method and system and computer readable storage medium
CN114462770A
Multi-target manufacturing task optimal allocation method
CN114757439A
