Pipeline operation scheduling method and system

Abstract

The present invention provides a pipeline job scheduling method and system. The pipeline job scheduling method of the present invention includes obtaining n jobs to be scheduled, combining the obtained n jobs to obtain all job combinations, determining the job combinations that meet the preset requirements among all the obtained job combinations, sorting the job combinations that meet the preset requirements according to the preset priority principle, and outputting the sorting result. The pipeline job scheduling method of the present invention can obtain the priority sorting of different job combinations according to the input job information, so as to facilitate the determination of the optimal job combination. It can achieve fast job scheduling, improve the job scheduling efficiency, and reduce the labor cost of job schedulers, thus having good practicability.

Description

Technical Field

[0001] The present invention relates to the technical field of pipeline management, and in particular to a method for arranging pipeline operations. At the same time, the present invention also relates to a system for arranging pipeline operations. Background Art

[0002] Man-hour balance is usually referred to as job arrangement balance and job saturation problem. It is an important research content in production process arrangement and management. Maximizing the balance of man-hours plays a very important role in improving production efficiency and reducing the number of operating personnel.

[0003] Taking the automobile final assembly line as an example, the current method for achieving man-hour balance on the automobile final assembly line is generally achieved through multiple rounds of verification and adjustment. Its general process is to prepare a version of job division before production, conduct statistics on the current situation of personnel man-hours during trial production and small-batch production and make adjustments. After multiple rounds of adjustments, it is expected to obtain a job arrangement with balanced man-hours. However, the sorting of often 2,000 operations is involved on the automobile final assembly line. The above-mentioned method of manually arranging operations on the final assembly line requires repeated adjustments, resulting in a long arrangement cycle.

[0004] Moreover, due to factors such as minimizing the switching of operation tools by operating personnel during the arrangement process to reduce the time waste caused by tool switching, keeping the working areas of the same operating personnel as close as possible to reduce the man-hour waste caused by walking, and ensuring that the parts assembled at the previous workstation do not affect the assembly of parts at the subsequent workstation, it is also difficult to obtain a job sorting result with a high balance rate (balance rate = actual operation time of personnel / cycle time of the pipeline). A lower balance rate will lead to an increase in the number of front-line operating personnel, which is not conducive to reducing production costs. Summary of the Invention

[0005] In view of this, the present invention aims to propose a method for arranging pipeline operations, which can achieve rapid operation arrangement, improve the efficiency of operation arrangement, and reduce the personnel cost of operation arrangement.

[0006] To achieve the above object, the technical solution of the present invention is realized as follows:

[0007] A method for arranging pipeline operations, the method comprising:

[0008] Obtaining n operations to be arranged;

[0009] Combining the obtained n operations to obtain all operation combinations;

[0010] Determining the operation combinations that meet the preset requirements among all the obtained operation combinations;

[0011] Sorting the operation combinations that meet the preset requirements according to the preset priority principle;

[0012] Output the sorting result.

[0013] Further, the combining of the n jobs to obtain all job combinations includes:

[0014] Combining the obtained n jobs through a binary algorithm to obtain 2 n-1 job combinations.

[0015] Further, the determining of the job combinations that meet the preset requirements among all job combinations includes:

[0016] Judging whether the job combination working hours T z of each job combination satisfy 80% * T ≤ T z ≤ 100% * T, where T z represents the sum of the working hours of each job in the job combination, and T represents the assembly line working hours;

[0017] Determine the job combinations that satisfy 80% * T ≤ T z ≤ 100% * T as the job combinations that meet the preset requirements.

[0018] Further, the determining of the job combinations that meet the preset requirements among all job combinations further includes:

[0019] Judging whether each job in each job combination satisfies the preset constraint relationship, where the preset constraint relationship at least includes that the sequence of each job meets the assembly sequence requirements;

[0020] Determine the job combinations that simultaneously satisfy 80% * T ≤ T z ≤ 100% * T and the preset constraint relationship as the job combinations that meet the preset requirements.

[0021] Further, the determining of the job combinations that meet the preset requirements among all job combinations further includes:

[0022] Judging whether the working heights of each job in each job combination are the same;

[0023] Determine the job combinations that simultaneously satisfy 80% * T ≤ T z ≤ 100% * T, the preset constraint relationship, and the working heights of each job are the same as the job combinations that meet the preset requirements.

