Clothing production process distribution method and system, terminal and storage medium

Abstract

The invention provides a clothing production process distribution method and system, a terminal and a storage medium. The method comprises the following steps: acquiring a clothing production process table and employee configuration parameters; the garment production process table is used for recording to-be-distributed in-line group processing processes and an execution sequence thereof; constructing a plurality of employee groups including a specific number of employees based on the employee configuration parameters; a depth-first search algorithm is adopted to explore all process combination schemes for distributing in-line group processing processes to different employee groups according to an execution sequence; and calculating a production line balance rate corresponding to each process combination scheme, and selecting a target process combination scheme according to the production line balance rate. According to the method, a process combination scheme which can meet the balance requirement of a production line and can reduce the operation burden of staff can be quickly screened out, the judgment difficulty and complexity of a process transmittable workstation are remarkably reduced, the time consumption of a prenatal process distribution stage is remarkably shortened, and the overall garment production efficiency is improved.

Description

Technical Field

[0001] The present application belongs to the technical field of garment processing, and relates to a method, system, terminal and storage medium for allocating garment production processes. Background Art

[0002] Before production, garment factories analyze samples to determine all the steps required for the entire production process. This process involves breaking down the manufacturing process of each garment into a series of specific work units, such as pocket installation and collar sewing, and recording in detail the operation method, time required and difficulty of each step.

[0003] Garment production and processing are mainly divided into two modes: in-line processing and off-line processing. In-line processing refers to the production activities of the main production line directly involved in product manufacturing, which covers a series of continuous operation steps from raw materials to finished products, including core processes such as cutting, sewing, ironing and inspection. These steps are usually arranged in a specific order to ensure the continuity and efficiency of production. Off-line processing refers to auxiliary small parts processing and support service activities that are not directly on the line. Although they are not directly involved in the main line production, they are also crucial to ensuring overall production efficiency.

[0004] For the same clothing sample, there are usually multiple feasible process combinations. Traditional process allocation methods are often time-consuming and inefficient. Although in theory, a computer can be used to conduct a comprehensive traversal search to find the optimal solution, in practice it is difficult to achieve a quick response due to the huge amount of calculation. Summary of the invention

[0005] The purpose of the present application is to provide a method, system, terminal and storage medium for allocating clothing production processes, so as to solve the technical problem of low clothing production efficiency caused by time-consuming pre-production process allocation in the prior art.

[0006] In a first aspect, the present application provides a method for allocating clothing production processes, comprising: obtaining a clothing production process table and employee configuration parameters; the clothing production process table is used to record the in-line group processing processes to be allocated and their execution order; the employee configuration parameters include the number of employees and the total number of machines operated by all employees at most; based on the employee configuration parameters, constructing several employee groups including a specific number of employees; using a depth-first search algorithm to explore all process combination schemes that allocate the in-line group processing processes to different employee groups according to the execution order; calculating the production line balance rate corresponding to each of the process combination schemes, and selecting a target process combination scheme based on the production line balance rate.

[0007] In an implementation of the first aspect, obtaining a clothing production process table includes:

[0008] Acquire an in-line group processing process flow chart including several levels; each level in the in-line group processing process flow chart includes at least one in-line group processing procedure, and multiple in-line group processing procedures at the same level are parallel processing procedures;

[0009] Based on the in-line group processing process flow chart, obtain standard parameter information and execution sequence information of each in-line group processing process; the standard parameter information includes standard working hours and post-process information;

[0010] The standard parameter information and the execution sequence information of each of the in-line group processing procedures are recorded to generate the garment production process table.

[0011] In an implementation of the first aspect, the machine flows between workstations on a garment production line according to a specific path, wherein each of the workstations corresponds to a turning node on the path; and based on the employee configuration parameters, constructing a plurality of employee groups including a specific number of employees comprises:

[0012] Starting from the starting point of the clothing production line, a single workstation and / or the workstations corresponding to two adjacent turning nodes located on the same side of the path are collectively defined as a work unit;

[0013] assigning one employee to each of said work units;

[0014] The employees assigned to the work units on opposite sides of the path are paired to form the employee group.

[0015] In an implementation of the first aspect, using a depth-first search algorithm to explore all process combination schemes for allocating the in-line group processing processes to different employee groups according to the execution order includes:

[0016] Numbering the employee groups from small to large along the extension direction of the path;

[0017] For each level in the in-line group processing process flow chart, the sum of the standard working hours corresponding to each in-line group processing procedure at the level is calculated;

[0018] Based on the sum of the standard working hours, determine the employee group number range for placing each of the in-line group processing operations at the level;

[0019] Using a depth-first search algorithm, assigning each of the in-line group processing steps at the level to different employee groups within the corresponding employee group number range;

