Maintenance operation team number determination method and system, electronic equipment and software product

Abstract

The invention discloses a method and system for determining the number of maintenance work teams and groups, electronic equipment and a software product. The method comprises the following steps: S1, setting the number of equipment to be maintained, a completion probability index within specified time, a time mean value for overhauling single equipment and an initial value of the number of the teams and groups; s2, traversing to generate an equipment quantity result Ms of each team after overhauling; s3, traversing and calculating a corresponding probability pj according to a jth line repair result of the Ms; s4, calculating the maintenance probability P of all equipment according to each pj, and comparing the maintenance probability P with an index P ', when P'is greater than P ', after one team is added, executing the step S2, otherwise, executing the step S5; and S5, outputting the currently solved team number and the probability P of completing all equipment maintenance. According to the method, the maintenance team configuration number meeting the requirements can be economically and accurately given, and waste of labor cost is effectively avoided while it is guaranteed that maintenance work is completed on time.

Description

Technical Field

[0001] The present invention belongs to the technical field of equipment safety maintenance, and relates to a method, system, electronic equipment and software product for determining the number of maintenance work teams. Background Art

[0002] According to the maintenance workload, it is an important part of formulating a maintenance work plan to reasonably allocate a certain number of maintenance teams. When the maintenance work has a large uncertainty in time, if the number of maintenance teams is too small, it is likely that the maintenance work cannot be completed on time; if the number of maintenance teams is too large, it will lead to unnecessary cost increases. For example, before the summer comes, a commercial building will repair many public air conditioners in the building. If the air conditioner is normal, maintenance work such as sterilization and disinfection will be carried out; if the air conditioner is detected to be faulty, it will be repaired. Because the causes of the faults are different, the time it takes to repair the faults is also different. In addition, during the repair process, additional delays will be caused due to reasons such as insufficient spare parts. Random faults like this will lead to uncertainty in the final maintenance time of the air conditioner. The greater the uncertainty, the more difficult it is to reasonably determine the number of maintenance teams. For example, when multiple computer terminals on multiple floors of an office building cannot access the company's file server or the external network. It is necessary to conduct horizontal and vertical inspections, such as confirming whether the configuration of the core switch is normal, whether each access point can be pinged, and whether the hardware itself is damaged. The time for troubleshooting and the time for handling the problem after it is identified are uncertain. As uncertainty continues to increase, it is difficult to reasonably allocate the number of maintenance teams. At present, it is a common problem to reasonably determine the number of maintenance teams. It mainly relies on the work experience of relevant personnel to solve it, and it is difficult to stably obtain the optimal configuration plan. Summary of the invention

[0003] In order to solve the above technical problems, the present invention provides a method, system, storage medium and product for automatically generating the number of maintenance work teams.

[0004] In a first aspect, the present invention provides a method for determining the number of maintenance work teams, comprising the following steps:

[0005] Step 1: Set the number of equipment to be repaired n, the completion probability index P′, and the average time consumed to repair a single equipment u; initialize the number of maintenance work teams N=2; wherein the completion probability is the probability of completing the maintenance of all equipment within the specified time T, and u obeys the exponential distribution Exp(μ);

[0006] Step 2: Traverse and generate the equipment to complete the number matrix Ms; where the matrix Ms has N columns, and the data Ms in the j-th row of Ms (j,:) j,i satisfy The row data Ms(j, :) is the j-th permutation of the number of equipment repaired by each maintenance team, and Ms j,i is the number of equipment repaired by maintenance team i;

[0007] Step 3: Initialize the row number j of matrix Ms to 1. The intermediate matrix Sp has 1 + N columns and Sp is initially an empty matrix. Calculate the probability p that the number of equipment repaired by the maintenance team is the row data Ms(j, :). j ;

[0008] Step 4: Let the completion probability where m is the number of rows of Ms. Compare it with the index P'. If P < P', increase the number of maintenance teams, update N = N + 1, and then go back to execute Step 2; otherwise, execute Step 5.

