Assembly line process planning method and device, electronic equipment and storage medium

Abstract

The invention provides an assembly line process planning method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining a to-be-allocated process of an assembly line; performing process planning on the to-be-allocated processes to obtain a process planning set; obtaining duration data of each process planning scheme in the process planning set; updating and iterating the duration data of each process planning scheme to obtain target duration data; and determining a process planning scheme corresponding to the target time length data as a final assembly line process planning scheme. By implementing the method, the process planning efficiency of the assembly line can be improved, the assembly task can be completed on the basis of consuming less manpower and material resources, the assembly time consumption can be reduced, the planning process can be simplified, and the difficulty of the assembly line in the process of process allocation can be reasonably and effectively solved.

Description

Technical Field

[0001] The present application relates to the technical field of task planning, and in particular to an assembly line process planning method, device, electronic device and storage medium. Background Art

[0002] In the process of traditional assembly line process allocation, since there is no concept of workstations in linear assembly lines, workers only perform processing tasks at some workstations with machines. The processing tasks are single, and the demand for process allocation is small, so there is no need for process allocation. However, the concept of workstations has appeared in more and more complex assembly lines. The assembly workstation where a large product is located requires multiple people to process it at the same time. The process allocation of each workstation directly determines the processing efficiency.

[0003] In the existing technology for solving the process planning problem of multi-person co-station assembly lines, relatively basic methods such as simulated annealing algorithm and particle swarm algorithm are directly used for planning. The parameters are cumbersome, time-consuming, and the algorithm structure is complex, which cannot effectively solve the process planning problem on the assembly line. Summary of the invention

[0004] The purpose of this application is to provide an assembly line process planning method, device, electronic device and storage medium, which can improve the process planning efficiency of the assembly line, complete the assembly task on the basis of consuming less manpower and material resources, reduce the assembly time, simplify the planning process, and reasonably and effectively solve the problems of the assembly line in the process of process allocation.

[0005] In a first aspect, an embodiment of the present application provides an assembly line process planning method, the method comprising:

[0006] Obtain the process to be assigned of the assembly line;

[0007] Performing process planning on the to-be-allocated processes to obtain a process planning set;

[0008] Obtaining duration data of each process planning scheme in the process planning set;

[0009] Update and iterate the duration data of each process planning scheme to obtain the target duration data;

[0010] Determine the process planning scheme corresponding to the target duration data as the final assembly line process planning scheme.

[0011] In the above implementation process, by updating and iterating the duration data of each process planning scheme to obtain the optimal target duration data, the process planning efficiency of the assembly line can be improved, and the assembly task can be completed on the basis of consuming less manpower and material resources, which can reduce the assembly time, simplify the planning process, and reasonably and effectively solve the problems of the assembly line in the process of process allocation.

[0012] Furthermore, the step of performing process planning on the to-be-allocated processes to obtain a process planning set includes:

[0013] Determine that the first pending workstation of the assembly line is the first workstation, the second pending workstation is the second workstation, and so on;

[0014] Allocate a first process among the processes to be allocated to the first workstation;

[0015] Performing a feasibility determination on the first process assigned to the first workstation to obtain a determination result;

[0016] The process planning set is obtained according to the determination result.

[0017] In the above implementation process, the to-be-allocated processes are sequentially allocated to the pending workstations of the assembly line, and feasibility determination is performed in a timely manner, so as to timely confirm whether the workstation can execute the corresponding process, thus saving time.

[0018] Furthermore, the step of determining the feasibility of the first process assigned to the first workstation to obtain a determination result includes:

[0019] Acquire resource data of the first workstation, wherein the resource data includes personnel data and time data;

[0020] Determining whether the resource data of the first station is consistent with the first process;

[0021] If so, determining that the determination result is executable;

[0022] If not, the determination result is determined to be unexecutable.

[0023] In the above implementation process, whether the workstation and the process are consistent with each other is determined according to the resource data of the workstation, so as to directly and accurately determine whether the first workstation can execute the first process, thereby reducing the error probability of the process failing to execute.

[0024] Furthermore, the step of obtaining the process planning set according to the determination result includes:

[0025] If the determination result is executable, continue to perform process planning on the second process in the to-be-allocated processes until all processes in the to-be-allocated processes are allocated, thereby obtaining the process planning set;

[0026] If the determination result is that it is not executable, re-planning is performed on the to-be-allocated process to obtain the process planning set.