[0020] The depth-first search algorithm is used to further allocate the in-line group processing procedures that have been allocated to the different employee groups to different employees in the employee group.

[0021] In an implementation of the first aspect, before calculating the production line balance rate corresponding to each process combination scheme, the method further includes:

[0022] Evaluate whether each process combination scheme is normal and obtain an evaluation result;

[0023] According to the evaluation result, the abnormal process combination plan is terminated.

[0024] In an implementation of the first aspect, evaluating whether each process combination scheme is normal, and obtaining an evaluation result includes:

[0025] For each process combination scheme, determine whether the following conditions are met: the average working hours of each employee group in the process combination scheme ≤ the number of employees in the same employee group × 1.5 × the average working hours of all employee groups; the number of machines that each employee in the employee group can operate is within the limited number of machines; and each employee is assigned to a process;

[0026] If yes, mark the process combination scheme as normal;

[0027] Otherwise, the process combination scheme is marked as abnormal.

[0028] In an implementation of the first aspect, calculating the production line balance rate corresponding to each of the process combination schemes, and selecting a target process combination scheme according to the production line balance rate includes:

[0029] For each employee group assigned to a process, calculate the difference between the processing time of each employee in the employee group and the average processing time of all employee groups;

[0030] Calculate the sum of the absolute values ​​of the differences corresponding to all employee groups;

[0031] According to the size of the sum of the absolute values, a process combination scheme with the highest production line balance rate is determined and used as the target process combination scheme.

[0032] In the second aspect, the present application provides a system for allocating clothing production processes, including: a data acquisition module, used to acquire a clothing production process table and employee configuration parameters; the clothing production process table is used to record the in-line group processing processes to be allocated and their execution order; the employee configuration parameters include the number of employees and the total number of machines operated by all employees at most; an employee group construction module, used to construct a number of employee groups including a specific number of employees based on the employee configuration parameters; a process ranking module, used to use a depth-first search algorithm to explore all process combination schemes that allocate the in-line group processing processes to different employee groups according to the execution order; a scheme selection module, used to calculate the production line balance rate corresponding to each of the process combination schemes, and select the target process combination scheme based on the production line balance rate.

[0033] In a third aspect, the present application provides a terminal for allocating clothing production processes, comprising: a memory for storing a computer program; and a processor for executing the computer program stored in the memory so that the terminal executes any of the above-mentioned methods for allocating clothing production processes.

[0034] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for allocating clothing production processes as described in any one of the above items.

[0035] As described above, the method, system, terminal and storage medium for allocating clothing production processes described in the present application can quickly screen out a process combination plan that can both meet the production line balance requirements and reduce the operating burden of employees, significantly reducing the difficulty and complexity of judging the process transferable workstation, significantly shortening the time consumption in the pre-production process allocation stage, and improving the overall clothing production efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Figure 1 Shown is a schematic diagram of the hardware structure of a mobile terminal described in this application in one embodiment.

[0037] Figure 2 A flow chart of an embodiment of a method for allocating garment production processes described in the present application is shown.

[0038] Figure 3 Shown is a schematic diagram of an in-line group processing process flow chart in one embodiment of the present application.

[0039] Figure 4 Shown is a schematic diagram of an embodiment of the garment production process table described in this application.

[0040] Figure 5 Shown is a schematic diagram of an embodiment of the Z-shaped path described in the present application.

[0041] Figure 6 Shown is a schematic diagram of an embodiment of the employee group described in the present application.

[0042] Figure 7 Shown is a flowchart of an embodiment of the depth-first search algorithm described in this application.

[0043] Figure 8 Shown is a flow chart of another embodiment of the depth-first search algorithm described in this application.

[0044] Fig. 9 Shown is a schematic structural diagram of an embodiment of a distribution system for a garment production process described in the present application.

[0045] Fig.10 Shown is a schematic structural diagram of an embodiment of a distribution terminal of a garment production process described in the present application.

[0046] Fig.11 Shown is a schematic diagram of the operating results of a distribution terminal in an embodiment of the clothing production process described in this application.

[0047] Fig.12 A schematic diagram showing a production line balance rate according to an embodiment of the present application is shown.

[0048] Fig.13 A schematic diagram showing a process allocation result described in the present application in one embodiment. DETAILED DESCRIPTION

[0049] The following describes the embodiments of the present application through specific examples, and those skilled in the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification. The present application can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present application. It should be noted that the following embodiments and features in the embodiments can be combined with each other without conflict.

[0050] It should be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present application, and thus the drawings only show components related to the present application rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed at will, and the component layout may also be more complicated.