[0024] Further, the sorting of the job combinations that meet the preset requirements according to the preset priority principle includes:

[0025] Obtain the key elements related to each job combination, the weights of each key element, and the priority levels included in each key element;

[0026] Sort each operation combination according to the weights of each key element and the priority levels included in each key element, in descending order of priority.

[0027] Furthermore, the key elements at least include tool usage, connector usage, operation area, and operation combination man-hour T z The proportion in the assembly line man-hour T; where:

[0028] The tool usage, the connector usage, the operation area, and the operation combination man-hour T z The weights of the proportions in the assembly line man-hour T increase in turn;

[0029] The priority levels included in the tool usage, from high to low, at least include: Level 1: No tool in the operation combination or all operations use the same tool, Level 2: Some operations have tools and the tools are the same, Level 3: Some operations have tools and the tools are different;

[0030] The priority levels included in the connector usage, from high to low, at least include: Level 1: No connector in the operation combination or all operations use the same connector, Level 2: Some operations have connectors and the connectors are the same, Level 3: Some operations have connectors and the connectors are different;

[0031] The priority levels included in the operation area, from high to low, at least include: Level 1: All operations in the operation combination belong to the same small operation area, Level 2: All operations in the operation combination belong to different small operation areas but belong to the same large operation area, Level 3: All operations in the operation combination belong to different large operation areas;

[0032] The operation combination man-hour T z Is the sum of the man-hours of each operation in the operation combination, and the operation combination man-hour T z The priority levels included in the proportion in the assembly line man-hour T, from high to low, at least include: Level 1: 87%T ≤ T z ≤ 98%T, Level 2: 98%T < T z ≤ 100%T, Level 3: 80%T ≤ T z < 87%T.

[0033] Compared with the prior art, the assembly line operation arrangement method of the present invention has the following advantages:

[0034] The pipeline operation scheduling method described in the present invention combines the operations to be scheduled to obtain all operation combinations, then determines the operation combinations that meet the preset requirements, and sorts the operation combinations that meet the preset requirements according to the preset priority principle. It can automatically obtain the priority sorting of different operation combinations through calculation according to the design requirements, so as to facilitate the determination of the optimal operation combination. Thus, it can achieve fast operation scheduling, improve the operation scheduling efficiency, and reduce the operation scheduling personnel cost, and has good practicability.

[0035] The present invention also proposes a pipeline operation scheduling system, which includes:

[0036] An input module, which is used to obtain n operations to be scheduled;

[0037] A first processing module, which is used to combine the n operations obtained to obtain all operation combinations;

[0038] A determination module, which is used to determine the operation combinations that meet the preset requirements among all the obtained operation combinations;

[0039] A second processing module, which is used to sort the operation combinations that meet the preset requirements according to the preset priority principle;

[0040] An output module, which is used to output the sorting result.

[0041] Further, the first processing module combines the n operations obtained through a binary algorithm and obtains 2 n-1 operation combinations.

[0042] Further, the determination module includes a first judgment sub-module and a determination sub-module;

[0043] The first judgment sub-module is used to judge whether the operation combination working hours T z of each operation combination satisfy 80% * T ≤ T z ≤ 100% * T, where T z represents the sum of the working hours of each operation in the operation combination, and T represents the pipeline working hours;

[0044] The determination sub-module is used to determine the operation combinations that satisfy 80% * T ≤ T z ≤ 100% * T as the operation combinations that meet the preset requirements.

[0045] Further, the determination module further includes a second judgment sub-module;

[0046] The second judgment sub-module is used to judge whether each operation in each operation combination meets the preset constraint relationship, where the preset constraint relationship at least includes that the sequence of each operation meets the assembly sequence requirement;

[0047] The determination sub-module determines the operation combinations that simultaneously satisfy 80%*T ≤ T z ≤ 100%*T and the preset constraint relationship as the operation combinations meeting the preset requirements.

[0048] Furthermore, the determination module further includes a third judgment sub-module;

[0049] The third judgment sub-module is used to judge whether the operation heights of each operation in each operation combination are the same;

[0050] The determination sub-module determines the operation combinations that simultaneously satisfy 80%*T ≤ T z ≤ 100%*T, the preset constraint relationship, and the same operation height of each operation as the operation combinations meeting the preset requirements.