[0027] In the above implementation process, when the judgment result is executable, further allocation is continued for the allocated processes to ensure that each process can be quickly and accurately matched to the corresponding workstation for production, thereby improving process allocation efficiency and reducing allocation errors.

[0028] Furthermore, before the step of iteratively updating the duration data of each process planning scheme to obtain the target duration data, the step includes:

[0029] Determine whether the number of iterations reaches a first threshold;

[0030] If so, determine the duration data with the smallest value in the duration data as the target duration data;

[0031] If not, the duration data of each process planning scheme is updated and iterated to obtain the target duration data.

[0032] In the above implementation process, the duration data of each process planning scheme is continuously iterated, and the shortest duration data is found within a limited number of iterations, which can reduce resource consumption and space occupation and reduce costs.

[0033] Furthermore, the step of iteratively updating the duration data of each process planning scheme to obtain the target duration data includes:

[0034] Reorder the preset process segments in each process planning scheme to obtain a new process planning set;

[0035] Obtaining duration data of each process planning scheme in the new process planning set;

[0036] Determine that all process planning schemes and their corresponding duration data in the new process planning set are a first set;

[0037] Selecting the process planning schemes whose duration data in the first set reaches the second threshold, and determining the process planning schemes whose duration data in the first set reaches the second threshold and their corresponding duration data as the second set;

[0038] The second set is updated to obtain the target duration data.

[0039] In the above implementation process, reordering the preset process segments in each process planning scheme can effectively shorten the time spent on process planning, ensure the accuracy of process planning, and improve the efficiency of process planning.

[0040] Furthermore, the step of reordering the preset process segments in each process planning scheme to obtain a new process planning set includes:

[0041] Selecting any two process planning schemes from each process planning scheme as the first process planning scheme and the second process planning scheme;

[0042] Rearranging the preset process segments in the first process planning scheme according to the preset process execution order in the second process planning scheme to obtain a third process planning scheme;

[0043] By analogy, after reordering each process planning scheme, multiple third process planning schemes are obtained, and a process planning set consisting of the multiple third process planning schemes is determined as the new process planning set.

[0044] In the above implementation process, the preset process segments in the first process planning scheme are reordered according to the preset process execution order in the second process planning scheme to avoid violating the process sequence constraints and ensure the rationality of the process planning.

[0045] Furthermore, the step of updating the second set to obtain the target duration data includes:

[0046] Obtaining a discovery probability of each process planning scheme in the second set;

[0047] Determining whether the discovery determination probability is less than a third threshold;

[0048] If so, reorder the current process planning scheme according to the neighboring process planning schemes of the current process planning scheme to obtain a third set;

[0049] Determine the duration data with the smallest value in the third set as the target duration data.

[0050] In the above implementation process, the second set is further updated, and the target duration data is selected in the updated third set, so that the process planning scheme with the shortest time can be effectively selected to ensure that the process planning is feasible.

[0051] In a second aspect, an embodiment of the present application further provides an assembly line process planning device, the device comprising:

[0052] An acquisition module, used for acquiring the to-be-allocated process of the assembly line;

[0053] A process planning module, used for performing process planning on the to-be-allocated processes to obtain a process planning set;

[0054] A data acquisition module, used to obtain the duration data of each process planning scheme in the process planning set;

[0055] The update and iteration module is used to update and iterate the duration data of each process planning scheme to obtain the target duration data;

[0056] A selection module is used to determine that the process planning scheme corresponding to the target duration data is the final assembly line process planning scheme.

[0057] In the above implementation process, by updating and iterating the duration data of each process planning scheme to obtain the optimal target duration data, the process planning efficiency of the assembly line can be improved, and the assembly task can be completed on the basis of consuming less manpower and material resources, which can reduce the assembly time, simplify the planning process, and reasonably and effectively solve the problems of the assembly line in the process of process allocation.

[0058] In a third aspect, an embodiment of the present application provides an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method described in any one of the first aspects when executing the computer program.

[0059] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which instructions are stored. When the instructions are executed on a computer, the computer executes the method as described in any one of the first aspects.

[0060] Other features and advantages of the present disclosure will be set forth in the following description, or some features and advantages may be inferred or unambiguously determined from the description, or may be learned by implementing the above-mentioned technology of the present disclosure.

[0061] And it can be implemented according to the contents of the specification. The following is a detailed description of the preferred embodiments of the present application with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0062] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the range values. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying any creative work.