[0051] In addition, in this application, descriptions such as "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of technical features indicated. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but they must be based on the ability of ordinary technicians in this field to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such combination of technical solutions does not exist and is not within the scope of protection required by this application.

[0052] The following embodiments of the present application provide a method, system, terminal and storage medium for allocating clothing production processes. The technical solution of the present application is applicable to the in-line group processing scenario in the clothing production process, and can effectively solve the technical problem of low clothing production efficiency caused by time-consuming pre-production process allocation in the prior art, thereby achieving the goal of improving overall production efficiency.

[0053] The method for allocating clothing production processes provided in the embodiment of the present application can be run in a mobile terminal, a computer terminal, or similar device. Taking running on the mobile terminal as an example, Figure 1 The hardware structure block diagram of the mobile terminal of the method for allocating the clothing production process is as follows: Figure 1 Taking the mobile terminal as an example, the mobile terminal may include: a processor and a memory, wherein the processor may be a central processing unit, and the memory is used to store data. Figure 1 The mobile terminal in the figure is only used as an example and does not limit the specific structure of the mobile terminal.

[0054] Optionally, the mobile terminal may further include: a communication transmission device and an input and output device.

[0055] Optionally, the memory may be used to store computer programs, such as software programs and modules of application software, and the memory may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory may further include a memory remotely arranged relative to the processor, and these remote memories may be connected to the mobile terminal via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0056] Optionally, the communication transmission device can be used to receive or send data via a network, which may include a wireless network provided by a communication provider of the mobile terminal. The communication transmission device may include a NIC (Network Interface Controller) that can be connected to other network devices through a base station so as to communicate with the Internet.

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

[0058] See also Figure 2 , which is a flow chart of an embodiment of the method for allocating garment production processes described in this application. Figure 2 As shown, the method for allocating clothing production processes provided in the embodiment of the present application may include the following steps S100 to S400.

[0059] In step S100, the garment production process table and employee configuration parameters are obtained.

[0060] Specifically, the garment production process table is used to record the in-line group processing processes to be allocated and their execution order.

[0061] In an embodiment of the present application, step S100 of obtaining a clothing production process table may include the following steps S101 to S103.

[0062] In step S101, an in-line group processing process flow chart including several levels is obtained.

[0063] See also Figure 3 , which is a schematic diagram of the in-line group processing process flow chart described in this application in one embodiment. Figure 3 As shown, each level in the in-line group processing process flow chart includes at least one in-line group processing step.

[0064] In one embodiment of the present application, according to the depth of the in-line processing steps on the in-line processing process flow chart, the execution order of the in-line processing steps at the same level is restricted to be close. This implementation method can meet the demand of transferring the garment parts to be processed without moving personnel.

[0065] It should be noted that the parallel processing steps refer to the fact that the production and processing speeds of the in-line processing steps at the same level are consistent, but these processes may not be completed entirely by the same employee.

[0066] In this implementation, different processes are layered and processed in parallel to achieve optimization and management of the production process, which not only improves production efficiency, but also reduces production costs and ensures the continuity and stability of production.

[0067] In step S102, based on the in-line group processing process flow chart, standard parameter information and execution sequence information of each in-line group processing step are obtained.

[0068] Specifically, the standard parameter information includes standard working hours and post-process information.

[0069] The post-process is the next process to be performed after a specific process is completed. There is a dependency relationship between the previous and next processes. Figure 3 As shown, process 57 is a post-process of process 56 , but process 57 is not a post-process of process 38 .

[0070] In step S103, the standard parameter information and the execution sequence information of each of the in-line group processing steps are recorded to generate the garment production process table.

[0071] Specifically, the standard parameter information and the execution sequence information of the in-line group processing process can be recorded in sequence according to the execution order of the processes, so as to facilitate effective information management.

[0072] See also Figure 4 Shown is a schematic diagram of an embodiment of the garment production process table described in this application. Figure 4 As shown, the garment production process table includes process number, process name, standard working hours, standard thread cutting times, process registration, machine type and post-process.

[0073] In one embodiment of the present application, the employee configuration parameters include the number of employees and the total number of machines most operated by all employees.

[0074] According to actual production conditions, only 10% of employees in a garment factory can be responsible for operating two machines at the same time, and in most cases, one person is responsible for one machine. Therefore, based on the actual production conditions of a garment factory, this application designs a staff-to-machine configuration ratio of ≤1:2, that is, one employee can operate at most two devices.

[0075] It should be noted that the machine utilization rate of this application does not always reach the maximum. Through experiments, it is found that on a clothing production line, employees operating a smaller number of machines can become familiar with the process more quickly, thereby speeding up the increase in production capacity. For example, on a clothing production line with 20 employees, the use of 40 machines is limited. When the user operates 38 of the devices, the balance rate of the production line can reach the optimal solution. Therefore, this application can gradually adjust the number of machines used according to the actual number of employees to achieve better production efficiency and ranking effects.