[0009] Step 5: Output the number of maintenance teams N and its completion probability P, where N is the minimum number of maintenance teams whose completion probability is not lower than the index requirement.

[0010] Preferably, the specific implementation of Step 3 includes the following sub-steps:

[0011] Step 3.1: Let S1 = Ms j,1 , and then sort the N - 1 data from Ms j,2 to Ms j,N in ascending order, and save the sorting results to S2, S3... S N in sequence. Denote the array S = {S1, S2, S3... S N};

[0012] Step 3.2: In the first N columns of matrix Sp, search row by row for the row data that is exactly equal to the array S.

[0013] If there is row data in matrix Sp that is exactly equal to the array S, that is: Sp j′,i = S i holds, then let p j = Sp j′,1+N , and execute Step 3.4; where j' is the corresponding row number, 1 ≤ i ≤ N.

[0014] If there is no row data in matrix Sp that is exactly equal to the array S, then execute Step 3.3.

[0015] Step 3.3: Let the probability In the formula μ is the mean of variable x, Γ(x) is the gamma function, x is the time for team 1 to repair S1 - 1 equipment, and t is the completion time;

[0016] Step 3.4: Update \(j = j + 1\). If \(j\leq m\), then loop back to execute Step 3.1; otherwise, execute Step 4, where \(m\) is the number of rows of \(M_s\).

[0017] In a second aspect, the present invention also provides a system for determining the number of maintenance operation teams, which is characterized by including the following modules:

[0018] Module 1, used to set the number of devices \(n\) to be maintained, the completion probability index \(P'\), and the average time consumption for maintaining a single device is \(\mu\); initialize the number of maintenance operation teams \(N = 2\); where the completion probability is the probability of completing the maintenance of all devices within the specified time \(T\), and \(\mu\) follows an exponential distribution \(Exp(\mu)\);

[0019] Module 2, used to traverse and generate the device completion quantity matrix \(M_s\); where the matrix \(M_s\) has \(N\) columns, and each data \(M\) in the \(j\)-th row data \(M_s(j, :)\) of \(M_s\) j,i satisfies The \(j\)-th row data \(M_s(j, :)\) is the \(j\)-th permutation of the number of devices repaired by each maintenance operation team, and \(M\) j,i is the number of devices repaired by the \(i\)-th maintenance operation team;

[0020] Module 3, used to initialize the row number \(j = 1\) of the matrix \(M_s\), the intermediate matrix \(S_p\) has \(1 + N\) columns, and \(S_p\) is initially an empty matrix; calculate the probability \(p\) that the number of devices repaired by the maintenance operation team is the row data \(M_s(j, :)\) j ;

[0021] Module 4, used to make the completion probability where \(m\) is the number of rows of \(M_s\); compare with the index \(P'\). If \(P < P'\), then increase the number of maintenance operation teams, update \(N = N + 1\), and then loop back to execute Module 2; otherwise, execute Module 5;

[0022] Module 5, used to output the number of maintenance operation teams \(N\) and its completion probability \(P\), where \(N\) is the minimum number of maintenance teams whose completion probability is not lower than the index requirement.

[0023] Preferably, the specific implementation of Module 3 includes the following sub-modules:

[0024] Module 3.1, used to make \(S_1 = M_s\) j,1 , and then sort the \(N - 1\) data from \(M_s\) j,2 to \(M_s\) j,N in ascending order, and save the sorting results to \(S_2, S_3, \cdots, S\) N in sequence, and record the array \(S=\{S_1, S_2, S_3, \cdots, S\}\) N ;

[0025] Module 3.2, used to search row by row in the first \(N\) columns of the matrix \(S_p\) for row data that is exactly equal to the array \(S\);

[0026] If there is row data in the matrix Sp that is exactly the same as the array S, that is: Sp j′,i =S i If it holds, then let p j =Sp j′,1+N , and execute module 3.4; where j′ is the corresponding row number, 1≤i≤N;

[0027] If there is no row data in the matrix Sp that is completely equal to the array S, execute module 3.3;

[0028] Module 3.3, used to make the probability In the formula μ is the mean of the variable x, Γ(x) is the gamma function, x is the time it takes for Team 1 to repair S1-1 equipment, and t is the completion time;

[0029] Module 3.4 is used to update j=j+1. If j≤m, it returns to execute module 3.1, otherwise it executes module 4; wherein m is the number of rows of Ms.

[0030] In a third aspect, the present invention further provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the method for automatically generating the number of maintenance work teams is implemented when the processor executes the program.

[0031] In a fourth aspect, the present invention further provides a software product, including a computer program, which, when executed by a processor, implements the method for automatically generating the number of maintenance work teams.

[0032] In a fifth aspect, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the method for automatically generating the number of maintenance work teams is implemented.

[0033] Compared with the prior art, the beneficial effects of the present invention are:

[0034] After statistically analyzing the historical data of the actual time of equipment maintenance, this method can accurately estimate the probability of completing maintenance based on the expected time T for completing maintenance and the number of maintenance teams N. When the probability value is small, the number of maintenance teams is appropriately increased to ensure that the maintenance can be reliably completed within the time T. This method allows managers to get rid of the previous practice of relying on the work experience of front-line maintenance personnel to configure the number of maintenance teams. Through the company's maintenance work information management system, it automatically proposes a scientific and reasonable number of maintenance teams to assist managers in making scientific decisions. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] The technical solution of the present invention is further described below using embodiments and specific implementation methods. In addition, in the process of describing the technical solution, some drawings are also used. For those skilled in the art, other drawings and the intention of the present invention can also be obtained based on these drawings without paying creative work.

[0036] Figure 1 A flow chart of a method according to an embodiment of the present invention;

[0037] Figure 2 This is a simulation verification of the completion probability of the above example when the number of maintenance work teams in the experiment of the embodiment of the present invention is 2, 3, 4, 5, and 6 respectively.

[0038] Figure 3 This is a simulation verification of the completion probabilities corresponding to different maintenance completion times when the number of maintenance work teams is 6 in the experiment of the embodiment of the present invention. DETAILED DESCRIPTION

[0039] In order to facilitate ordinary technicians in the field to understand and implement the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the implementation examples described herein are only used to illustrate and explain the present invention, and are not used to limit the present invention.

[0040] In this embodiment, the number of equipment to be repaired is recorded as n, the number of maintenance teams is recorded as N, and all maintenance teams start to repair equipment at the same time. Only one team is needed to repair one equipment. Each team can continue to repair the next equipment only after completing the repair of the current equipment. The time when the equipment repair is finally completed is regarded as the time when the maintenance work is completed. Since the root variance and mean of random variables subject to exponential distribution are equal, this distribution is a typical representative of "large uncertainty". In this embodiment, it is assumed that the time to repair a piece of equipment is a random variable subject to exponential distribution Exp(μ), and its probability density function μ is the mean of the variable x.

[0041] Please see Figure 1 This embodiment provides a method for determining the number of maintenance work teams, including the following steps:

[0042] Step 1: Set the number of equipment to be repaired n, the completion probability index P′, and the average time consumed to repair a single equipment u; initialize the number of maintenance work teams N=2; wherein the completion probability is the probability of completing the maintenance of all equipment within the specified time T, and u obeys the exponential distribution Exp(μ);

[0043] Step 2: Traverse and generate the equipment to complete the number matrix Ms; where the matrix Ms has N columns, and the data Ms in the j-th row of Ms (j,:) j,i satisfy The row data Ms(j, :) is the j-th permutation of the number of equipment repaired by each maintenance team, and Ms j,i is the number of equipment repaired by maintenance team i;

[0044] Step 3: Initialize the row number j of the matrix Ms to 1. The intermediate matrix Sp has 1 + N columns, and Sp is initially an empty matrix; calculate the probability p that the number of equipment repaired by the maintenance team is the row data Ms(j, :). j ;

[0045] In one implementation, the specific implementation of Step 3 includes the following sub-steps:

[0046] Step 3.1: Let S1 = Ms j,1 , and then sort the N - 1 data from Ms j,2 to Ms j,N in ascending order, and save the sorting results to S2, S3... S N in sequence, and record the array S = {S1, S2, S3... S N};

[0047] Step 3.2: In the first N columns of the matrix Sp, search row by row for the row data that is exactly equal to the array S;

[0048] If there is row data in the matrix Sp that is exactly equal to the array S, that is: Sp j′,i = S i holds, then let p j = Sp j′,1+N , and execute Step 3.4; where j' is the corresponding row number, 1 ≤ i ≤ N;

[0049] If there is no row data in the matrix Sp that is exactly equal to the array S, then execute Step 3.3;

[0050] Step 3.3: Let the probability where μ is the mean of x, Γ(x) is the gamma function, x is the time for team 1 to repair S1 - 1 equipment, and t is the completion time;

[0051] Step 3.4: Update j = j + 1. If j ≤ m, then loop back to execute Step 3.1, otherwise execute Step 4; where m is the number of rows of Ms.

[0052] Step 4: Let the completion probability where m is the number of rows of Ms; compare with the index P', if P < P', then increase the number of maintenance teams, update N = N + 1 and loop back to execute Step 2; otherwise, execute Step 5;

[0053] Step 5: Output the number N of maintenance operation teams and their completion probability P, where N is the minimum number of maintenance teams with a completion probability not lower than the index requirement.

[0054] This embodiment also provides a system for determining the number of maintenance operation teams, including the following modules:

[0055] Module 1 is used to set the number n of devices to be maintained, the completion probability index P′, and the average time consumption u for maintaining a single device; initialize the number N of maintenance operation teams to 2; where the completion probability is the probability of completing the maintenance of all devices within the specified time T, and u follows an exponential distribution Exp(μ);

[0056] Module 2 is used to traverse and generate the device completion quantity matrix Ms; where the matrix Ms has N columns, and each data Ms in the data Ms(j, :) of the j-th row of Ms j,i satisfies The row data Ms(j, :) is the j-th permutation of the number of devices repaired by each maintenance operation team, and Ms j,i is the number of devices repaired by maintenance operation team i.

[0057] Module 3 is used to initialize the row number j of the matrix Ms to 1. The intermediate matrix Sp has 1 + N columns, and Sp is initially an empty matrix; calculate the probability p that the number of devices repaired by the maintenance operation team is the row data Ms(j, :) j ;

[0058] Module 4 is used to make the completion probability where m is the number of rows of Ms; compare it with the index P′. If P < P′, then increase the number of maintenance operation teams, update N = N + 1, and then loop back to execute Module 2; otherwise, execute Module 5;

[0059] Module 5 is used to output the number N of maintenance operation teams and their completion probability P, where N is the minimum number of maintenance teams with a completion probability not lower than the index requirement.

[0060] This embodiment also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, it implements the method for automatically generating the number of maintenance operation teams.

[0061] This embodiment also provides a software product, including a computer program, and when the computer program is executed by a processor, it implements the method for automatically generating the number of maintenance operation teams.

[0062] This embodiment also provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements the method for automatically generating the number of maintenance operation teams.

[0063] The present invention is further described below through specific experiments.

[0064] In the experiment, the average time taken by a team to repair a piece of equipment is set to 4.5 hours, and the maintenance time follows an exponential distribution. Now the probability of completing the maintenance of 30 pieces of equipment within 40 hours is required to be no less than 0.9. Using the method of the present invention, how many maintenance teams are needed at least?

[0065] 1) Input known information;