[0051] Furthermore, the second processing module includes an acquisition sub-module and a processing sub-module;

[0052] The acquisition sub-module is used to acquire each key element related to each operation combination, the weight of each key element, and the priority level included in each key element;

[0053] The processing sub-module is used to sort each operation combination according to the weight of each key element and the priority level included in each key element in the order of priority from high to low

[0054] Compared with the prior art, the advantages of the pipeline operation scheduling system of the present invention are the same as those of the above pipeline operation scheduling method, which will not be elaborated here. Description of the Drawings

[0055] The drawings constituting a part of the present invention are used to provide a further understanding of the present invention. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation to the present invention. In the drawings:

[0056] Figure 1 is the flowchart of the pipeline operation scheduling method described in the embodiment of the present invention;

[0057] Figure 2 is the schematic diagram of the permutation and combination of four operations A1, A2, A3, and A4 obtained;

[0058] Figure 3 is the flowchart of determining the operation combinations meeting the preset requirements described in the embodiment of the present invention;

[0059] Figure 4 Flow chart for sorting job combinations according to preset priority principles in the embodiments of the present invention;

[0060] Figure 5 Schematic diagram of job area division in the embodiments of the present invention;

[0061] Figure 6 Schematic diagram of the composition of the pipeline job scheduling system in the embodiments of the present invention;

[0062] Description of reference numerals:

[0063] 100, input module;

[0064] 200, first processing module;

[0065] 300, determination module; 301, first judgment sub-module; 302, second judgment sub-module; 303, third judgment sub-module; 304, determination sub-module;

[0066] 400, second processing module; 401, acquisition sub-module; 402, processing sub-module;

[0067] 500, output module. Detailed implementation manners

[0068] It should be noted that, without conflict, the embodiments in the present invention and the features in the embodiments may be combined with each other.

[0069] In the description of the present invention, it should be noted that if terms indicating orientation or positional relationship such as "upper", "lower", "inner", "outer", etc. appear, they are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be construed as a limitation to the present invention. In addition, if terms such as "first", "second", etc. appear, they are also only for descriptive purposes and cannot be construed as indicating or implying relative importance.

[0070] In addition, in the description of the present invention, unless otherwise clearly defined, the terms "installation", "connection", "connection", "connector" should be understood in a broad sense. For example, it may be a fixed connection, a detachable connection, or an integral connection; it may be a mechanical connection or an electrical connection; it may be directly connected, or indirectly connected through an intermediate medium, and it may be the internal communication of two elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention may be understood in combination with specific situations.

[0071] The present invention will be described in detail below with reference to the drawings and in combination with embodiments.

[0072] Example 1

[0073] This embodiment relates to a pipeline operation scheduling method for scheduling operations on a pipeline to achieve work hour balance on the pipeline, enable fast operation scheduling, improve operation scheduling efficiency, and reduce operation scheduling personnel costs.

[0074] Among them, the pipeline operation scheduling method of this embodiment can be applied to operation scheduling on an automotive final assembly line, for example.

[0075] And, as Figure 1 shown, the pipeline operation scheduling method of this embodiment includes the following steps:

[0076] Step S100: Obtain n operations to be scheduled.

[0077] In an automotive final assembly line, an operation generally refers to completing an assembly task, and the time taken to complete this assembly task, that is, the work hour of the operation corresponding to this assembly task.

[0078] In an automotive final assembly line, since the beat of the pipeline is generally greater than the work hour of a single operation to be scheduled, multiple operations need to be assigned to the same operator, and this process is called operation combination. The pipeline operation scheduling method of this embodiment is to find the optimal operation combination assigned to the same operator.

[0079] Generally, there are 2000 operations involved in an automotive final assembly line, and the scheduling method of this embodiment can obtain these 2000 operations during scheduling. However, considering that the operator's position is fixed and he usually performs assembly operations at a fixed location, in order to reduce the scheduling workload and improve the scheduling efficiency, during scheduling, only the operations related to the operator's position and work location can be obtained, and these operations can be combined and sorted, etc.

[0080] For the operations to be scheduled obtained, when obtaining each operation, generally, the work hour of the operation, whether connectors and tools are used during the operation, the operation height, the operation area, and the restrictive relationship between this operation and other operations are obtained.