[0063] Figure 1 A schematic diagram of a process flow of an assembly line process planning method provided in an embodiment of the present application;

[0064] Figure 2 A schematic diagram of the structure of the reordering algorithm provided in the embodiment of the present application;

[0065] Figure 3 A schematic diagram of the structural composition of an assembly line process planning device provided in an embodiment of the present application;

[0066] Figure 4A schematic diagram of the structural composition of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0067] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0068] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0069] The specific implementation methods of the present application are further described in detail below in conjunction with the accompanying drawings and examples. The following examples are used to illustrate the present application, but are not used to limit the scope of the present application.

[0070] Embodiment 1

[0071] Figure 1 is a flow chart of the assembly line process planning method provided in the embodiment of the present application, such as Figure 1 As shown, the method includes:

[0072] S1, obtain the process to be assigned to the assembly line;

[0073] S2, perform process planning on the processes to be assigned and obtain a process planning set;

[0074] S3, obtaining the duration data of each process planning scheme in the process planning set;

[0075] S4, updating and iterating the duration data of each process planning scheme to obtain the target duration data;

[0076] S5, determining the process planning scheme corresponding to the target duration data as the final assembly line process planning scheme.

[0077] In the above implementation process, by updating and iterating the duration data of each process planning scheme to obtain the optimal target duration data, the process planning efficiency of the assembly line can be improved, and the assembly task can be completed on the basis of consuming less manpower and material resources, which can reduce the assembly time, simplify the planning process, and reasonably and effectively solve the problems of the assembly line in the process of process allocation.

[0078] Furthermore, S2 includes:

[0079] Determine the first pending workstation of the assembly line as the first workstation, the second pending workstation as the second workstation, and so on;

[0080] Allocate the first process among the processes to be allocated to the first workstation;

[0081] Performing a feasibility determination on the first process assigned to the first workstation and obtaining a determination result;

[0082] A process planning set is obtained according to the determination result.

[0083] In the above implementation process, the to-be-allocated processes are sequentially allocated to the pending workstations of the assembly line, and feasibility determination is performed in a timely manner, so as to timely confirm whether the workstation can execute the corresponding process, thus saving time.

[0084] Assume that there are multiple identical workstations on a multi-person co-station assembly line (among which, workstations that are not fully occupied, that is, workstations that can still process processes, are called pending workstations). Each workstation can accommodate several people working at the same time and is enabled for a maximum of a certain period of time each day. There are a limited number of processes for the products that need to be processed on this assembly line, and the processes can be processed at any workstation. Some processes have prerequisite processes, that is, the prerequisite processes required by the prerequisite process must be completed before the process can be processed.

[0085] Furthermore, the step of performing a feasibility determination on the first process assigned to the first workstation to obtain a determination result includes:

[0086] Obtain resource data of the first workstation, the resource data including personnel data and time data;

[0087] Determine whether the resource data of the first station is consistent with the first process;

[0088] If so, determine that the judgment result is executable;

[0089] If not, the determination result is determined to be unenforceable.

[0090] In the above implementation process, whether the workstation and the process are consistent with each other is determined based on the resource data of the workstation, so as to directly and accurately determine whether the first workstation can execute the first process, thereby reducing the error probability of the process failing to execute.

[0091] In the embodiment of the present application, each process planning scheme adopts a sequential coding method, each number represents the corresponding process number, and their order in the process planning scheme represents the order in which they are assigned.

[0092] Each time a new pending workstation is opened, it is necessary to re-acquire the personnel data and time data of the workstation, that is, the number of workers working at the workstation and the time available for processing and production.

[0093] Select the first process (first process) of the processes to be assigned, assign it to the first workstation for processing, and determine whether the first process can be processed at the current workstation (first workstation), that is, determine whether there are enough workers and time resources at the workstation.

[0094] Furthermore, the step of obtaining a process planning set according to the determination result includes:

[0095] If the result of the determination is executable, the process planning is continued for the second process in the process to be assigned, until all the processes in the process to be assigned are assigned, and a process planning set is obtained;

[0096] If the judgment result is not executable, re-plan the process for the assigned process to obtain a process planning set.

[0097] In the above implementation process, when the judgment result is executable, further allocation is continued for the allocated processes to ensure that each process can be quickly and accurately matched to the corresponding workstation for production, thereby improving process allocation efficiency and reducing allocation errors.