[0076] In this implementation, by limiting the number of machines, the production line balance rate can be obtained quickly and accurately, thereby effectively reducing the calculation complexity and improving the calculation speed.

[0077] In one embodiment of the present application, the machine flows between various workstations on the garment production line according to a specific path, wherein each of the workstations corresponds to a turning node on the path.

[0078] Specifically, the common flow paths of the machine on the clothing production line include a Z-shaped path and a U-shaped path. Figure 5 , which is a schematic diagram of an embodiment of the Z-shaped path described in the present application.

[0079] During the machine circulation process, employees do not need to move their positions, which means that each employee can complete the designated process at his or her fixed position. This arrangement helps to reduce the movement time of employees, thereby improving work efficiency. At the same time, after the employee completes the process, the material can be passed along the path to the next adjacent employee (only by hand movement) for subsequent processing. This close-range delivery method reduces the transportation time and possible risk of damage to materials, while also enhancing collaboration and communication between employees.

[0080] It should be noted that the application scope of the present application is wide. In addition to the above-mentioned Z-shaped path and U-shaped path, other flow paths that can characterize the front-to-back transmission relationship are also applicable to the present application.

[0081] In step S200, a plurality of employee groups including a specific number of employees are constructed based on the employee configuration parameters.

[0082] In an embodiment of the present application, based on the employee configuration parameters, step S200 of constructing a plurality of employee groups including a specific number of employees may include the following steps S201 to S203.

[0083] In step S201, starting from the starting point of the clothing production line, a single workstation and / or the workstations corresponding to two adjacent turning nodes located on the same side of the path are collectively defined as a work unit.

[0084] In step S202, one employee is assigned to each of the work units.

[0085] In step S203, the employees assigned to the work units on opposite sides of the path are paired to form the employee group.

[0086] In the layout of the Z-shaped path, it is considered a more reasonable arrangement to divide two employees into one employee group. This configuration not only optimizes the efficiency of employee collaboration, but also ensures the smooth operation of each workstation on the production line.

[0087] See also Figure 6 , which is a schematic diagram of an embodiment of the employee group described in this application. Figure 6 As shown in the figure, when the number of employees is an odd number, there is only one employee in one employee group, while the other employee groups maintain the standard configuration of two employees in each group. This flexible grouping method allows the production line to be adjusted according to the actual number of employees, thereby maximizing the use of human resources.

[0088] In the embodiment of the present application, employees are assigned to different employee groups based on the principle that each employee group includes at most two employees and each employee controls at most two workstations on the line. Such an allocation strategy is intended to balance the workload and avoid situations where some employees are overworked while other employees are idle. In this way, it can be ensured that each workstation on the production line receives proper attention and maintenance, thereby improving overall production efficiency and product quality.

[0089] In addition, this grouping method also promotes communication and collaboration among employees. Since each employee group is small, it is easier for employees to establish close working relationships, which helps to solve problems quickly and improve work efficiency. At the same time, the smaller team size also makes supervision and management easier, helping to maintain high standards of work quality and productivity.

[0090] In step S300, a depth-first search algorithm is used to explore all process combination schemes for allocating the in-line group processing processes to different employee groups according to the execution order.

[0091] In one embodiment of the present application, a depth-first search algorithm is used to explore all process combination schemes for allocating the in-line group processing processes to different employee groups according to the execution order, step S300 may include the following steps S301 to S305.

[0092] In step S301, the employee groups are numbered from small to large along the extension direction of the path.

[0093] In step S302, for each level in the in-line group processing process flow chart, the sum of the standard working hours corresponding to each of the in-line group processing steps at the level is calculated.

[0094] In step S303, based on the sum of the standard working hours, a range of employee group numbers for placing each of the in-line group processing operations at the level is determined.

[0095] For example, there are n employee groups on a Z-shaped clothing production line. These employee groups are numbered from the starting point of the clothing production line as employee group 1, employee group 2, to employee group n. The average working time for each employee to complete a process is 60 seconds, so the upper limit of the effective working time that one employee group can bear is 120 seconds, and the upper limit of the effective working time that two employee groups can bear is 240 seconds.