[0081] Among them, as mentioned above, the work hour of an operation is the time required for an operator to complete this operation. The connectors used during the operation mainly refer to bolts, nuts, etc., and the tools used mainly refer to sockets. The operation height is generally divided into two types: high and low, and the operation area refers to the position of this operation in the whole vehicle. The restrictive relationship between this operation and other operations refers to the mutual restriction in the assembly sequence between this operation and other operations based on the prior and subsequent order of vehicle component assembly.

[0082] Step S200: Combine the obtained n jobs to get all job combinations.

[0083] After obtaining the n jobs to be scheduled, as a preferred implementation form, the scheduling method of this embodiment can combine the obtained n jobs through a binary algorithm to get 2 n-1 job combinations.

[0084] Specifically, taking the example of obtaining a total of 4 jobs A1, A2, A3, and A4, where one job is a mandatory job, and this mandatory job is, for example, A1. At this time, perform permutation and combination according to the binary algorithm. Refer to Figure 2 as shown, 2 4-1 = 8 job combinations can be obtained.

[0085] Step S300: Determine the job combinations that meet the preset requirements among all the obtained job combinations.

[0086] After obtaining all the job combinations, it is obvious that some job combinations may not meet the job requirements. Therefore, it is necessary to judge each job combination obtained by combination to screen out the job combinations that meet the corresponding requirements.

[0087] In this embodiment, as one of the implementation forms, for example, the job combination working hours T z of the job combination can be judged to determine whether it meets the requirements. At this time, the job combination working hours T z specifically represents the sum of the working hours of each job in the job combination. That is, if the working hours of each job in the job combination are T1, T2...T n , then Tz = T1 +...... + T n .

[0088] In addition, the judgment of the job combination working hours T z mainly depends on the proportion it occupies in the pipeline working hours T. Among them, when the job combination working hours T z of a job combination satisfies 80% * T ≤ T z ≤ 100% * T, it can be considered that the job combination working hours T z of this job combination meets the requirements.

[0089] The job combination working hours T z within the above range indicates that the total time required to complete each job in this job combination is basically the same as the beat of the pipeline, and a good balance can be achieved with the pipeline beat. While the job combination working hours T z not within the above range indicates that there is more idle time after completing the jobs in this job combination, which is not conducive to improving the general assembly efficiency.

[0090] In addition to judging the job combination working hours Tz In other embodiments, it is also possible to further determine whether the operation combination meets the preset requirements by judging whether each operation in the operation combination meets the preset constraint relationship.

[0091] The aforementioned preset constraints at least include ensuring that the sequence of each task satisfies the assembly sequence requirements. In specific implementations, for example, each task can be assigned a number, which includes a constraint code and a constraint relationship number. The constraint code is used to group tasks into different constraint groups, and the constraint relationship number indicates the sequence of the task within the constraint group.

[0092] Specifically, for example, the constraint number of each job is A 0X 0Y (0X = 1, 2, 3, 4...N, 0Y = 1, 2, 3, 4...M), where 0X is the constraint code and 0Y is the constraint relationship number. The smaller constraint number must be assembled before the larger one. In this case, A02 03 and A02 05 belong to the same constraint group, and A02 03 must be assembled before A02 05. However, A02 03 and A05 05 do not constrain each other.

[0093] Therefore, if in a job combination, two jobs belong to the same group, that is, the constraint codes of the two jobs are the same, such as A 0X 0Y In the example, X is 2, but the constraint relationship numbers of the two operations are first large and then small, such as A 0X 0Y The Y in is 4 and 3 respectively. Then, this operation combination does not meet the preset constraint relationship.

[0094] After determining whether the preset constraint relationship is satisfied, the arrangement method of this embodiment will simultaneously satisfy 80%*T≤T z The operation combination with ≤100%*T and preset constraint relationship is determined as the operation combination that meets the preset requirements.

[0095] In addition, in addition to the judgment of the above two conditions, in other embodiments, it is further possible to determine whether the operation combination meets the preset requirements by judging whether the operation heights of each operation in each operation combination are the same.

[0096] If different tasks within a single work group have different working heights, for example, some tasks are performed on the ground and some on a platform, with the ground tasks marked as low and the platform tasks marked as high, there is a risk of collisions when workers go up and down the platform, and this process can also waste work time. Therefore, to minimize collision risks and save work time, different working heights should be avoided for each task within the same work group.