[0098] If it is executable, arrange the first process to the first workstation, and continue to allocate the next process to be assigned (and so on to the second process, the third process...). If it is not executable, reopen a new pending workstation (and so on to the second workstation, the third workstation...), match the pending processes with the new pending workstations in turn, and if the resource data match each other, assign the pending processes to the new pending workstation for processing. If the resource data do not match, continue matching the new workstation.

[0099] Until all the processes to be assigned are completed, a process planning set consisting of multiple process planning schemes is obtained.

[0100] Further, before S4, including:

[0101] Determine whether the number of iterations reaches a first threshold;

[0102] If yes, determine the duration data with the smallest value in the duration data as the target duration data;

[0103] If not, the duration data of each process planning scheme is updated and iterated to obtain the target duration data.

[0104] In the above implementation process, the duration data of each process planning scheme is continuously iterated, and the shortest duration data is found within a limited number of iterations, which can reduce resource consumption and space occupation and reduce costs.

[0105] The embodiment of the present application uses the number of iterations as the end condition. If the number of iterations reaches a preset value (first threshold), the duration data with the smallest value in the output duration data is the target duration data.

[0106] Before the number of iterations reaches the first threshold, the duration data with the smallest value is saved to prevent the optimal duration data from decreasing, and then the algorithm is iterated (ie, the duration data is updated and iterated).

[0107] Furthermore, S4 includes:

[0108] Reorder the preset process segments in each process planning scheme to obtain a new process planning set;

[0109] Obtaining the duration data of each process planning scheme in the new process planning set;

[0110] Determine all process planning schemes and their corresponding duration data in the new process planning set as the first set;

[0111] Selecting the process planning schemes whose duration data in the first set reaches the second threshold, and determining the process planning schemes whose duration data in the first set reaches the second threshold and their corresponding duration data as the second set;

[0112] The second set is updated to obtain target duration data.

[0113] In the above implementation process, reordering the preset process segments in each process planning scheme can effectively shorten the time spent on process planning, ensure the accuracy of process planning, and improve the efficiency of process planning.

[0114] Furthermore, the steps of reordering the preset process segments in each process planning scheme to obtain a new process planning set include:

[0115] Select any two process planning schemes in each process planning scheme as the first process planning scheme and the second process planning scheme;

[0116] Rearranging the preset process segments in the first process planning scheme according to the preset process execution order in the second process planning scheme to obtain a third process planning scheme;

[0117] By analogy, after reordering each process planning scheme, multiple third process planning schemes are obtained, and a process planning set consisting of the multiple third process planning schemes is determined as a new process planning set.

[0118] In the above implementation process, the preset process segments in the first process planning scheme are reordered according to the preset process execution order in the second process planning scheme to avoid violating the process sequence constraints and ensure the rationality of the process planning.

[0119] In the embodiment of the present application, the process planning problem of the assembly line can be regarded as a discrete problem. The reordering method of the present application is obtained by improving the cuckoo algorithm. The Levy flight formula in the cuckoo algorithm is used to update the position of individuals in the iterative process of the algorithm, and has strong local search capabilities and certain global search capabilities. Among them, the individual in the embodiment of the present application refers to the process planning scheme, and the population refers to the process planning set.

[0120] For the Levy formula acting on the continuous domain, a sufficient number of short steps are used to search in a small range, and a long step is used to jump out of the local optimum in a large range. Therefore, this application does not directly use the update of individual numerical values ​​(duration data of the process planning scheme), but uses the step distribution rule to replace the length distribution of individual data segments that need to be changed in each iteration, that is, the Levy operator is used to specify the individual data segments (preset process segments) that need to be reordered, which can preserve the characteristics of the Levy operator while meeting the encoding requirements of discrete problems.

[0121] After specifying the length of the data segment for individual redistribution (preset process segment), it is also necessary to specify a redistribution operator. This application uses the strong plasticity of the crossover and mutation operators in the classic genetic algorithm to implement it, and makes adaptive modifications to the genetic algorithm to reorder the data in the crossover segment of the selected individual A to the corresponding order in the individual B, avoiding violation of the process sequence constraint. The reordering method of this application is as follows Figure 2 shown.

[0122] In one iteration, the Levy flight formula is used to calculate the length of individual cross-segments (preset process segments), and the cross-operator is used for updating. After the update, the duration data of each process planning scheme in the new process planning set is calculated. Before the number of iterations reaches the first threshold, some process planning schemes with shorter duration data are selected for further updating and iteration.