[0096] There are 20 levels in the process flow chart of the in-line group processing, of which the 20th level, as the deepest level, contains only one process with a standard working time of 51 seconds. This value is less than 120 seconds, so the process of the 20th level can be assigned to employee group No. 1 for operation. Furthermore, the 19th level contains two processes, and the standard working times of the two processes are 60 seconds and 110 seconds respectively, so the sum of the standard working times of the 19th level is: 60+110=170 seconds. Adding the standard working times of the 19th and 20th levels, the cumulative working time is: 51+170=221 seconds. For the cumulative working time of the 19th level, this value is greater than the upper limit of the effective working time of one employee group, 120 seconds, and less than the upper limit of the effective working time of two employee groups, 240 seconds, so the process of the 19th level can be assigned to employee group No. 1 and employee group No. 2.

[0097] In order to optimize resource allocation and deal with uncertainties that may arise during the production process, this application also sets a floating range mechanism for employee groups. This mechanism allows flexible adjustment of employee group configuration in actual operations based on production needs and the actual workload of the employee group.

[0098] Specifically, this fluctuation range is set to fluctuate by one to two employee groups, aiming to ensure smooth production processes while improving production efficiency and flexibility.

[0099] Based on this, the process at the 18th level may be assigned to employee group 2 and employee group 3; the process at the 17th level may be assigned to employee group 3 and employee group 4; the process at the 16th level may be assigned to employee group 4, employee group 5 and employee group 6; the process at the 15th level can be assigned to employee group 5, employee group 6 and employee group 7.

[0100] In this implementation, it is possible to ensure that each employee group can complete the work within its capabilities, and at the same time, the workload between the employee groups can be balanced. This reasonable allocation strategy helps to improve the work efficiency and satisfaction of employees, thereby further improving the performance of the entire production line.

[0101] In step S304, a depth-first search algorithm is used to allocate each of the in-line group processing procedures at the level to different employee groups within the corresponding employee group number range.

[0102] The depth-first search algorithm is an algorithm used to traverse or search a tree or graph data structure. The algorithm traverses the nodes of the tree along the depth of the tree, searching the branches of the tree as deeply as possible. When all the edges where the node v is located have been explored, or the node does not meet the search criteria, the search will backtrack to the starting node of the edge where the node v was found and try other possible paths.

[0103] In an embodiment of the present application, the depth-first search algorithm attempts to place the in-line group processing operations in different employee groups in the order of their execution, exploring all possible placement combinations. This means that for each process, the depth-first search algorithm selects an employee group that has not yet reached the maximum capacity for placement, and then continues to process the next process until all processes have been considered. If the current path causes a process to be unable to be placed reasonably (for example, it violates the Z-shaped ranking restrictions or exceeds the effective working hours of the employee group), the algorithm will backtrack to the previous step and try another placement method. In this way, the depth-first search algorithm can traverse all possible process placement situations to find the best or suboptimal solution that meets specific conditions (such as minimizing backflow, maximizing efficiency, etc.).

[0104] See also Figure 7 , which is a flowchart of a depth-first search algorithm described in the present application in an embodiment. In combination with the embodiment provided by step S303, the process 56 of the 19th layer can be allocated to the employee group No. 1 and the employee group No. 2; the process 57 of the 18th layer can be allocated to the employee group No. 2 and the employee group No. 3.

[0105] The depth-first search algorithm will first try to assign process 56 to employee group 1, then process 57 to employee group 2, and after processing this branch, it will backtrack and try to assign process 57 to employee group 3. Then, process 56 will be assigned to employee group 2, and then process 57 will be assigned to employee group 2. After processing this branch, it will backtrack and try to assign process 57 to employee group 3.

[0106] It should be noted that if the previous process of a process has been placed in a specific employee group, then the process must be placed in the employee group of its previous process or the next employee group. This regulation follows the directional principle of assembly line production and aims to prevent the occurrence of reverse flow, which will lead to imbalance of the production line and affect the overall production efficiency.

[0107] Since this application adopts a Z-shaped ranking method, there are some processes in the same employee group that are in a reverse flow state. However, this application allows and maintains the reverse flow situation within the same employee group, but strictly prohibits the reverse flow phenomenon between different employee groups.

[0108] In this implementation, placing the processes based on the execution order information of the processes can minimize the reverse flow of the processes, thereby improving the overall efficiency and stability of the production line. By preliminarily determining the employee group number range and further limiting the placement of the processes, the amount of calculation can be significantly reduced and the efficiency of the algorithm can be improved.

[0109] In step S305, a depth-first search algorithm is used to further allocate the in-line group processing procedures that have been allocated to the different employee groups to different employees in the employee group.

[0110] Specifically, in a group of two employees, the allocation of processes can be flexible and diverse to meet different production needs and optimization goals. The following are two possible allocation methods:

[0111] (1) Some processes are assigned to employee No. 1, and some processes are assigned to employee No. 2.

[0112] In this mode, work processes can be allocated according to the capabilities of employees.