[0066] Input the number of equipment to be repaired n = 30, the completion probability index P′ = 0.9, the average time consumed to repair a single equipment u = 4.5, and obey the exponential distribution Exp(μ). Initialize the number of maintenance teams N = 2.

[0067] 2) Traverse and generate the equipment completion quantity matrix Ms. The results are shown in Table 1.

[0068] 3) Calculate the probability p that the number of equipment repaired by the maintenance team is the number of data in each row Ms(j,:) j , the results are shown in Table 1.

[0069] Table 1 Completion quantity matrix Ms and the corresponding probability of each row of data when N=2

[0070]

[0071]

[0072] 4) Let the completion probability Compare with the index P'. If P<0.9, increase the number of maintenance teams, update N=N+1 and execute 2).

[0073] After executing 2) to 4) several times, when N = 6, the completion probability P = 0.938, which is greater than the indicator P′, and 5) is executed.

[0074] 5) Terminate the calculation and output the number of maintenance teams: 6 and their completion probability: 0.938.

[0075] This experiment further established a relevant simulation model to verify the above results. Figure 1 Table 2 and Table 3 are the simulation verification results of the completion probability of the above example when the number of maintenance teams is 2, 3, 4, 5, and 6 respectively. Figure 2 The simulation verification of the completion probability corresponding to different maintenance completion times when the number of maintenance teams is 6 is shown.