[0097] By marking the working height of each operation, when making a judgment, if the marks of the operations in an operation combination are the same, it indicates that the operation combination meets the requirements of the working height.

[0098] When making judgments on the above three conditions simultaneously, the process of determining the operation combinations that meet the preset requirements among all operation combinations in step S300 of this embodiment is as Figure 3 shown. After judging the working height, the scheduling method of this embodiment will determine the operation combinations that simultaneously meet 80%*T ≤ T z ≤ 100%*T and the preset constraint relationship, and have the same working height for each operation as the operation combinations that meet the preset requirements.

[0099] Step S400: Sort the operation combinations that meet the preset requirements according to the preset priority principle.

[0100] After obtaining the operation combinations that meet the preset requirements, it is necessary to find the optimal combination as the operation content for the operators.

[0101] To find the optimal combination, as Figure 4 shown, as one of the implementation forms, this embodiment specifically includes:

[0102] Step S201: Obtain each key factor related to each operation combination, the weight of each key factor, and the priority level included in each key factor;

[0103] Step S202: Sort each operation combination according to the weight of each key factor and the priority level included in each key factor in descending order of priority.

[0104] Among them, in the automotive final assembly line operation, the above key factors at least include tool use, connector use, operation area, and the proportion of the operation combination working hours T z in the assembly line working hours T.

[0105] According to the degree of importance, the weights of the above tool use, connector use, operation area, and the proportion of the operation combination working hours T z in the assembly line working hours T increase in turn.

[0106] In addition, specifically, the priority levels included in the tool use in this embodiment, from high to low, for example, at least include: Level 1: No tool in the operation combination or all operations use the same tool, Level 2: Some operations have tools and the tools are the same, Level 3: Some operations have tools and the tools are different.

[0107] When there is no tool in the operation combination, or each operation uses tools and the tools are the same, the man-hour waste caused by taking and placing tools in the middle and replacing tools can be avoided. Therefore, the priority level is the highest. When some operations have tools and the tools are the same, although tools need to be taken and placed, tool replacement can be avoided, so the priority level is the second. When some operations have tools and the tools are different, since tools need to be taken and placed and replaced, the priority level is lower.

[0108] In this embodiment, the priority levels of the connectors used, from high to low, for example, at least include: Level 1: There is no connector in the operation combination, or each operation uses connectors and the connectors are the same; Level 2: Some operations have connectors and the connectors are the same; Level 3: Some operations have connectors and the connectors are different.

[0109] The definition of the division of the priority levels of the connector usage is the same as that of the above tool usage.

[0110] In this embodiment, the priority levels of the operation areas included, from high to low, for example, at least include: Level 1: Each operation in the operation combination belongs to the same small operation area; Level 2: Each operation in the operation combination belongs to different small operation areas but belongs to the same large operation area; Level 3: Each operation in the operation combination belongs to different large operation areas.

[0111] During general assembly, the assembly operation areas on a whole vehicle can generally be divided into the front part, the rear part, the left side, the right side, and the interior. Taking the assembly of the automotive interior line as an example, the division of the assembly operation areas can be seen Figure 5 as shown. Among them, several small operation areas are grouped into one large operation area. For example, Figure 5 L1-L4 on the left side of the vehicle belong to the same large operation area 3, and C1-C6 in the interior belong to the same large operation area 6, while L1 and C1 belong to different large operation areas.

[0112] When each operation in the operation combination belongs to the same small operation area, the back-and-forth movement of the operators during the assembly process can be minimized, and man-hour waste can be avoided. Therefore, the priority level is the highest. When each operation in the operation combination belongs to different small operation areas but belongs to the same large operation area, the back-and-forth movement of the operators during the assembly process is slightly more, so the priority level is the second. When each operation in the operation combination belongs to different large operation areas, the back-and-forth movement of the operators during the assembly process is more, and the priority level is lower.

[0113] In this embodiment, for the convenience of description, the proportion of the operation combination man-hour T z in the assembly line man-hour T can be simply referred to as the "man-hour ratio", and the proportion of the operation combination man-hour T z in the assembly line man-hour T, the priority levels included, from high to low, for example, at least include: Level 1: 87%T ≤ T z ≤ 98%T, Level 2: 98%T < Tz ≤100% T, Level 3: 80% T ≤ T z <87% T.