[0113] (2) Employee No. 1 and Employee No. 2 share all the processes equally.

[0114] In this model, all processes are evenly distributed to employee No. 1 and employee No. 2, that is, each employee performs the same process operations and each shares half of the task load.

[0115] See also Figure 8 , which is a flowchart of another embodiment of the depth-first search algorithm described in this application. Figure 8It shows the allocation of some processes. In the first recursion, process 1 is allocated to employee No. 1, and process 2 is allocated to employee No. 1. In the second recursion, process 1 is still allocated to employee No. 1; the allocation of process 2 is changed and it is allocated to employee No. 2. In the third recursion, the allocation of process 1 is changed and it is allocated to employee No. 2; process 2 is allocated to employee No. 1. In the fourth recursion, process 1 is still allocated to employee No. 2; process 2 is allocated to employee No. 2.

[0116] In the embodiment of the present application, the allocation of the deepest unexplored process is changed each time recursion occurs until all possible allocation combinations of all processes are traversed and all process allocation combination schemes are saved.

[0117] It should be noted that when it comes to the allocation of manual processes, it is necessary to ensure that the manual process and its direct predecessor process are assigned to the same employee to ensure process continuity and consistency and reduce quality risks.

[0118] Specifically, if process 4 is a manual process, process 3 is the preceding process of process 4, and process 5 and process 6 are the following processes of process 4, then when allocating process 4, process 4 and process 3 can be allocated to the same employee, and process 5 and process 6 can be allocated to another employee; or process 3, process 4 and process 5 can be allocated to the same employee, and process 6 can be allocated to another employee. However, the allocation method that is not allowed is to allocate process 3 alone to one employee, and process 4, process 5 and process 6 to another employee.

[0119] In step S400, the production line balance rate corresponding to each process combination scheme is calculated, and a target process combination scheme is selected according to the production line balance rate.

[0120] The production line balance rate is an important indicator for evaluating the balance of workload at each workstation on the assembly line. The calculation formula is as follows:

[0121] Production line balance rate = (average working hours / maximum working hours) × 100%.

[0122] When conducting production management, the initial results of the production line balance rate are usually between 70% and 80%, and can eventually reach 90% after optimization. Reaching this level means that the burden on operators on the production line is relatively even.

[0123] In one embodiment of the present application, before executing step S400 and calculating the production line balance rate corresponding to each of the process combination schemes, it also includes: evaluating whether each of the process combination schemes is normal to obtain an evaluation result; and terminating the abnormal process combination scheme according to the evaluation result.

[0124] The core ideas of depth-first search include backtracking and pruning. Backtracking means that when a step cannot be searched forward, the algorithm will return to the previous step and try other possible paths. Pruning means that if a path is found to be impossible to reach the goal during the search process, the search for the path will be terminated in advance to reduce unnecessary calculations.

[0125] In one embodiment of the present application, whether each process combination scheme is normal is evaluated, and the evaluation results obtained include:

[0126] For each process combination scheme, determine whether it satisfies:

[0127] (a) The average working hours of each employee group in the process combination plan is ≤ the number of employees in the same employee group × 1.5 × the average working hours of all employee groups;

[0128] (b) The number of machines that each employee in the employee group can operate is within the limit of the number of machines;

[0129] (c) Each employee is assigned to a process;

[0130] If so, the process combination scheme is marked as normal; otherwise, the process combination scheme is marked as abnormal.

[0131] Specifically, the process combination schemes that do not meet conditions (a) to (c) can be marked as false. For the process combination schemes marked as false, the corresponding production line balance rate calculation is no longer performed. When the same process combination is encountered again, the results can be quickly obtained by querying the previous mark, thereby saving calculation time.

[0132] In one embodiment of the present application, the production line balance rate corresponding to each of the process combination schemes is calculated, and a target process combination scheme is selected based on the production line balance rate, including: for each employee group assigned to a process, calculating the difference between the processing time of each employee in the employee group and the average working hours of all employee groups; calculating the sum of the absolute values ​​of the differences corresponding to all the employee groups; and determining the process combination scheme with the highest production line balance rate based on the size of the sum of the absolute values, and using it as the target process combination scheme.

[0133] Theoretically, the smaller the sum of the absolute values, the closer the employee's processing time is to the average working hours of all employee groups, the more balanced the production line operation is, and the more reasonable the process allocation results are.

[0134] It should be noted that the protection scope of the method for allocating clothing production processes described in the embodiment of the present application is not limited to the execution order of the steps listed in this embodiment. All solutions implemented by adding, reducing or replacing steps in the prior art based on the principles of the present application are included in the protection scope of the present application.

[0135] See also Fig. 9 , which is a schematic structural diagram of an embodiment of a distribution system for a garment production process described in the present application.