[0076] Table 2 Simulation verification results of completion probability of different maintenance teams

[0077]

[0078] The simulation results show that the results of the method of the present invention are highly consistent with the simulation results. The method of the present invention can economically and accurately provide the number of maintenance team configurations that meet the requirements, effectively avoiding the waste of manpower costs while ensuring that the maintenance work is completed on time.

[0079] It should be understood that the embodiments described above are part of the embodiments of the present invention, rather than all of the embodiments. In addition, the technical features in the various embodiments or single embodiments provided by the present invention can be combined with each other arbitrarily to form a feasible technical solution. Such combination is not restricted by the sequence of steps and / or the structural composition mode, but must be based on the ability of ordinary technicians in the field to implement. When the combination of technical solutions is contradictory or cannot be implemented, it should be considered that such combination of technical solutions does not exist and is not within the protection scope required by the present invention.

[0080] It should be understood that the above description of the preferred embodiment is relatively detailed and cannot be regarded as limiting the scope of patent protection of the present invention. Under the enlightenment of the present invention, ordinary technicians in this field can also make substitutions or modifications without departing from the scope of protection of the claims of the present invention, which all fall within the scope of protection of the present invention. The scope of protection requested for the present invention shall be based on the attached claims.

Claims

1. A method for determining the number of maintenance work teams, characterized in that: The following steps are involved: Step 1: Set the number of equipment to be repaired n, the completion probability index P′ within the specified time T, and the average time consumed to repair a single equipment u; initialize the number of maintenance work teams N = 2; Step 2: Traverse and generate the equipment to complete the number matrix Ms; where the matrix Ms has N columns, and the data Ms in the j-th row of Ms (j,:) j,i satisfy The row data Ms(j,:) is the jth arrangement of the number of equipment repaired by each maintenance team. j,i is the number of equipment repaired by maintenance team i; Step 3: Initialize the row number j of the matrix Ms to 1, the intermediate matrix Sp has 1+N columns, and Sp is initially an empty matrix; calculate the probability p that the number of equipment repaired by the maintenance team is the row data Ms(j,:) j ; Step 4: Compare the completion probability with the index P'. If P < P', increase the number of maintenance operation teams, update N = N + 1, and then loop back to execute Step 2; otherwise, execute Step 5. Here, m is the number of rows of Ms. Step 5: Output the number of maintenance teams N and their completion probability P, where N is the minimum number of maintenance teams with a completion probability not lower than the index requirement.

2. The method for determining the number of maintenance work teams according to claim 1, characterized in that: In step 1, the completion probability is the probability of completing the maintenance of all equipment within the specified time T, and u obeys the exponential distribution Exp(μ).