[0114] Total operation time of the operation combination T z When the proportion in the pipeline operation time T is within the range of 87% T ≤ T z ≤ 98% T, the total operation time of the operators is basically consistent with the pipeline beat, and the balance between the two is good, so the priority level is relatively high. Total operation time of the operation combination T z When the proportion in the pipeline operation time T is within the range of 98% T < T z ≤ 100% T, the operators' operations will be a bit hasty, so the priority level is the second. Total operation time of the operation combination T z When the proportion in the pipeline operation time T is within the range of 80% T ≤ T z < 87% T, there is more idle time for the operators after completing the operations, resulting in a lower overall assembly efficiency of the pipeline. Therefore, the priority level is relatively low.

[0115] According to the weights of the above key elements and the priority levels included in each key element, in the order of priority from high to low, sort each operation combination. A part of the sorting result can be shown in Table 1 below.

[0116] When sorting, in the order of weight from high to low, first reduce the priority levels of the key elements with the highest weight in turn, and then reduce the priority levels of the key elements with the second highest weight in turn. And it should be noted that when changing the priority levels of the key elements with the second highest weight, for each priority level of the key elements with the second highest weight, it is still necessary to separately match each priority level of the key elements with the higher weight.

[0117] For example, the weight of the key element operation area is lower than that of the key element working hour ratio. Therefore, when sorting by priority, when the priority level in the operation area is 2, it should separately match the cases where the priority levels in the working hour ratio are 1 - 3 in turn.

[0118] Similarly, the weights of the key elements use of connectors, operation area, and working hour ratio increase in turn. Therefore, for example, when the priority level of the key element use of connectors is 2, it should separately match the cases where the priority levels in the operation area are 1 - 3 in turn. At the same time, in this process, when separately matching the priority level 1, priority level 2, and priority level 3 in the operation area, for each priority level in the operation area, it should also separately match the cases where the priority levels in the working hour ratio are 1 - 3 as described above.

[0119] And so on, the sorting result in Table 1 below can be obtained.

[0120] Table 1. Sorting Results of Operation Combinations (Partial)

[0121]

[0122]

[0123] Step S500: Output the sorting result.

[0124] After the sorting is completed, the above sorting result can be output. After outputting the sorting result, the scheduling staff can determine the job combination of an operator according to the output sorting result.

[0125] At this time, generally, the job combination with the highest priority sorting, that is, the job combination with 1 in the optimal level column in Table 1, can be used as the job combination of the operator. However, based on other considerations, of course, other job combinations with a higher optimal level can also be selected as the job combination of the operator.

[0126] Moreover, after the sorting, of course, the system can also automatically recommend the job combination with the highest priority sorting as the job combination of the operator. The system can identify the priority sorting result by using the code on the rightmost side of Table 1. For example, the job combination with the code 1111 represents the job combination with the optimal level of 1.

[0127] The pipeline job scheduling method of this embodiment combines the jobs to be scheduled to obtain all job combinations, then determines the job combinations that meet the preset requirements, and sorts the job combinations that meet the preset requirements according to the preset priority principle. It can automatically obtain the priority sorting of different job combinations through calculation according to the design requirements, so as to facilitate the determination of the optimal job combination. Thus, the pipeline job scheduling method of this embodiment can achieve fast job scheduling, improve the job scheduling efficiency, and reduce the job scheduling personnel cost, and has good practicability.

[0128] Embodiment 2

[0129] This embodiment relates to a pipeline job scheduling system, which is used to implement the pipeline job scheduling method in Embodiment 1.

[0130] As Figure 6 shown, the pipeline job scheduling system of this embodiment includes an input module 100, a first processing module 200, a determination module 300, a second processing module 400, and an output module 500.

[0131] Among them, the input module 100 is used to obtain n jobs to be scheduled. The first processing module 200 is used to combine the obtained n jobs to obtain all job combinations. The determination module 300 is used to determine the job combinations that meet the preset requirements among all the obtained job combinations. The second processing module 400 is used to sort the job combinations that meet the preset requirements according to the preset priority principle. The output module 500 is used to output the sorting result.

[0132] Specifically, the first processing module 200 of this embodiment combines the n jobs obtained through a binary algorithm and obtains 2 n-1 job combinations.