[0136] like Fig. 9 As shown, an embodiment of the present application provides a system for allocating clothing production processes, including a data acquisition module, an employee group construction module, a process ranking module and a scheme optimization module.

[0137] Specifically, the data acquisition module is used to obtain the clothing production process table and employee configuration parameters; the clothing production process table is used to record the in-line group processing processes to be assigned and their execution order; the employee configuration parameters include the number of employees and the total number of machines operated by all employees at most.

[0138] The employee group building module is used to build a plurality of employee groups including a specific number of employees based on the employee configuration parameters.

[0139] The process ranking module is used to use a depth-first search algorithm to explore all process combination solutions for allocating the in-line group processing processes to different employee groups according to the execution order.

[0140] The scheme optimization module is used to calculate the production line balance rate corresponding to each process combination scheme, and select a target process combination scheme according to the production line balance rate.

[0141] It should be noted that the structures and principles of the data acquisition module, the employee group construction module, the process ranking module and the scheme optimization module correspond one-to-one to the steps in the above-mentioned clothing production process allocation method, so they are not repeated here.

[0142] The clothing production process allocation system provided in the embodiment of the present application can implement the clothing production process allocation method described in the present application, but the implementation device of the clothing production process allocation method described in the present application includes but is not limited to the structure of the clothing production process allocation system listed in the present embodiment. All structural deformations and replacements of the prior art made according to the principles of the present application are included in the protection scope of the present application.

[0143] See also Fig.10 , which is a schematic diagram of the structure of a distribution terminal in an embodiment of the clothing production process described in this application. Fig.10 As shown, an embodiment of the present application provides a distribution terminal for a clothing production process, including a memory and a processor.

[0144] Specifically, the memory is used to store computer programs.

[0145] The processor is used to execute the computer program stored in the memory, so that the terminal executes any one of the above-mentioned methods for allocating clothing production processes.

[0146] See also Fig.11 , which is a schematic diagram showing the operation results of the distribution terminal of the clothing production process described in this application in one embodiment.

[0147] See also Fig.12 , which is a schematic diagram of the production line balance rate described in the present application in one embodiment.

[0148] See also Fig.13 , which is a schematic diagram showing the process allocation result described in the present application in an embodiment.

[0149] When allocating processes for a clothing production line containing 50 processes, this application can generate a feasible process arrangement plan within 20 seconds, which basically meets the production scheduling requirements of a medium-sized main line. This result shows that the algorithms and technologies used in this application are highly efficient and practical in dealing with complex production scheduling problems.

[0150] In the several embodiments provided in the present application, it should be understood that the disclosed system, device or method can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of modules / units is only a logical function division. There may be other division methods in actual implementation, such as multiple modules or units can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or modules or units, which can be electrical, mechanical or other forms.

[0151] The modules / units described as separate components may or may not be physically separated, and the components displayed as modules / units may or may not be physical modules, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules / units may be selected according to actual needs to achieve the purpose of the embodiments of the present application. For example, the functional modules / units in the various embodiments of the present application may be integrated into one processing module, or each module / unit may exist physically separately, or two or more modules / units may be integrated into one module / unit.

[0152] Those of ordinary skill in the art should further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in the above description according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0153] The present application embodiment also provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by the processor, the allocation method of the clothing production process described in any of the above items is implemented. A person of ordinary skill in the art can understand that all or part of the steps in the method for implementing the above embodiment can be completed by instructing the processor through a program, and the program can be stored in a computer-readable storage medium, and the storage medium is a non-transitory medium, such as a random access memory, a read-only memory, a flash memory, a hard disk, a solid-state hard disk, a magnetic tape, a floppy disk, an optical disc, and any combination thereof. The above storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or a data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a digital video disc (DVD)), or a semiconductor medium (e.g., a solid-state disk (SSD)), etc.

[0154] The present application embodiment may also provide a computer program product, the computer program product including one or more computer instructions. When the computer instructions are loaded and executed on a computing device, the process or function described in the embodiment of the present application is generated in whole or in part. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, computer or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer or data center.

[0155] When the computer program product is executed by a computer, the computer executes the method described in the above method embodiment. The computer program product may be a software installation package, and when the above method is required, the computer program product may be downloaded and executed on a computer.

[0156] The descriptions of the processes or structures corresponding to the above-mentioned figures have different emphases. For parts that are not described in detail in a certain process or structure, please refer to the relevant descriptions of other processes or structures.

[0157] The above embodiments are merely illustrative of the principles and effects of the present application and are not intended to limit the present application. Anyone familiar with the technology may modify or change the above embodiments without violating the spirit and scope of the present application. Therefore, all equivalent modifications or changes made by a person of ordinary skill in the art without departing from the spirit and technical ideas disclosed in the present application shall still be covered by the claims of the present application.