[0123] Furthermore, the step of updating the second set to obtain target duration data includes:

[0124] Obtain the discovery probability of each process planning scheme in the second set;

[0125] Determining whether the discovery judgment probability is less than a third threshold;

[0126] If so, reorder the current process planning scheme according to its neighboring process planning schemes to obtain a third set;

[0127] The duration data with the smallest value in the third set is determined as the target duration data.

[0128] In the above implementation process, the second set is further updated, and the target duration data is selected in the updated third set, so that the process planning scheme with the shortest time can be effectively selected to ensure that the process planning is feasible.

[0129] For each process planning scheme in the second set, the probability of being discovered is compared with the pre-set process planning scheme (the third threshold). If it is less than the third threshold, the individual (process planning scheme) is updated according to the adjacent individuals (process planning schemes). The updating method is to use the Levy formula in S4 to calculate the updated length segment (preset process segment), and then update the segment information (preset process segment) of the adjacent individual to the updated individual by calculating the crossover operator.

[0130] Before the number of iterations reaches the first threshold, the duration data is continuously updated, and the target duration data is updated until the update iteration is completed.

[0131] The embodiment of the present application transforms the process allocation problem of the assembly line into a search problem that needs to balance the local optimum and the global optimum, explores a variety of process allocation solutions for multiple people to work together, improves the ability to solve the process allocation problem, effectively improves assembly efficiency, simplifies complex problems, and greatly shortens the process completion time.

[0132] Embodiment 2

[0133] In order to execute the method corresponding to the above embodiment 1 to achieve the corresponding functions and technical effects, an assembly line process planning device is provided below, such as Figure 3 As shown, the device comprises:

[0134] An acquisition module 1 is used to acquire the process to be allocated of the assembly line;

[0135] Process planning module 2, used for performing process planning on the to-be-allocated processes and obtaining a process planning set;

[0136] The data acquisition module 3 is used to obtain the duration data of each process planning scheme in the process planning set;

[0137] The updating and iterating module 4 is used to update and iterate the duration data of each process planning scheme to obtain the target duration data;

[0138] The selection module 5 is used to determine the process planning scheme corresponding to the target duration data as the final assembly line process planning scheme.

[0139] In the above implementation process, by updating and iterating the duration data of each process planning scheme to obtain the optimal target duration data, the process planning efficiency of the assembly line can be improved, and the assembly task can be completed on the basis of consuming less manpower and material resources, which can reduce the assembly time, simplify the planning process, and reasonably and effectively solve the problems of the assembly line in the process of process allocation.

[0140] Furthermore, the process planning module 2 is also used for:

[0141] Determine the first pending workstation of the assembly line as the first workstation, the second pending workstation as the second workstation, and so on;

[0142] Allocate the first process among the processes to be allocated to the first workstation;

[0143] Performing a feasibility determination on the first process assigned to the first workstation and obtaining a determination result;

[0144] A process planning set is obtained according to the determination result.

[0145] In the above implementation process, the to-be-allocated processes are sequentially allocated to the pending workstations of the assembly line, and feasibility determination is performed in a timely manner, so as to timely confirm whether the workstation can execute the corresponding process, thus saving time.

[0146] Furthermore, the process planning module 2 is also used for:

[0147] Obtain resource data of the first workstation, the resource data including personnel data and time data;

[0148] Determine whether the resource data of the first station is consistent with the first process;

[0149] If so, determine that the judgment result is executable;

[0150] If not, the determination result is determined to be unenforceable.

[0151] In the above implementation process, whether the workstation and the process are consistent with each other is determined according to the resource data of the workstation, so as to directly and accurately determine whether the first workstation can execute the first process, thereby reducing the error probability of the process failing to execute.

[0152] Furthermore, the process planning module 2 is also used for:

[0153] If the result of the determination is executable, the process planning is continued for the second process in the process to be assigned, until all the processes in the process to be assigned are assigned, and a process planning set is obtained;

[0154] If the judgment result is not executable, re-plan the process for the assigned process to obtain a process planning set.

[0155] In the above implementation process, when the judgment result is executable, further allocation is continued for the allocated processes to ensure that each process can be quickly and accurately matched to the corresponding workstation for production, thereby improving process allocation efficiency and reducing allocation errors.

[0156] Furthermore, the update iteration module 4 is also used for:

[0157] Determine whether the number of iterations reaches a first threshold;

[0158] If yes, determine the duration data with the smallest value in the duration data as the target duration data;

[0159] If not, the duration data of each process planning scheme is updated and iterated to obtain the target duration data.

[0160] In the above implementation process, the duration data of each process planning scheme is continuously iterated, and the shortest duration data is found within a limited number of iterations, which can reduce resource consumption and space occupation and reduce costs.

[0161] Furthermore, the update iteration module 4 is also used for:

[0162] Reorder the preset process segments in each process planning scheme to obtain a new process planning set;

[0163] Obtaining the duration data of each process planning scheme in the new process planning set;

[0164] Determine all process planning schemes and their corresponding duration data in the new process planning set as the first set;

[0165] Selecting the process planning schemes whose duration data in the first set reaches the second threshold, and determining the process planning schemes whose duration data in the first set reaches the second threshold and their corresponding duration data as the second set;

[0166] The second set is updated to obtain target duration data.

[0167] In the above implementation process, reordering the preset process segments in each process planning scheme can effectively shorten the time spent on process planning, ensure the accuracy of process planning, and improve the efficiency of process planning.

[0168] Furthermore, the update iteration module 4 is also used for:

[0169] Select any two process planning schemes in each process planning scheme as the first process planning scheme and the second process planning scheme;

[0170] Rearranging the preset process segments in the first process planning scheme according to the preset process execution order in the second process planning scheme to obtain a third process planning scheme;

[0171] By analogy, after reordering each process planning scheme, multiple third process planning schemes are obtained, and a process planning set consisting of the multiple third process planning schemes is determined as a new process planning set.

[0172] In the above implementation process, the preset process segments in the first process planning scheme are reordered according to the preset process execution order in the second process planning scheme to avoid violating the process sequence constraints and ensure the rationality of the process planning.

[0173] Furthermore, the update iteration module 4 is also used for:

[0174] Obtain the discovery probability of each process planning scheme in the second set;

[0175] Determining whether the discovery judgment probability is less than a third threshold;

[0176] If so, reorder the current process planning scheme according to its neighboring process planning schemes to obtain a third set;

[0177] The duration data with the smallest value in the third set is determined as the target duration data.

[0178] In the above implementation process, the second set is further updated, and the target duration data is selected in the updated third set, so that the process planning scheme with the shortest time can be effectively selected to ensure that the process planning is feasible.

[0179] The above-mentioned assembly line process planning device can implement the method of the above-mentioned embodiment 1. The options in the above-mentioned embodiment 1 are also applicable to this embodiment and will not be described in detail here.

[0180] The rest of the contents of the embodiments of the present application can refer to the contents of the above-mentioned embodiment 1, and will not be repeated in this embodiment.

[0181] Embodiment 3

[0182] An embodiment of the present application provides an electronic device, including a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the assembly line process planning method of embodiment 1.

[0183] Optionally, the above-mentioned electronic device may be a server.

[0184] See also Figure 4 , Figure 4The schematic diagram of the structure of the electronic device provided in the embodiment of the present application. The electronic device may include a processor 41, a communication interface 42, a memory 43 and at least one communication bus 44. The communication bus 44 is used to realize direct connection and communication between these components.

[0185] Optionally, the electronic device may further include a storage controller and an input / output unit. The memory 43, the storage controller, the processor 41, the peripheral interface, and the input / output unit are electrically connected to each other directly or indirectly to achieve data transmission or interaction.

[0186] The input and output unit is used to provide users with the task creation and to create an optional time period or preset execution time for the task to enable interaction between the user and the server. The input and output unit can be, but is not limited to, a mouse and a keyboard.

[0187] Understandably, Figure 4 The structure shown is for illustration only. The electronic device may also include Figure 4 More or fewer components as shown, or with Figure 4 Different configurations shown. Figure 4 The components shown in the figure can be implemented by hardware, vehicle-mounted software or a combination thereof.

[0188] In addition, an embodiment of the present application further provides a computer-readable storage medium storing a computer program, which implements the assembly line process planning method of embodiment 1 when executed by a processor.

[0189] The embodiment of the present application also provides a computer program product, which, when running on a computer, enables the computer to execute the method described in the method embodiment.