[0133] The determination module 300 of this embodiment specifically includes a first judgment sub-module 301 and a determination sub-module 304. Among them, the first judgment sub-module 301 is used to judge whether the job combination working hours T of each job combination z satisfies 80% * T ≤ T z ≤ 100% * T, and T z represents the sum of the working hours of each job in the job combination, and T represents the pipeline working hours. The determination sub-module 304 is used to determine the job combinations that satisfy 80% * T ≤ T z ≤ 100% * T as the job combinations that meet the preset requirements.

[0134] In addition, as a further preferred implementation form, the determination module 300 further includes a second judgment sub-module 302. The second judgment sub-module 302 is used to judge whether each job in each job combination meets the preset constraint relationship. Among them, the preset constraint relationship at least includes that the sequence of each job meets the assembly sequence requirements. At this time, the above determination sub-module 304 determines the job combinations that simultaneously satisfy 80% * T ≤ T z ≤ 100% * T and the preset constraint relationship as the job combinations that meet the preset requirements.

[0135] In addition, as a further preferred implementation form, the determination module 300 further includes a third judgment sub-module 303. The third judgment sub-module 303 is used to judge whether the job heights of each job in each job combination are the same. And, at this time, the above determination sub-module 304 determines the job combinations that simultaneously satisfy 80% * T ≤ T z ≤ 100% * T and the preset constraint relationship, and the job heights of each job are the same as the job combinations that meet the preset requirements.

[0136] The second processing module 400 of this embodiment specifically includes an acquisition sub-module 401 and a processing sub-module 402. Among them, the acquisition sub-module 401 is used to acquire each key element related to each job combination, as well as the weights of each key element and the priority levels included in each key element. The processing sub-module 402 is used to sort each job combination according to the weights of each key element and the priority levels included in each key element in descending order of priority.

[0137] The pipeline operation scheduling system of this embodiment inputs the operations to be scheduled, combines the input operations, obtains operation combinations that meet the preset requirements, and then sorts the operation combinations that meet the preset requirements according to the preset priority principle. It can automatically calculate the priority sorting of different operation combinations according to the design requirements, which is conducive to determining the optimal operation combination.

[0138] The pipeline operation scheduling system of this embodiment can achieve fast operation scheduling, improve the operation scheduling efficiency, and reduce the operation scheduling personnel cost, with good practicability.

[0139] Moreover, through comparison, compared with the previous manual scheduling method, using this system for pipeline operation scheduling can achieve the de-skilling of schedulers. Previously, only personnel with more than 3 years of work experience could do a good job in scheduling. Now, personnel with 1 year of work experience can complete the scheduling work after training. Correspondingly, the operation scheduling cycle has been reduced from 2 months * 9 people to 1 month * 3 people. The scheduling work efficiency has been greatly improved, and the number of scheduling personnel has also been significantly reduced.

[0140] The above are only the preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A pipeline operation scheduling method, characterized in that: The method includes: Obtaining n jobs to be scheduled; Combining the obtained n jobs to obtain all job combinations; Determining the job combinations that meet the preset requirements among all the obtained job combinations; Sorting the job combinations that meet the preset requirements according to the preset priority principle; Outputting the sorting result; The determining the job combinations that meet the preset requirements among all job combinations includes: Determine the operation combination man-hour T of each operation combination z Whether it satisfies 80% * T ≤ T z ≤ 100% * T, where T z represents the sum of the man-hours of each operation in the operation combination, and T represents the assembly line man-hour; Determine the job combination that satisfies 80% * T ≤ T z ≤ 100% * T as the job combination that meets the preset requirements; The sorting the job combinations that meet the preset requirements according to the preset priority principle includes: Obtaining key elements related to each job combination, the weights of each key element, and the priority levels included in each key element; Sorting each job combination according to the weights of each key element and the priority levels included in each key element in descending order of priority; The key elements at least include tool usage, connector usage, operation area, and operation combined man-hour T z The proportion in the assembly line man-hour T.

2. The pipeline job scheduling method according to claim 1, wherein: The combining the n jobs to obtain all job combinations includes: Combine the obtained n jobs through a binary algorithm to get 2 n-1 job combinations.