Claims

1. A method for allocating clothing production processes, characterized in that: include: Obtaining a garment production process table and employee configuration parameters; the garment production process table is used to record the in-line group processing processes to be assigned and their execution order; the employee configuration parameters include the number of employees and the total number of machines that all employees operate at most; Based on the employee configuration parameters, construct a plurality of employee groups including a specific number of employees; Using a depth-first search algorithm, exploring all process combination schemes for allocating the in-line group processing processes to different employee groups according to the execution order; The production line balance rate corresponding to each process combination scheme is calculated, and a target process combination scheme is selected according to the production line balance rate.

2. The method according to claim 1, characterized in that: Obtaining the clothing production process table includes: Acquire an in-line group processing process flow chart including several levels; each level in the in-line group processing process flow chart includes at least one in-line group processing procedure, and multiple in-line group processing procedures at the same level are parallel processing procedures; Based on the in-line group processing process flow chart, obtain standard parameter information and execution sequence information of each in-line group processing process; the standard parameter information includes standard working hours and post-process information; The standard parameter information and the execution sequence information of each of the in-line group processing procedures are recorded to generate the garment production process table.

3. The method according to claim 1, characterized in that: The machine flows between various workstations on the garment production line according to a specific path, wherein each of the workstations corresponds to a turning node on the path; Based on the employee configuration parameters, constructing a plurality of employee groups including a specific number of employees includes: Starting from the starting point of the clothing production line, a single workstation and / or the workstations corresponding to two adjacent turning nodes located on the same side of the path are collectively defined as a work unit; assigning one employee to each of said work units; The employees assigned to the work units on opposite sides of the path are paired to form the employee group.

4. The method according to claim 3, characterized in that Using a depth-first search algorithm, exploring all process combination schemes for allocating the in-line group processing processes to different employee groups according to the execution order includes: Numbering the employee groups from small to large along the extension direction of the path; For each level in the in-line group processing process flow chart, the sum of the standard working hours corresponding to each in-line group processing procedure at the level is calculated; Based on the sum of the standard working hours, determine the employee group number range for placing each of the in-line group processing operations at the level; Using a depth-first search algorithm, assigning each of the in-line group processing steps at the level to different employee groups within the corresponding employee group number range; The depth-first search algorithm is used to further allocate the in-line group processing procedures that have been allocated to the different employee groups to different employees in the employee group.

5. The method according to claim 1, characterized in that Before calculating the production line balance rate corresponding to each process combination scheme, it also includes: Evaluate whether each process combination scheme is normal and obtain an evaluation result; According to the evaluation result, the abnormal process combination plan is terminated.

6. The method according to claim 5, characterized in that Evaluate whether each process combination is normal, and obtain the following evaluation results: For each process combination scheme, determine whether the following conditions are met: the average working hours of each employee group in the process combination scheme ≤ the number of employees in the same employee group × 1.5 × the average working hours of all employee groups; the number of machines that each employee in the employee group can operate is within the limited number of machines; and each employee is assigned to a process; If yes, mark the process combination scheme as normal; Otherwise, the process combination scheme is marked as abnormal.

7. The method according to claim 1, characterized in that Calculating the production line balance rate corresponding to each process combination scheme, and selecting the target process combination scheme according to the production line balance rate includes: For each employee group assigned to a process, calculate the difference between the processing time of each employee in the employee group and the average processing time of all employee groups; Calculate the sum of the absolute values ​​of the differences corresponding to all employee groups; According to the size of the sum of the absolute values, a process combination scheme with the highest production line balance rate is determined and used as the target process combination scheme.

8. A distribution system for clothing production processes, characterized in that: include: A data acquisition module is used to acquire a garment production process table and employee configuration parameters; the garment production process table is used to record the in-line group processing processes to be assigned and their execution order; the employee configuration parameters include the number of employees and the total number of machines most operated by all employees; An employee group building module, used to build a number of employee groups including a specific number of employees based on the employee configuration parameters; A process ranking module, used for using a depth-first search algorithm to explore all process combination schemes for allocating the in-line group processing processes to different employee groups according to the execution order; The scheme optimization module is used to calculate the production line balance rate corresponding to each process combination scheme, and select the target process combination scheme according to the production line balance rate.

9. A distribution terminal for a garment production process, characterized in that: include: Memory for storing computer programs; A processor is used to execute the computer program stored in the memory so that the terminal executes the method for allocating clothing production processes according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method for allocating clothing production processes according to any one of claims 1 to 7 is implemented.

Images