[0190] The above description is only an embodiment of the present application and is not intended to limit the protection scope of the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application. It should be noted that similar numbers and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0191] The above is only a specific implementation of the present application, but the protection range of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical range disclosed in the present application, which should be included in the protection range of the present application. Therefore, the protection range of the present application should be based on the protection range of the claims.

Claims

1. A method for planning assembly line process, characterized in that: The method comprises: Obtain the process to be assigned of the assembly line; Performing process planning on the to-be-allocated processes to obtain a process planning set; Obtaining duration data of each process planning scheme in the process planning set; Update and iterate the duration data of each process planning scheme to obtain the target duration data; Determine the process planning scheme corresponding to the target duration data as the final assembly line process planning scheme.

2. The assembly line process planning method according to claim 1, characterized in that: The step of performing process planning on the to-be-allocated processes to obtain a process planning set includes: Determine that the first pending workstation of the assembly line is the first workstation, the second pending workstation is the second workstation, and so on; Allocate a first process among the processes to be allocated to the first workstation; Performing a feasibility determination on the first process assigned to the first workstation to obtain a determination result; The process planning set is obtained according to the determination result.

3. The assembly line process planning method according to claim 2, characterized in that: The step of determining the feasibility of the first process assigned to the first workstation to obtain a determination result includes: Acquire resource data of the first workstation, wherein the resource data includes personnel data and time data; Determining whether the resource data of the first station is consistent with the first process; If so, determining that the determination result is executable; If not, the determination result is determined to be unexecutable.

4. The assembly line process planning method according to claim 2, characterized in that: The step of obtaining the process planning set according to the determination result comprises: If the determination result is executable, continue to perform process planning on the second process in the processes to be allocated until all processes in the processes to be allocated are allocated, thereby obtaining the process planning set; If the determination result is that it is not executable, re-planning is performed on the to-be-allocated process to obtain the process planning set.

5. The assembly line process planning method according to claim 1, characterized in that: Before the step of iteratively updating the duration data of each process planning scheme to obtain the target duration data, the method includes: Determine whether the number of iterations reaches a first threshold; If so, determine the duration data with the smallest value in the duration data as the target duration data; If not, the duration data of each process planning scheme is updated and iterated to obtain the target duration data.

6. The assembly line process planning method according to claim 1, characterized in that: The step of iteratively updating the duration data of each process planning scheme to obtain the target duration data includes: Reorder the preset process segments in each process planning scheme to obtain a new process planning set; Obtaining duration data of each process planning scheme in the new process planning set; Determine that all process planning schemes and their corresponding duration data in the new process planning set are the first set; Selecting the process planning schemes whose duration data in the first set reaches the second threshold, and determining the process planning schemes whose duration data in the first set reaches the second threshold and their corresponding duration data as the second set; The second set is updated to obtain the target duration data.

7. The assembly line process planning method according to claim 6, characterized in that: The step of reordering the preset process segments in each process planning scheme to obtain a new process planning set includes: Selecting any two process planning schemes from each process planning scheme as the first process planning scheme and the second process planning scheme; Rearranging the preset process segments in the first process planning scheme according to the preset process execution order in the second process planning scheme to obtain a third process planning scheme; By analogy, after reordering each process planning scheme, multiple third process planning schemes are obtained, and a process planning set consisting of the multiple third process planning schemes is determined as the new process planning set.

8. The assembly line process planning method according to claim 6, characterized in that: The step of updating the second set to obtain the target duration data includes: Obtaining a discovery probability of each process planning scheme in the second set; Determining whether the discovery determination probability is less than a third threshold; If so, reorder the current process planning scheme according to the neighboring process planning schemes of the current process planning scheme to obtain a third set; Determine the duration data with the smallest value in the third set as the target duration data.

9. An assembly line process planning device, characterized in that: The device comprises: An acquisition module, used for acquiring the to-be-allocated process of the assembly line; A process planning module, used for performing process planning on the to-be-allocated processes to obtain a process planning set; A data acquisition module, used to obtain the duration data of each process planning scheme in the process planning set; The update and iteration module is used to update and iterate the duration data of each process planning scheme to obtain the target duration data; A selection module is used to determine that the process planning scheme corresponding to the target duration data is the final assembly line process planning scheme.

10. An electronic device, characterized in that: The electronic device comprises a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the assembly line process planning method according to any one of claims 1 to 8.

11. A storage medium, characterized in that: It stores a computer program, which, when executed by a processor, implements the assembly line process planning method as claimed in any one of claims 1 to 8.

Images