3. The pipeline job scheduling method according to claim 1, wherein: The determining the job combinations that meet the preset requirements among all job combinations further includes: Judging whether each job in each job combination meets the preset constraint relationship, wherein the preset constraint relationship at least includes that the sequence of each job meets the assembly sequence requirement; Determine the job combinations that simultaneously satisfy 80% * T ≤ T z ≤ 100% * T and the preset constraint relationship as the job combinations that meet the preset requirements.

4. The pipeline job scheduling method according to claim 3, wherein: The determining the job combinations that meet the preset requirements among all job combinations further includes: Judging whether the job heights of each job in each job combination are the same; The operation combinations that simultaneously satisfy 80% * T ≤ T z ≤ 100% * T and the preset constraint relationships and in which the operation heights of each operation are the same are determined as operation combinations that meet the preset requirements.

5. The pipeline operation scheduling method according to claim 1, wherein, Wherein: The weights of the proportions of the use of the tool, the use of the connecting piece, the working area, and the total working hours T of the operation combination increase in sequence; z in the proportion in the assembly line working hours T. The priority levels included in the tool usage from high to low at least include: Level 1: no tool in the job combination or each job uses the same tool, Level 2: some jobs have the same tool, Level 3: some jobs have different tools; The priority levels included in the connector usage from high to low at least include: Level 1: no connector in the job combination or each job uses the same connector, Level 2: some jobs have the same connector, Level 3: some jobs have different connectors; The priority levels included in the job area from high to low at least include: Level 1: each job in the job combination belongs to the same small job area, Level 2: each job in the job combination belongs to different small job areas but belongs to the same large job area, Level 3: each job in the job combination belongs to different large job areas; The combined operation man-hour T z is the sum of the man-hours of each operation in the operation combination, and the proportion of the combined operation man-hour T z in the assembly line man-hour T includes at least the following priority levels from high to low: Level 1: 87%T ≤ T z ≤ 98%T, Level 2: 98%T < T z ≤ 100%T, Level 3: 80%T ≤ T z < 87%T.

6. A pipeline operation scheduling system for implementing the method according to claim 1, characterized in that: The system includes: An input module (100), the input module (100) is used to obtain n jobs to be scheduled; A first processing module (200), the first processing module (200) is used to combine the obtained n jobs to obtain all job combinations; A determination module (300), the determination module (300) is used to determine the job combinations that meet the preset requirements among all the obtained job combinations; A second processing module (400), the second processing module (400) is used to sort the job combinations that meet the preset requirements according to the preset priority principle; An output module (500), the output module (500) is used to output the sorting result; The determination module (300) includes a first judgment sub-module (301) and a determination sub-module (304); The first judgment sub-module (301) is used to judge the operation combination man-hour T of each operation combination z whether it satisfies 80% * T ≤ T z ≤ 100% * T, where T z represents the sum of the operation man-hours in the operation combination, and T represents the assembly line man-hour; The determination sub-module (304) is configured to determine a job combination that satisfies 80% * T ≤ T z ≤ 100% * T as a job combination that meets the preset requirements; The second processing module (400) includes an acquisition sub-module (401) and a processing sub-module (402); The acquisition sub-module (401) is configured to acquire each key element related to each job combination, as well as the weight of each key element, and the priority level included in each key element; The processing sub-module (402) is configured to sort each job combination according to the weight of each key element and the priority level included in each key element in descending order of priority.

7. The pipeline operation scheduling system according to claim 6, wherein: The first processing module (200) combines the obtained n jobs through a binary algorithm and obtains 2 n-1 job combinations.

8. The pipeline operation scheduling system according to claim 6, wherein: The determination module (300) further includes a second judgment sub-module (302); The second judgment sub-module (302) is configured to judge whether each job in each job combination satisfies a preset constraint relationship, wherein the preset constraint relationship at least includes that the sequence of each job satisfies the assembly sequence requirement; The determining sub-module (304) determines a job combination that simultaneously satisfies 80% * T ≤ T z ≤ 100% * T and a preset constraint relationship as a job combination that meets the preset requirements.

9. The pipeline operation scheduling system according to claim 8, wherein: The determination module (300) further includes a third judgment sub-module (303); The third judgment sub-module (303) is configured to judge whether the working heights of each job in each job combination are the same; The determination sub-module (304) determines a job combination that simultaneously satisfies 80%*T ≤ T z ≤ 100%*T and a preset constraint relationship, and where the job heights of each job are the same, as a job combination that meets the preset requirements.

Images