3. The method for determining the number of maintenance work teams according to claim 1, characterized in that: The specific implementation of step 3 includes the following sub-steps: Step 3.1: Let S1 = Ms j,1 , then to Ms. j,2 ~Ms. j,N These N-1 data are sorted from small to large, and the sorting results are saved in S2, S3, ... S N In the example, let array S = {S1, S2, S3…S N }; Step 3.2: In the first N columns of the matrix Sp, search row by row for row data that is completely equal to the array S; If there is row data in the matrix Sp that is exactly the same as the array S, that is: Sp j′,i =S i If it holds, then let p j =Sp j′,1+N , and execute step 3.4; where j′ is the corresponding row number, 1≤i≤N; If there is no row data in the matrix Sp that is completely equal to the array S, execute step 3.3; Step 3.3: Let the probability In the formula μ is the mean of x, Γ(x) is the gamma function, x is the time it takes for Team 1 to repair S1-1 equipment, and t is the completion time; Step 3.4: Update j=j+1. If j≤m, go back to step 3.1, otherwise go to step 4; where m is the number of rows in Ms.

4. A system for determining the number of maintenance work teams, characterized in that: Includes the following modules: Module 1 is used to set the number of equipment to be repaired n, the completion probability index P′, and the average time taken to repair a single equipment u; initialize the number of maintenance work teams N=2; Module 2 is used to traverse and generate the device completion quantity matrix Ms; wherein the matrix Ms has N columns, and each data Ms in the j-th row data Ms(j,:) j,i satisfy The row data Ms(j,:) is the jth arrangement of the number of equipment repaired by each maintenance team. j,i is the number of equipment repaired by maintenance team i; Module 3 is used to initialize the row number j=1 of the matrix Ms, the intermediate matrix Sp has 1+N columns, and Sp is initially an empty matrix; calculate the probability p that the number of equipment repaired by the maintenance team is the row data Ms(j,:) j ; Module 4, for making the completion probability where m is the number of rows of Ms; compare with the index P′, if P < P′, then increase the number of maintenance operation teams, update N = N + 1 and then loop back to execute Module 2; otherwise, execute Module 5; Module 5 is used to output the number N of maintenance work teams and their completion probability P, where N is the minimum number of maintenance teams with a completion probability not lower than the index requirement.

5. The system for determining the number of maintenance work teams according to claim 4, characterized in that: In module 1, the completion probability is the probability of completing the maintenance of all equipment within the specified time T, and u obeys the exponential distribution Exp(μ).

6. The system for determining the number of maintenance work teams according to claim 4, characterized in that: The specific implementation of module 3 includes the following submodules: Module 3.1, used to make S1 = Ms j,1 , then to Ms. j,2 ~Ms. j,N These N-1 data are sorted from small to large, and the sorting results are saved in S2, S3, ... S N In the example, let array S = {S1, S2, S3…S N }; Module 3.2 is used to search row by row in the first N columns of the matrix Sp for row data that is completely equal to the array S; If there is row data in the matrix Sp that is exactly the same as the array S, that is: Sp j′,i =S i If it holds, then let p j =Sp j′,1+N , and execute module 3.4; where j′ is the corresponding row number, 1≤i≤N; If there is no row data in the matrix Sp that is completely equal to the array S, execute module 3.3; Module 3.3, used to make the probability In the formula μ is the mean of the variable x, Γ(x) is the gamma function, x is the time it takes for Team 1 to repair S1-1 equipment, and t is the completion time; Module 3.4 is used to update j=j+1. If j≤m, it returns to execute module 3.1, otherwise it executes module 4; wherein m is the number of rows of Ms.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, it implements the method for automatically generating the number of maintenance work teams as described in any one of claims 1 to 3.

8. A software product comprising a computer program, characterized in that When the computer program is executed by a processor, the method for automatically generating the number of maintenance work teams as described in any one of claims 1 to 3 is implemented.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for automatically generating the number of maintenance work teams as described in any one of claims 1 to 3 is implemented.

Images