System and method for maintaining turbomachinery

Abstract

The present invention provides a method and system for servicing a turbomachine having a rotor with multiple hook elements for housing a retaining device. [Solution] Current data is received indicating the current number of hook elements with dowel pin holes and the corresponding current number of stakes, a prescribed spacing rule, and the maximum number of stakes per dowel pin hole. For each current hook element, a first possible combination with other hook elements is determined based on the prescribed spacing rule and the current number of stakes. A first solution combination is identified from the first possible combinations, and the current number of stakes in each hook element of each first solution combination is less than the maximum number of stakes. The user interface is controlled to show at least one desirable solution from the first solution combinations that has the highest number of possible future improvements.

Description

Technical Field

[0001] The present disclosure generally relates to the maintenance of turbomachinery. Specifically, the present disclosure relates to systems and methods for servicing a turbomachine that use dowel pins and stakes within a rotor of the turbomachine to limit movement of a retaining device that supports and / or holds rotor blades on the rotor.

Background Art

[0002] Turbomachines, such as steam turbines, often include a static nozzle assembly that directs a flow of working fluid toward rotor blades connected to a rotating rotor. The nozzle structure (including multiple nozzles, or "airfoils") may be referred to as a "diaphragm" or a "stage of the nozzle assembly". Each rotor blade has a base with a dovetail sized to fit within a corresponding dovetail slot within the rotor. Many final stage rotor blades are quite long and have a significant weight. During low speed operation or "rotating gear" operation, the blades can undesirably move axially along the dovetail slots in which the blades are held, which can cause significant wear to the blades and / or the rotor. Often, wear of the blades and / or the rotor can cause a shutdown, require repairs, and incur undesirable costs.

[0003] The blades are prevented from moving axially within dovetail slots provided in the rotor by a retaining device such as a lock wire. For example, hook elements such as hook tabs are formed around the radial circumference of the rotor wheel, and similar blade hook elements are formed in the dovetails of the blades, in which case the hook elements on the rotor wheel and blades are aligned circumferentially to define slots for housing the retaining device. The free end of the lock wire is molded to be integral at the overlapping joint, thereby allowing slight changes in the length and diameter of the lock wire as the rotor, rotor slots, and blades expand and contract during transient periods. The lock wire is held in place by radial spring forces resulting from the placement of a relatively large diameter lock wire in a relatively small diameter annular slot, and by dowel pins mounted on the rotor. The dowel pins may be prevented from falling out of the rotor by stakes.

[0004] During rotor blade maintenance, the stake heads are detached to allow for the removal of the dowel pins, while the remaining stake portion remains within the rotor. Therefore, when the rotor blades are reinstalled, new stakes must be positioned in different locations around the dowel pins. However, the number of possible positions for stakes around the dowel pins is limited. Furthermore, the operator must determine which hook elements align with the required dowel pin spacing to accommodate the dowel pins. However, given the numerous hook elements on the rotor, the operator must consider all options that align with the required dowel pin spacing and available stake holes. Moreover, if the operator does not select the option that will result in the most frequent subsequent maintenance opportunities, the rotor's service life will be negatively reduced.

[0005] Therefore, there is a need in the art for systems and methods for servicing turbomachinery rotor blades that reduce the time, effort, and potential errors during maintenance while maximizing the number of subsequent maintenance opportunities. [Overview of the project]

[0006] The aspects and benefits of this disclosure are partially described in the following description, may become apparent from that description, or may be learned through the practice of this technology.

[0007] According to one embodiment, a method for servicing a turbomachinery is provided. The turbomachinery has a rotor and a plurality of rotor blades, the rotor having a plurality of hook elements for housing a retaining device. The method may include receiving current data by a computing system indicating the current status of each of the plurality of hook elements having dowel pin holes, and the current number of stakes for each of the current hook elements. The method may further include receiving by a computing system a prescribed spacing rule for the dowel pins in the plurality of hook elements. The method may further include receiving by a computing system the maximum number of stakes per dowel pin hole. The method may further include determining by a computing system, for each of the current hook elements, a first possible combination of the plurality of hook elements and the current hook elements corresponding to other hook elements, based on the prescribed spacing rule and the current number of stakes in each of the first possible combinations of hook elements. This method may further include using a computing system to identify a first solution combination from a first possible combination, where the current number of stakes in each hook element of each first solution combination may be less than the maximum number of stakes. Furthermore, this method may include using a computing system to determine at least one desirable solution among the first solution combinations that has the highest number of possible future improvements. In addition, this method may include using a computing system to control a user interface to indicate at least one desirable solution.

[0008] According to another embodiment, a system for servicing a turbomachinery is provided. The system may include a turbomachinery having a rotor and a plurality of rotor blades, the rotor having a plurality of hook elements for housing a retaining device. The system may further include a user interface and a computing system. The computing system may be configured to receive current data indicating the current state of each of the plurality of hook elements having dowel pin holes, and the current number of stakes for each of the current hook elements, to receive a prescribed spacing rule for the dowel pins within the plurality of hook elements, and to receive the maximum number of stakes per dowel pin hole. The computing system may further be configured to determine, for each of the current hook elements, a first possible combination of the current hook elements of the plurality of hook elements and corresponding hook elements, based on the prescribed spacing rule and the current number of stakes in each of the hook elements of each of the first possible combinations. The computing system may further be configured to identify a first solution combination from the first possible combinations, the current number of stakes in each of the hook elements of each of the first solution combinations may be less than the maximum number of stakes. Furthermore, the computing system may be configured to determine at least one desirable solution from the first combination of solutions that has the highest number of possible future improvements. In addition, the computing system may be configured to control the user interface to show at least one desirable solution.

[0009] A further embodiment provides another method for servicing a turbomachinery. The turbomachinery may have a rotor and a plurality of rotor blades, the rotor may have a plurality of hook elements for housing a retaining device. The method may include inputting current data, via a user interface of a computing system, indicating the current state of each of the plurality of hook elements having dowel pin holes, and the current number of stakes for each of the current hook elements. The method may further include inputting a prescribed spacing rule for dowel pins within the plurality of hook elements via a user interface of a computing system. The method may similarly include inputting a maximum number of stakes per dowel pin hole via a user interface of a computing system. The method may further include, via a computing system, determining a first possible combination of the current hook elements of the plurality of hook elements and corresponding hook elements, based on the prescribed spacing rule and the current number of stakes in each of the hook elements of each of the first possible combinations. Furthermore, the method may include using a computing system to identify a first solution combination from a first possible combination, where the current number of stakes in each hook element of each first solution combination may be less than the maximum number of stakes. The method may also include using a computing system to determine at least one desirable solution among the first solution combinations that has the highest number of possible future adjustments. Furthermore, the method may include using a computing system to control a user interface to indicate at least one desirable solution. In addition, the method may include placing dowel pins and stakes on the rotor at least partially based on at least one desirable solution.

[0010] These and other features, aspects, and advantages of the present invention will be better understood by referring to the following description and the appended claims. The appended drawings, which are incorporated herein and constitute part of this specification, illustrate embodiments of the art and, together with the description in the specification, are useful in illustrating the principles of the art.

[0011] A complete and implementable disclosure of the present invention, including the best mode for constructing and using the system and method intended for those skilled in the art, is described herein with reference to the accompanying drawings. [Brief explanation of the drawing]

[0012] [Figure 1] This is a schematic diagram illustrating an example of a turbomachinery according to an aspect of the present disclosure. [Figure 2] Figure 1 is a partial plan perspective view showing an assembly of a turbine rotor and blades of a turbomachinery, such as the turbomachinery shown in the present disclosure, and the assembly has a holding device. [Figure 3] This is a partial lower perspective view showing the turbine rotor and blade assembly shown in Figure 2, according to an embodiment of the present disclosure. [Figure 4] These are partial side views showing the turbine rotor of Figures 2 and 3 according to embodiments of the present disclosure. [Figure 5A] This figure shows an example of a prescribed spacing rule for the turbine rotors in Figures 2 to 4 according to an embodiment of the present disclosure. [Figure 5B] This figure shows an example of a prescribed spacing rule for the turbine rotors in Figures 2 to 4 according to an embodiment of the present disclosure. [Figure 5C] This figure shows an example of a prescribed spacing rule for the turbine rotors in Figures 2 to 4 according to an embodiment of the present disclosure. [Figure 6] This is a schematic diagram showing a system for servicing turbomachinery according to an embodiment of the present disclosure. [Figure 7A] This is a flowchart illustrating an algorithm for maintaining turbomachinery according to an embodiment of the present disclosure. [Figure 7B]This is a flowchart illustrating an algorithm for maintaining turbomachinery according to an embodiment of the present disclosure. [Figure 7C] This is a flowchart illustrating an algorithm for maintaining turbomachinery according to an embodiment of the present disclosure. [Figure 7D] This is a flowchart illustrating an algorithm for maintaining turbomachinery according to an embodiment of the present disclosure. [Figure 8] This is a flowchart illustrating an exemplary method for servicing turbomachinery according to embodiments of the present disclosure. [Figure 9] This flowchart illustrates another exemplary method for servicing turbomachinery according to embodiments of the present disclosure. [Modes for carrying out the invention]

[0013] The repeated use of reference numerals in this specification and drawings is intended to represent identical or similar features or elements of the Art.

[0014] Hereinafter, embodiments of the present invention are given in detail, one or more examples of which are shown in the drawings. Each example is provided for illustrative purposes of the present art and is not intended to limit the present art. In fact, it will be apparent to those skilled in the art that modifications and changes can be made in the present art without departing from the scope or spirit of the claimed art. For example, features illustrated or described as part of one embodiment can also be used in conjunction with another embodiment to bring about further embodiments. For this reason, this disclosure is intended to encompass modifications and changes that fall within the scope of the appended claims and their equivalents.

[0015] As used herein, the word "exemplary" is used to mean "serving as an example, instance, or illustration." It should not be construed that all implementations described herein as "exemplary" are necessarily more preferred or advantageous than other implementations. Additionally, unless specifically identified, all embodiments described herein should be considered exemplary.

[0016] In the detailed description, numerical and alphabetical reference signs are used to refer to the features of the drawings. Similar or like signs in the drawings and the description are used to refer to similar or like parts of the present invention. As used herein, the terms "first," "second," and "third" may be used interchangeably to distinguish one component from another, and are not intended to indicate the location or importance of individual components.

[0017] The term "fluid" can be a gas or a liquid. The term "fluid communication" means that a fluid can make a connection between designated regions.

[0018] As used herein, the terms "upstream" (or "forward") and "downstream" (or "rearward") refer to the relative directions with respect to the flow of fluid in a fluid path. For example, "upstream" refers to the direction from which the fluid has flowed, and "downstream" refers to the direction in which the fluid is flowing. However, the terms "upstream" and "downstream" used herein may also refer to the flow of electricity. The term "radially" refers to a relative direction that is substantially perpendicular to the axial centerline of a particular component, the term "axially" refers to a relative direction that is substantially parallel and / or coaxial with the axial centerline of a particular component, and the term "circumferentially" refers to a relative direction that extends around the axial centerline of a particular component.

[0019] Approximating terms such as "about," "approximately," "generally," and "substantially" are not limited to the exact values specified. In at least some instances, the language expressing approximation may correspond to the precision of the equipment for measuring a value, or the precision of the method or machine for constructing or manufacturing a component and / or system. For example, the language expressing approximation may refer to being within a margin of 1, 2, 4, 5, 10, 15, or 20% at any of the individual values, ranges of values, and / or endpoints defining a range of values. When used in the context of an angle or direction, such terms include a range of plus or minus 10 degrees of the described angle or direction. For example, "substantially perpendicular" includes directions within 10 degrees in any direction from perpendicular, such as clockwise or counterclockwise.

[0020] Terms such as "coupled," "fixed," "attached," etc., unless specifically stated otherwise in this specification, refer to both direct coupling, fixing, or attachment, as well as indirect coupling, fixing, or attachment through one or more intermediate components or features. As used herein, the terms "comprises," "comprising," "includes," "including," "has," "having," or any other variations thereof, are intended to cover non - exclusive inclusion. For example, a process, method, article, or apparatus that includes a listing of features is not necessarily limited to only those features, and may also include other features not explicitly listed, or other features inherent to such a process, method, article, or apparatus. Further, unless explicitly stated to the contrary, "or" refers to an inclusive logical disjunction, not an exclusive logical disjunction. For example, condition A or B is satisfied by any one of the following: A is true (or exists) and B is false (or does not exist), A is false (or does not exist) and B is true (or exists), and both A and B are true (or exist).

[0021] Here, and throughout the entirety of the specification and claims, limitations on scope are combined and replaced, and unless the context and wording specifically indicate otherwise, such scope is identified and includes all sub-scopes contained therein. For example, all scopes disclosed herein include endpoints, which are independently combinable with respect to one another.

[0022] In general, this subject relates to systems and methods for servicing turbomachinery. More specifically, a turbomachinery may have a rotor and a plurality of rotor blades. Each rotor blade has a base configured to fit into a corresponding slot within the rotor. For example, hook elements such as hook tabs are formed around the radial circumference of the rotor wheel, and similar blade hook elements are formed on the dovetail of the blade, in which case the hook elements on the rotor wheel and blade are aligned circumferentially to define an annular slot when the blade is installed in the rotor. Retaining devices such as lock wires are configured to be housed within the annular slots to prevent the blades from sliding axially along the slots in the rotor. The lock wires are held in place by radial spring forces resulting from the installation of a relatively large diameter lock wire in a relatively small diameter annular slot, and by dowel pins mounted on the rotor. Each of the dowel pins may be prevented from falling out of the turbine rotor by one or more stakes.

[0023] During rotor blade maintenance, the stake heads are detached to allow for the removal of the dowel pins. Therefore, when the rotor blades are reinstalled, new stakes must be positioned in different locations around the dowel pins. However, the number of possible positions for stakes around each dowel pin is limited. Furthermore, the operator must determine the required spacing and alignment of the dowel pins, as well as the available stake positions around each dowel pin. However, given the numerous hook elements on the rotor, the operator needs time to consider all options for the required dowel pin spacing and alignment. For example, some rotors have 92 hook tabs, of which 13 dowel pins must be positioned according to dowel pin spacing rules, with 4 or 6 stakes (two or three pairs of stakes) initially available for each dowel pin hole. If the operator does not select the option that will result in the most frequent subsequent maintenance opportunities, the rotor's service life may be negatively reduced. Furthermore, errors can occur during stake placement that necessitate detaching improperly placed stakes and using alternative stake locations, requiring a re-determination of the solution, which in turn requires even more time and effort.

[0024] Therefore, according to the aspects of this subject, a system and method are provided that helps to automatically determine the best maintenance plan for the placement of dowel pins and stakes that provide the best future maintenance opportunities. Such an automated method significantly reduces the number of calculations required during maintenance, ensures that the maintenance plan meets the required dowel pin spacing requirements, and reduces instances of drilling unnecessary dowel pin holes, resulting in reduced maintenance time, overall cost, and risk. Furthermore, such automated determination may also help the operator make decisions among the best maintenance plans by providing the number of possible future maintenance opportunities for each maintenance plan, highlighting the maintenance plan with the highest number of possible future maintenance opportunities from other plans (for example, classifying maintenance plans from the highest to the lowest number of possible future maintenance opportunities, excluding maintenance plans with fewer than a certain number of future maintenance opportunities, and highlighting, coloring, and underlining the maintenance plan with the highest number of possible future maintenance opportunities to distinguish it from other plans).

[0025] Referring here to the drawings, Figure 1 shows a schematic diagram of one embodiment of a turbomachinery, which in the illustrated embodiment is a gas turbine 10. The gas turbine 10 may be an industrial or onshore gas turbine. However, it should be understood that this disclosure is not limited to industrial and / or onshore gas turbines. Rather, the inventions described herein can be used in any suitable type of turbomachinery, including but not limited to steam turbines, aircraft gas turbines, or marine gas turbines.

[0026] As shown, the gas turbine 10 generally comprises an inlet section 12, a compressor section 14 located downstream of the inlet section 12, a number of combustors (not shown) in a combustor section 16 located downstream of the compressor section 14, a turbine section 18 located downstream of the combustor section 16, and an exhaust section 20 located downstream of the turbine section 18. In addition, the gas turbine 10 may include one or more shafts 22 coupled between the compressor section 14 and the turbine section 18.

[0027] The compressor section 14 may generally comprise a plurality of rotor disks 24 (one of which is shown) and a plurality of rotor blades 26 extending radially outward from each rotor disk 24 and connected to each rotor disk 24. Each rotor disk 24 may then be coupled to or form part of a shaft 22 extending through the compressor section 14. The compressor section 14 may further comprise one or more stator vanes (not shown) arranged circumferentially around the shaft 22. The stator vanes may be fixed to a compressor casing or static casing extending circumferentially around the rotor blades 26.

[0028] The turbine section 18 may generally comprise a plurality of rotor disks 28 (one of which is shown) and a plurality of rotor blades 30 extending radially outward from each rotor disk 28 and interconnected with each rotor disk 28. Each rotor disk 28 may then be coupled to or form a portion of a shaft 22 extending through the turbine section 18. The turbine section 18 further comprises an outer casing 31 that circumferentially surrounds the portion of the shaft 22 and the rotor blades 30, thereby at least partially defining a hot gas path 32 through the turbine section 18. The turbine casing 31 may be configured to support a plurality of stationary nozzles (not shown) extending radially inward from the inner circumference of the turbine casing 31.

[0029] During operation, a working fluid such as air flows through the inlet section 12 into the compressor section 14, where it is gradually compressed, thus supplying pressurized air to the combustors in the combustor section 16. The pressurized air is mixed with fuel and burned in each combustor to produce combustion gases 34. The combustion gases 34 flow from the combustor section 16 to the turbine section 18 through the high-temperature gas path 32, at which point energy (kinetic and / or thermal energy) is transferred from the combustion gases 34 to the rotor blades 30, causing the shaft 22 to rotate. The mechanical rotational energy may then be used to power the compressor section 14 and / or generate electricity. The combustion gases 34 that have left the turbine section 18 can then be exhausted from the gas turbine 10 via the exhaust section 20.

[0030] Referring to Figures 2 to 4, various diagrams of the turbine rotor and blade assembly 100 according to the aspects of this subject are shown. For example, Figure 2 shows a partial plan perspective view of the turbine rotor and blade assembly 100 of a turbomachinery such as the turbomachinery 10 of Figure 1, and the assembly in particular shows the holding device. Figure 3 shows a partial bottom perspective view of the turbine rotor and blade assembly 100 of Figure 2. In addition, Figure 4 shows a partial side view of the turbine rotor in the turbine rotor and blade assembly 100 of Figures 2 to 3.

[0031] In particular, as shown in Figure 2, the turbine rotor and blade assembly 100 comprises a turbine rotor 102 and a plurality of blades 104 (one of which is shown) configured to be coupled to the turbine rotor 102. It should be understood that in some cases, one or both of the rotor disks 24, 26 are configured in the same way as the rotor 102, and the corresponding blades 26, 30 are configured in the same way as the blades 104. The turbine rotor 102 has a plurality of radial projections 106 spaced apart along the entire circumference of the rotor 102. A plurality of dovetail slots 108 are defined in the rotor 102, each dovetail slot 108 being defined between a corresponding pair of radial projections 106. The dovetail slots 108 can extend substantially along the axial direction A1 (for example, parallel to and along it). Each dovetail slot 108 of the rotor 102 is configured to accommodate the dovetail portion 110 of the corresponding blade among the blades 104.

[0032] The radial projection 106 of the rotor 102 and the dovetail portion 110 of the blade 104 are configured to house a retaining device 112, such as a lock wire, to prevent the blade 104 from sliding along the axial direction A1 within the dovetail slot 108. For example, each radial projection 106 of the rotor 102 has a corresponding hook element 114, such as a hook tab, at the first end of the rotor 102 in the axial direction A1. Each hook tab 114 can define at least partially a slot 116 that extends circumferentially C1 through the entirety of the corresponding radial projection 106. Each slot 116 can open at the radially inner end of the hook tab 114 and close at the radially outer end of the hook tab 114. Similarly, each dovetail portion 110 of the blade 104 has a corresponding blade hook element 118 (e.g., a blade hook tab) at the first end of the dovetail portion 110 in the axial direction A1. As best shown in Figure 3, each blade hook tab 118 can define at least partially a slot 120 extending circumferentially in C1 through the entirety of the corresponding dovetail portion 110. Each slot 120 can open at the radially inner end of the blade hook tab 118 and close at the radially outer end of the blade hook tab 118. The slot 116 of the radially projecting portion 106 can align with the slot 120 of the blade 104 in the circumferential C1 and axial A1 directions to form an annular slot for accommodating the lock wire 112. Thus, the lock wire 112 can be accommodated by the hook tabs 114 and the blade hook tabs 118.

[0033] In some cases, the lock wire 112, hook tab 114, and / or blade hook tab 118 further include one or more mechanisms to prevent the lock wire 112 from rotating within the slots 116, 120. For example, as shown in Figure 3, the lock wire 112 includes a lock wire tab 112A housed within the slot 120 such that the rotation of the lock wire 112 is restricted by the engagement of the lock wire tab 118 with the lock wire tab 112A.

[0034] To hold the lock wire 112 within the slots 116, 120 defined by the hook tabs 114, 118, at least a portion of the hook tabs 114 of the rotor 102 may be configured to accommodate one or more restricting elements, such as a dowel pin. For example, at least a portion of the hook tab 114 may define a dowel pin hole 122 for accommodating a dowel pin 124. As best shown in Figure 3, the dowel pin hole 122 may be positioned radially inward of the lock wire 112 so that, once the dowel pin 124 is accommodated in the corresponding dowel pin hole 122, the lock wire 112 cannot be removed until the dowel pin 124 is removed.

[0035] After the dowel pin 124 is inserted into the dowel pin hole 122, the dowel pin 124 can be held in place within the dowel pin hole 122 by one or more corresponding stakes 126. Each stake 126 may be housed in a corresponding stake hole 128 defined in the hook tab 114. Each stake 126 may have a shaft portion and a relatively large head portion at one longitudinal end of the shaft portion. Therefore, when the shaft portion of a stake 126 is installed in the rotor 102, the head portion of each stake 126 protrudes from the stake hole 128 and overlaps at least partially with the end of the dowel pin 124. Therefore, to remove the dowel pin 124, the head portion of each corresponding stake 126 must be detached, leaving the remaining portion of the stake 126 (e.g., the shaft portion) in the rotor 102. Therefore, the stake holes 128 are spaced apart around the dowel pin holes 122 so that the stake holes 128 (and the corresponding shaft portions of the stakes 126) do not overlap.

[0036] In some cases, at least one pair of stakes 126 may be required for each dowel pin 124. In one or more cases, each pair of stakes 126 is positioned substantially opposite the corresponding dowel pin 124 (for example, spaced about 180 degrees around the dowel pin 124). For example, as shown in Figure 4, the stake holes 128 of the hook tab 114 include a pair of first stake holes 128A and a pair of second stake holes 128B. Although only two pairs of stake holes 128A, 128B are shown, it should be understood that one or more additional stake holes 128 (for example, an additional pair of stake holes 128) may be provided to accommodate stakes 126, depending on the size of the hook tab 114, the location of the dowel pin holes 122 within the hook tab 114, the space between the lock wire 112 and the dowel pin holes 122, and the dimensions of the stakes 126.

[0037] In some cases, the designated pair of stake holes 128A, 128B may have one or more discriminative mechanisms to help the operator identify the appropriate staking pair. For example, in the illustrated example, the stake holes 128 are only partially perforated before stake placement so that further perforation of the stake holes 128 is required before the stake 126 can be accommodated. In some cases, the diameter of the partially perforated portion in the pair of stake holes 128 may vary to indicate to the operator which stake holes form a pair (e.g., a pair that is opposite but not directly adjacent). For example, the diameter of the partially perforated portion in the first stake hole 128A may differ from the diameter of the partially perforated portion in the second stake hole 128B to indicate to the operator which stake holes form a pair. In such cases, the stake holes 128A and 128B may be configured to be further drilled with a drill bit of the same diameter, and the stake holes 128A and 128B are centered at the same radius R1 from the center of the dowel pin hole 122 so that stakes 126 of the same size can be accommodated in the stake holes 128A and 128B, respectively.

[0038] A minimum number of dowel pins 124 are required to properly hold the lock wire 112. Generally, it is beneficial to maximize the number of times the rotor 102 can be serviced and reduce costs by using only the minimum number of dowel pins 124 in a given time. To ensure proper stability of the lock wire 112 with a minimum number of dowel pins 124, one or more prescribed spacing rules describing the required spacing between the hook tabs 114 that accommodate the dowel pins 124 may be developed for different rotor configurations. For example, Figures 5A to 5C show examples of different spacing rules 200A, 200B, and 200C for a minimum of 13 dowel pins 124 across 92 hook tabs 114 on a schematic rotor outer circumference 202, where the spacing of the hook tabs 114 is determined with respect to the overlapping position OV1 of the ends of the lock wire (e.g., lock wire 112). It should be understood that since the overlap position OV1 can vary over various maintenance, the selected spacing rule can be oriented in multiple ways around a given rotor 102. The corresponding hook tabs 114 (referred to herein alternatively as “pinning hook tabs 114”) for accommodating the dowel pins 124 are spaced a few hook tabs apart from the next pinning hook tab 114, as described correspondingly between such pinning hook tabs. For example, the second pinning hook tab 114P2 is the sixth hook tab 114 clockwise from the first pinning hook tab 114P1 in Figures 5A and 5C, but is also the fourth hook tab 114 clockwise from the first pinning hook tab 114P1 in Figure 5B. Typically, the spacing rule will be selected for the lifespan of the rotor 102. The rotor 202 shown in spacing rules 200A, 200B, and 200C in Figures 5A to 5C has 92 hook tabs 114 and is configured to be used with a minimum of 13 dowel pins 124, but alternatively, any suitable spacing rule that matches the number of hook tabs 114 present and a preferred minimum number of dowel pins 124 may be used.

[0039] As described above, during rotor maintenance, the dowel pins 124 can be removed by detaching the heads of the stakes 126, but when installing new stakes 126 on the same hook tab 114, different stake holes 128 must be used. However, if the hook tab 114 has space for only a limited number of stakes 126 (e.g., two or three pairs of stake holes 128), maintenance is similarly limited. For example, if a given hook tab 114 initially has two pairs of stake holes 128, and one pair of stakes 126 must be installed for each dowel pin 124, and no errors occur during installation, then the maximum number of stake installations on such a hook tab 114 is two (e.g., the original stake and one maintenance). Similarly, if a given hook tab 114 has three pairs of stake holes 128, and no errors occur during installation, then the maximum number of stake installations on such a hook tab 114 is three (e.g., the original stake and two maintenance). Because the overlap position OV1 can vary, there may be other combinations of hook tabs 114 that can be used to allow further maintenance of the rotor 102. However, considering the number of hook tabs 114 present on the rotor 102 being serviced (e.g., 92 hook tabs 114), the minimum number of dowel pins (e.g., 13), and the variation in the number of staking operations available for each hook tab 114 across multiple maintenances, calculating all possible solutions for selecting which hook tabs 114 to use, let alone the best solution to yield the longest service life, would be difficult and time-consuming for the operator. Furthermore, if an error occurs during a staking operation that prevents the use of one or more stake holes 128 on the selected hook tab 114, a new solution must be calculated, which may result in additional effort and time.

[0040] Therefore, referring here to Figure 6, a schematic diagram of a system 300 for servicing a turbomachinery is shown according to an embodiment of the present disclosure. Generally, the system 300 is described herein with reference to the turbomachinery 10 disclosed in Figure 1, the turbine rotor and blade assemblies 100 disclosed in Figures 2 to 4, and examples of spacing rules 200A, 200B, and 200C described with reference to Figures 5A to 5C. However, it should be understood that generally, the system 300 of the present disclosure can be used with any suitable turbomachinery having any suitable turbomachinery configuration, any suitable turbine rotor and blade assemblies having any suitable assembly configuration, and / or any suitable spacing rules.

[0041] As shown in Figure 6, the system 300 may comprise a computing system 302 and various other components configured to be communicatively coupled to and / or controlled by the computing system 302. For example, the computing system 302 may be configured to be communicatively coupled to and / or control one or more user interfaces 320. User interfaces 320 as described herein include, but are not limited to, any combination of input / output devices that enable an operator to make input to the computing system 302 and / or enable the computing system 302 to provide feedback to the operator, such as keyboards, keypads, touchpads, pointing devices, buttons, knobs, sliders, switches, display screens, touch-sensitive screens, voice input devices, and voice output devices. In addition, in some cases, the computing system 302 may be configured to be communicatively coupled to and / or control the turbomachinery 10 and / or its components.

[0042] The computing system 302 may be any suitable controller or combination of controllers, and should generally be understood to include a control circuit having one or more processors 304 coupled to memory 306. The processor 304 may comprise any suitable processing device (e.g., control circuits, processor cores, microprocessors, application-specific integrated circuits, field-programmable gate arrays, controllers, microcontrollers, etc.) and may be one or more operably connected processors. The memory 306 may comprise one or more non-temporary computer-readable storage media, such as RAM, ROM, EEPROM, EPROM, one or more memory devices, flash memory devices, and combinations thereof. The memory 306 may store data 308 accessible by the processor 304, and / or computer-readable instructions 310 executable by the processor 304.

[0043] For example, data 308 can be stored in one or more databases. For example, data 308 may include a rotor information database 312 for storing data related to the configuration of the rotor 102 in the turbomachinery 10 being serviced, such as the model of the turbomachinery 10, the model of the rotor 102, the number of hook tabs 114 currently having dowel pin holes 122, the number of stakes 126 currently in each of the hook tabs 114, the maximum number of stakes 126 in each of the dowel pin holes 122, and the number of stakes 126 required per dowel pin 124. In some cases, the rotor information stored in database 312 is received from the operator and / or from a server database via the user interface 320. Furthermore, data 308 may include an interval rule database 314 that includes one or more prescribed interval rules (e.g., interval rules 200A, 200B, 200C) and a display of the selected interval rules used for service. In some cases, the prescribed interval rules stored in database 314 are received from the operator and / or from the server database via the user interface 320.

[0044] Instruction 310 can be software, firmware, or both written in any suitable programming language, or it can be implemented in hardware or firmware. In addition, or alternatively, instruction 310 can be executed in a separate logical and / or virtual thread on the processor 304. For example, memory 306 can store instruction 310 that, when executed by the processor 304, causes the processor 304 to perform an operation such as any of the operations and functions described herein. In some embodiments, instruction 310 can be executed by the processor 304 to implement the solution module 316. Generally, the solution module 316 may be configured to determine at least one desirable maintenance solution, each of which is identified by the computing system 302 as having a high or maximum number of possible future maintenances. The solution module 316 can determine at least one desirable maintenance solution at least in part on the rotor information database 312 and the interval rule database 314, as described below in more detail with reference to Figures 7A to 7D.

[0045] In addition, instruction 310 may be executed by processor 304 to implement control module 318. Generally, control module 318 may be configured to perform control operations related to at least one desired prepared solution. For example, in some embodiments, the control operation may include automatically controlling the operation of user interface 320 to provide at least one desired prepared solution. In some cases, the control operation may include automatically controlling the operation of user interface 320 to indicate at least one desired solution and the number of possible future prepared solutions for each of the at least one desired solution. In one or more cases, the control operation may include automatically controlling the operation of user interface 320 to highlight at least one desired solution from other solutions, as described in more detail below.

[0046] Referring here to Figures 7A–7D, various flowcharts of algorithm 400 for servicing turbomachinery are shown according to embodiments of this disclosure. Generally, algorithm 400 is described herein as being implemented by the computing system 302 of system 300 described above with reference to Figure 6 (for example, as part of solution module 316). However, it should be understood that the various processes described below may be implemented by alternative computing devices or any combination of computing devices. In addition, while Figures 7A–7D represent steps or functions performed in a particular order for illustrative purposes, the steps discussed herein are not necessarily limited to any particular order or arrangement unless expressly stated. Those skilled in the art will understand that, using the disclosures provided herein, various steps or functions of the algorithms disclosed herein can be omitted, rearranged, combined, and / or adapted in various ways without departing from the scope of this disclosure.

[0047] In some cases, algorithm 400 may be executed in response to input from an operator via the user interface 220, such as input indicating that rotor maintenance is being performed. However, in some cases, algorithm 400 may be executed automatically according to predetermined time intervals or the like.

[0048] As shown in Figure 7A, algorithm 400 may include a computing system 302 that receives current data in (402A), which includes a representation of each of the multiple hook tabs 114 of the rotor 102 that currently have dowel pin holes 122, and the number of current stakes 126 present in each of the current hook tabs 114. In some cases, the number of current hook tabs 114 and the number of current stakes 126 are provided in a data matrix M, along with the corresponding number of buckets or hook tabs in a first column and the corresponding number of current stakes in a second column, etc. However, it should be understood that the current data may be provided in any other preferred way. Furthermore, in (402B), algorithm 400 may include a computing system 302 that receives a set of spacing rules (e.g., one of spacing rules 200A, 200B, or 200C) used as the required spacing between the hook tabs 114 that contain the dowel pins 124. In some cases, the specified spacing rule is received as a vector. However, it should be understood that the specified spacing rule may be provided in any other preferred way. Furthermore, in (402C), algorithm 400 may include a computing system 302 that receives a representation of the maximum number N of stakes 126 per dowel pin hole 122 (or per dowel pin 124) for the rotor 102. For example, in some embodiments, the maximum number N is 4 (e.g., two pairs). In other embodiments, the maximum number N is 6 (e.g., three pairs). However, as discussed above, it should be understood that any preferred number may be used instead as the maximum number N.

[0049] In (404), algorithm 400 may include a computing system 302 that searches for a solution with at least one possible settling. For example, computing system 302 can search for a solution in which the current number of stakes 126 for each of the current hook tabs 114 is less than or equal to the maximum allowable number of stakes. For example, the maximum allowable number of stakes 126 for each of the hook tabs 114 of the solution may be chosen such that at least one settling is possible (for example, the maximum allowable number of stakes 126 is N-2 if each of the dowel pins 124 requires a pair of stakes 126, and N-1 if each of the dowel pins 124 requires only one stake 126, etc.).

[0050] In particular, as shown in Figure 7C, in order to search for a solution in (404), the computing system 302 may determine a first solution combination of the current hook element 114 and other current hook tabs 114 of the multiple current hook tabs 114 based on a prescribed interval rule for each current hook tab 114, and may also determine the number of current stakes 126 for each hook element 114 in each of the first possible combinations. More specifically, for a first hook tab among the current hook tabs 114, the computing system 302 may determine a first possible combination of other current hook tabs 114 that conform to the selected prescribed interval rule in (402B) of Figure 7A together with the first hook tab among the current hook tabs 114 in (450A). For example, if there are 13 dowel pins that need to be placed, the current hook tab 114 may be combinable with the other 12 current hook tabs 114 in each of the first possible combinations that each conform to a specified spacing rule. Then, in (452A), the computing system 302 can rearrange the hook tabs 114 in each of the first possible combinations from (450A) to correlate them with the hook tab or bucket numbering in matrix M, and then in (454A), find the number of current stakes 126 from matrix M corresponding to each of the rearranged hook tabs 114 in the first possible combinations. In (456A), the computing system 302 can identify the first solution combination as the first possible combination in which all hook tabs 114 have a number of current stakes less than or equal to the maximum allowable number of stakes. For example, in Figure 7A, the maximum allowable number of stakes 126 is set to the maximum number N-2 in (404).

[0051] The computing system 302 may repeat the same step for the second hook tab of the current hook tabs 114. For example, for the second hook tab of the current hook tabs 114, the computing system 302 determines a first possible combination of other current hook tabs 114 that, together with the second hook tab of the current hook tabs 114, conform to the selected prescribed spacing rule in (402B) of Figure 7A; rearranges the hook tabs 114 in each of the first possible combinations in (452B) to correlate with the hook tab or bucket numbering in matrix M; then in (454B), finds the corresponding number of current stakes 126 from matrix M for each of the rearranged hook tabs 114 in the first possible combinations; and in (456B), identifies the first solution combination as the first possible combination, where all hook tabs 114 in each of the first solution combinations have a number of current stakes that is less than or equal to the maximum allowable number of stakes. The computing system 302 may repeat the same steps (450N, 452N, 454N, 456N) for each of the current hook tabs up to the nth current hook tab.

[0052] After all first solution combinations (if any) have been found in which the current number of stakes for all hook tabs 114 in the first solution combination is less than or equal to the maximum allowable number of stakes, in (458) the hook tabs 114 of each first solution combination can be stacked into the first submatrix, and in (460) the current number of stakes for each hook tab 114 of each first solution combination can be stacked into the second submatrix, and then the algorithm returns to (406) in Figure 7A.

[0053] In (406), it is determined whether all combinations of the first solution were returned in (404). If (406) determines that no combinations of the first solution were returned in (404), the algorithm proceeds to (408). In (408), the computing system 302 can search for alternative combinations of solutions based on the matrix M from (402A), in which case the current number of stakes 126 for each of the current hook tabs 114 is less than or equal to the new maximum allowable number. For example, the new maximum allowable number is equal to the maximum number of stakes N. For example, in (408) of Figure 7C, the computing system 302 can search for alternative solution combinations by performing substantially the same steps as described above, with reference to (404), except that the maximum possible number of stakes is set at this point to be equal to the maximum number of stakes N from (402C), where the output in steps (450A) to (450N) represents alternative possible solutions (instead of the first possible solution), and the matrices returned in (458) and (460) represent combinations of alternative solutions. Then, in (410) of Figure 7A, the computing system 302 can select from the combinations of alternative solutions returned from (408) a perforation solution where the number of hook tabs 114 is the fewest number or count and the number of stakes is the maximum number N (for example, the one with the fewest number of hook tabs 114 that does not have any more available stake holes 128). Subsequently, the computing system 302 can recommend drilling new dowel pin holes 122 in each of the multiple hook elements 114 that are directly adjacent in the circumferential direction to each of the hook elements 114 having a maximum number of stakes N in the drilling solution selected in (410). In (412), the recommended drilling can be performed (for example, by an operator or an automated drilling machine). The operator can provide the computing system 302 with confirmation that the drilling has been performed.For example, computing system 302 can receive confirmation of a newly drilled dowel pin hole 122, and then update the data matrix M in (402A) in response to the receipt of the confirmation, and then find a new first possible solution combination by repeating algorithm 400 with the current data matrix M after the update.

[0054] In (406), if it is determined that at least one first solution combination has been returned in (404), the algorithm proceeds to (414). In (414) of Figure 7B, the computing system 302 applies one theoretical service to each hook tab 114 in each first solution combination. For example, in the theoretical service, the computing system 302 increases the number of stakes 126 for each hook tab 114 in each first solution combination by a predetermined number of services (for example, if two stakes 126 are needed for each dowel pin 124, the predetermined number of services is two). Then, in (416), the computing system 302 creates a new matrix Mi for each first solution combination, corresponding to the data matrix M from (402A) which has been updated according to the theoretical service performed on the corresponding first solution combination in (414).

[0055] Next, in (418), the computing system 302 searches for a solution from each matrix Mi from (416) such that the current number of stakes 126 for each of the current hook tabs 114 is less than or equal to the maximum allowable number of stakes, in which case the maximum allowable number of stakes is set to less than the maximum number of stakes N such that at least one maintenance is possible (for example, the maximum allowable number of stakes 126 is N-2 if each dowel pin 124 requires a pair of stakes 126, or N-1 if each dowel pin 124 requires only one stake 126, etc.). For example, in (418) of Figure 7C, the computing system 302 can search for a solution by performing substantially the same steps as described above, with reference to (404), except that the input matrix at this point is matrix Mi, and the maximum number of possible stakes is still set to be equal to the maximum number of stakes N-2 from (402C), where the output in steps (450A) to (450N) represents a second possible solution (instead of a first possible solution), and the matrices returned in (458) and (460) represent a combination of the second solution (instead of a combination of the first solution).

[0056] In (420) of Figure 7B, the computing system 302 can find the optimal solution from the second set of solutions. For example, in (420) of Figure 7D, for each matrix Mi generated in (416), and the corresponding submatrices generated in (458) and (460) for each matrix Mi during step (418), the computing system 302 can determine in (462) the number (or count) of hook tabs 114 in each set of second solutions having a maximum allowable number of stakes equal to the maximum number of stakes N-2 (e.g., how many hook tabs 114 are not "filled" and have enough remaining stake holes 128 for at least one more maintenance). The number of hook tabs 114 in each set of second solutions determined in (462) may be returned as a first vector V1 or in any other preferred way. In (464), the computing system 302 can determine the number (or count) of hook tabs 114 in each second solution combination having a maximum allowable number of stakes equal to the maximum number of stakes N-4 (for example, how many hook tabs 114 are not "filled" and how many stake holes 128 remain sufficient for at least two more maintenances). The number of hook tabs 114 in each second solution combination determined in (464) may be returned as a second vector V2 or in any other preferred way. In addition, in (466), the computing system 302 can determine the highest number (or count) of stakes 126 across the hook tabs 114 in each second solution combination. The highest number (or count) of stakes 126 in each second solution combination determined in (466) may be returned as a third vector V3 or in any other preferred way.

[0057] Subsequently, in (468), the computing system 302 can determine whether the highest number or count of stakes 126 across any of the hook tabs 114 of the second solution combinations determined in (466) is less than or equal to the predetermined maximum allowable number of stakes, specifically, four less than the maximum number of stakes N (for example, whether the current number of stakes 126 in each of the second possible combinations of hook tabs 114 allows for at least two possible future adjustments). If it is determined in (468) that any of the second solution combinations has a number of stakes less than or equal to the predetermined maximum allowable number of stakes in each of the corresponding hook tabs 114 (for example, four less than the maximum number of stakes N), the algorithm proceeds to (470). In (470), the computing system 302 determines which of the second solution combinations identified in (468) has the most available hook tabs 114 by identifying from the second vector V2 the second solution combination in which the number of hook tabs 114 is the minimum and the number of stakes is 4 less than the maximum number N. Otherwise, if any of the second solution combinations have one or more hook tabs 114 in each second solution combination that are greater than the predetermined maximum number of stakes, and it is determined in (468) that the number of hook tabs 114 in each of the corresponding hook tabs 114 is less than or equal to the predetermined maximum allowable number of stakes (for example, 4 less than the maximum number of stakes N), the algorithm proceeds to (472). In (472), the computing system 302 determines from the first vector V1 the second solution combination that has the minimum number of satisfied hook tabs 114, which is the second solution combination where the number of hook tabs 114 is the minimum and the current stake is two less than the maximum number N.

[0058] If a single second solution combination is selected in (470) or (472) for a particular matrix Mi in Figure 7D, then in (422) of Figure 7B, the computing system 302 applies one theoretical improvement to each hook tab 114 in the second solution combination (for example, by adding two stakes 126 to each hook tab 114 in the selected second solution combination). Then, in (424), the computing system 302 creates a new matrix Mi2 for each theoretically improved second solution combination, corresponding to the data matrix Mi from 416 that has been updated according to the theoretical improvement made in (422) for the corresponding second solution combination.

[0059] Next, in (426), the computing system 302 searches for a solution from each matrix Mi2 from (424) such that the current number of stakes 126 for each of the current hook tabs 114 is less than or equal to the maximum allowable number of stakes, and the maximum allowable number of stakes is again set to equal to the maximum number of stakes N-2. For example, in (426) of Figure 7C, the computing system 302 can search for a solution by performing substantially the same steps as described above, with reference to (418), except that the input matrix is ​​currently matrix Mi2, the output in steps (450A) to (450N) represents a third possible solution (instead of a second possible solution), and the matrices returned in (458) and (460) represent a combination of the third solution (instead of a combination of the second solution).

[0060] Subsequently, in (428) of Figure 7B, the computing system 302 determines whether a solution was found in (426) or whether the maximum number of loops has been performed. The maximum number of loops may generally correspond to the maximum number of theoretical maintenance. For example, the maximum number of theoretical maintenance may be predetermined and set based on the planned maintenance life for a particular rotor (e.g., 30 maintenance, 20 maintenance, 15 maintenance, etc.), as well as based on the number of maintenance already known to have been performed and the planned maintenance life for a particular rotor, or may be selected in any other preferred manner.

[0061] If it is determined in (428) that one or more solutions (e.g., combinations of third solutions) have been found in (426) and the number of loops has not reached the maximum, the computing system 302 proceeds in (430) to determine the optimal solution from among the solutions from (426) (e.g., among combinations of third solutions). For example, in (430) of Figure 7D, the computing system 302 can search for a solution by performing substantially the same steps as described above, with reference to (420), except that each matrix Mi2 generated in (424), and the corresponding submatrices generated in (458) and (460) for each matrix Mi2 in (426), are input to select the optimal combination of third solutions in (470) or (472) for each matrix Mi2. Once the optimal combination of third solutions is determined at (470) or (472) for each of the matrices Mi2, the computing system 302 can loop back from (430) to (422) in Figure 7B and perform substantially the same steps for the optimal combination of third solutions.

[0062] If, during a particular loop, a solution (e.g., a third solution combination) is not found in (426), and / or the maximum number of loops has been performed, the algorithm terminates in (432).

[0063] When the algorithm terminates at (432), the computing system 302 may be configured to control the operation of the user interface to show at least one desirable solution. For example, each corresponding solution among the at least one desirable solution may correspond to the corresponding solution (if any) among the first solution combinations determined at (404), the second solution combination (if any) determined at (420) for the corresponding first solution combination, the third solution combination (if any) determined at (430) for the corresponding second solution combination, and so on. In some cases, the computing system 302 may also assist the operator in determining a desirable solution when multiple solutions exist. For example, the computing system 302 may show the total number of possible future adjustments (loops) available for each of the at least one desirable solution. In one or more cases, the computing system 302 may identify a desirable solution only as the first solution combination with the highest number of possible future adjustments. In one or more cases, the computing system 302 can highlight the desired solution that has the highest number of possible future improvements from among the other desired solutions. For example, the computing system 302 can classify the first solution combinations from those with the highest number of possible future improvements to those with the lowest number, exclude or hide the first solution combinations that have fewer than a certain number of possible future improvements, and highlight the first solution combination with the highest number of possible future improvements from the first solution combinations with fewer possible future improvements, coloring and underlining them.

[0064] Figure 8 shows a flowchart of an exemplary method 500 for servicing turbomachinery according to embodiments of the present disclosure. Generally, the method 500 is described herein as being carried out by a computing system 302 described above with reference to Figure 6, and algorithms 400 described above with reference to Figures 7A–7D. However, it should be understood that the various processes described below may be carried out by alternative computing devices or any combination of computing devices. In addition, while Figure 8 shows steps or functions performed in a particular order for illustrative purposes, the steps discussed herein are not necessarily limited to a particular order or arrangement unless expressly stated. Those skilled in the art will understand that, using the disclosures provided herein, various steps or functions of the methods disclosed herein can be omitted, rearranged, combined, and / or adapted in various ways without departing from the scope of the present disclosure.

[0065] As shown in Figure 8, in (502), method 500 may include receiving current data indicating each of the current hook elements of a plurality of hook elements having dowel pin holes, and the current number of stakes for each of the current hook elements. For example, as discussed above, the computing system 302 may receive current data (e.g., matrix M) from a user via the user interface 320, the current data indicating each of the current hook elements (e.g., the current hook tab 114) of a plurality of hook tabs 114 having dowel pin holes 122, and the current number of stakes 126 for each of the current hook elements 114.

[0066] Furthermore, in (504), method 500 may further include receiving a set of predefined spacing rules for dowel pins in a plurality of hook elements. For example, as discussed above, the computing system 302 may receive from a user a set of predefined spacing rules for dowel pins 124 in a plurality of hook tabs 114, e.g., spacing rules 200A, 200B, 200C, via the user interface 320 and / or any other preferred source.

[0067] In (506), method 500 may further include receiving the maximum number of stakes per dowel pin hole. For example, as discussed above, the computing system 302 may receive from a user, via the user interface 320 and / or any other preferred source, the maximum number N (e.g., 4 or 6 stakes 126) of stakes 126 that can be placed around each dowel pin hole 122 in a given hook tab 114.

[0068] In (508), method 500 may include determining, for each current hook element, a first possible combination of the current hook element with other hook elements from a plurality of hook elements, and the number of current stakes in each hook element of each first possible combination. For example, as described above, the computing system 302 can determine, for each current hook tab 114 identified in the current data, a first possible combination of the current hook tab 114 with other current hook tabs 114 and corresponding current hook tabs 114 that satisfy a given interval rule, and then determine the number of corresponding current stakes 126 in each hook tab 114 of each first possible combination.

[0069] Furthermore, in (510), method 500 may include identifying a first solution combination from a first possible combination, where the current number of stakes in each hook element of each first solution combination is less than the maximum number of stakes. For example, as described above, the computing system 302 can identify a first solution combination from a first possible combination, in particular, where the current number of stakes 126 in each hook tab 114 of each first solution combination is less than the maximum number of stakes N.

[0070] Furthermore, in (512), method 500 may include determining at least one desirable solution from the first combination of solutions that has the highest number of possible future adjustments. For example, as discussed above, computing system 302 can determine at least one desirable solution from the first combination of solutions that has the highest number of possible future adjustments (loops).

[0071] In addition, in (514), method 500 may include controlling the user interface to show at least one desirable solution. For example, as described above, the computing system 302 can control the operation of the user interface 320 to show at least one desirable solution.

[0072] Figure 9 shows a flowchart of another exemplary method 600 for servicing turbomachinery according to embodiments of the present disclosure. Generally, method 600 is described herein as being carried out by the computing system 302 described above with reference to Figure 6, and the algorithm 400 described above with reference to Figures 7A–7D. However, it should be understood that the various processes described below may be carried out by alternative computing devices or any combination of computing devices. In addition, while Figure 9 shows steps or functions performed in a particular order for illustrative purposes, the steps discussed herein are not necessarily limited to a particular order or arrangement unless expressly stated. Those skilled in the art will understand that, using the disclosures provided herein, various steps or functions of the methods disclosed herein can be omitted, rearranged, combined, and / or adapted in various ways without departing from the scope of the present disclosure.

[0073] As shown in Figure 9, in (602), method 600 may include inputting current data indicating each of the current hook elements of a plurality of hook elements having dowel pin holes, and the current number of stakes for each of the current hook elements. For example, as discussed above, a user can input current data (e.g., matrix M) to the computing system 302 via the user interface 320, where the current data indicates each of the current hook elements (e.g., the current hook tab 114) of a plurality of hook tabs 114 having dowel pin holes 122, and the current number of stakes 126 for each of the current hook elements 114.

[0074] Furthermore, in (604), method 600 may further include inputting a set of predefined spacing rules for dowel pins in multiple hook elements. For example, as discussed above, a user can input a set of predefined spacing rules for dowel pins 124 in multiple hook tabs 114, e.g., spacing rules 200A, 200B, 200C, to the computing system 302 via the user interface 320.

[0075] In (606), method 600 may further include inputting a maximum number of stakes per dowel pin hole. For example, as described above, a user can input to the computing system 302 via the user interface 320 a maximum number N stakes 126 (e.g., 4 or 6 stakes 126) that can be placed around each dowel pin hole 122 in a given hook tab 114.

[0076] In (608), method 600 may include determining, for each current hook element, a first possible combination of the current hook element with other hook elements from a plurality of hook elements, and the number of current stakes in each hook element of each first possible combination. For example, as described above, the computing system 302 can determine, for each current hook tab 114 identified in the current data, a first possible combination of the current hook tab 114 with other current hook tabs 114 and corresponding current hook tabs 114 that satisfy a given interval rule, and determine the number of corresponding current stakes 126 in each hook tab 114 of each first possible combination.

[0077] Furthermore, in (610), method 600 may include identifying from the first possible combinations a first solution combination in which the current number of stakes in each hook element of each first solution combination is less than the maximum number of stakes. For example, as described above, the computing system 302 can identify a first solution combination from the first possible combinations in which, in particular, the current number of stakes 126 in each hook tab 114 of each first solution combination is less than the maximum number of stakes N.

[0078] In (612), method 600 may include determining at least one desirable solution from the first combination of solutions that has the highest number of possible future adjustments. For example, as discussed above, computing system 302 can determine at least one desirable solution from the first combination of solutions that has the highest number of possible future adjustments (loops).

[0079] Furthermore, in (614), method 600 may include controlling the user interface to show at least one desirable solution. For example, as described above, the computing system 302 can control the operation of the user interface 320 to show at least one desirable solution.

[0080] In addition, in (616), method 600 may include placing dowel pins and stakes on the rotor at least partially based on at least one preferred solution. For example, once the user interface 320 is controlled to show at least one preferred solution, the user can place dowel pins 124 and corresponding stakes 126 on the rotor 102 according to one of the at least one preferred solutions.

[0081] This specification discloses the present invention in its best mode and uses examples to enable those skilled in the art to carry out the invention, including the fabrication and use of any device or system, and the execution of any incorporated method. The patentable scope of the present invention is defined by the claims and may include other examples that those skilled in the art may conceive. Such other examples are within the scope of the claims if they include structural elements that are not different from the language of the claims, or equivalent structural elements that do not substantially differ from the language of the claims.

[0082] Further aspects of the present invention are provided by the subject matter of the following clauses.

[0083] A method for servicing a turbomachinery having a rotor and a plurality of rotor blades, wherein the rotor has a plurality of hook elements for housing a retaining device. The method includes receiving current data by a computing system indicating the current number of each hook element of the plurality of hook elements having dowel pin holes and the current number of stakes for each hook element. The method further includes receiving a prescribed spacing rule for the dowel pins in the plurality of hook elements by a computing system. The method further includes receiving a maximum number of stakes per dowel pin hole by a computing system. The method further includes determining a first possible combination of the current hook elements of the plurality of hook elements and corresponding hook elements, based on the prescribed spacing rule and the current number of stakes in each hook element of each first possible combination by a computing system. The method includes identifying a first solution combination from the first possible combinations, wherein the current number of stakes in each hook element of each first solution combination is less than the maximum number of stakes. Furthermore, this method includes using a computing system to determine at least one desirable solution among the first combination of solutions that has the highest number of possible future improvements. In addition, this method includes using a computing system to control a user interface to show at least one desirable solution.

[0084] A method for servicing a turbomachinery having a rotor and a plurality of rotor blades, wherein the rotor has a plurality of hook elements for housing a retaining device. The method includes inputting current data, via a user interface of a computing system, indicating the current number of hook elements of the plurality of hook elements having dowel pin holes, and the current number of stakes for each of the current hook elements. The method further includes inputting a prescribed spacing rule for dowel pins within the plurality of hook elements via a user interface of the computing system. The method further includes inputting a maximum number of stakes per dowel pin hole via a user interface of the computing system. The method further includes determining, via the computing system, a first possible combination of the current hook elements of the plurality of hook elements corresponding to other hook elements, based on the prescribed spacing rule and the current number of stakes in each of the hook elements of each of the first possible combinations. The method further includes identifying a first solution combination from the first possible combinations, wherein the current number of stakes in each of the hook elements of each of the first solution combinations is less than the maximum number of stakes. This method includes using a computing system to determine at least one desirable solution from the first combination of solutions that has the highest number of possible future adjustments. Furthermore, this method includes using a computing system to control a user interface to show at least one desirable solution. In addition, this method includes placing dowel pins and stakes on the rotor based at least partially on at least one desirable solution.

[0085] The method of one or more of the above clauses, wherein controlling the user interface to show at least one preferred solution includes controlling the user interface to show at least one preferred solution and the number of possible future improvements for each of the at least one preferred solution.

[0086] The method of one or more of the above clauses, wherein controlling the user interface to show at least one desired solution includes controlling the user interface to highlight at least one desired solution from the remaining solutions of a first solution combination.

[0087] The method of one or more of the above clauses, wherein determining at least one desirable solution includes, for each given first solution combination among the first solution combinations, increasing the number of current stakes in each hook element of the given first solution combination in the current data by a predetermined number of fixes, for each hook element of the given first solution combination after increasing the number of current stakes, determining a second possible combination of hook elements from a plurality of hook elements and a corresponding hook element based on a prescribed interval rule and the number of current stakes in each hook element of each of the second possible combinations, and identifying a second solution combination from the second possible combinations, wherein at least one desirable solution is determined at least in part on the second solution combination.

[0088] Identifying a second solution combination includes identifying the second solution combination as one of the second possible combinations, wherein the second possible combination has a minimum number of hook elements with fewer stakes than the maximum number if the current number of stakes in each hook element of each of the second possible combinations is less than or equal to a predetermined number, or has a minimum number of hook elements with the maximum number of stakes if the current number of stakes in each hook element of each of the second possible combinations is greater than a predetermined number.

[0089] If a first combination of solutions is not identified, the computing system identifies alternative combinations of solutions, wherein the current number of stakes in each hook element of each alternative combination of solutions is equal to the maximum number of stakes; the computing system identifies a perforated solution of an alternative combination of solutions having the fewest number of hook elements and the maximum number of stakes; and the computing system further recommends that, among a plurality of hook elements, a new dowel pinhole be drilled in each hook element that is directly adjacent in the circumferential direction to each hook element of the perforated solution having the maximum number of stakes.

[0090] The method of one or more of the above clauses, further comprising: a computing system receiving confirmation of a new dowel pin hole being drilled; a computing system updating current data in response to the receipt of the confirmation; and a computing system determining a new first possible combination based at least in part on the updated current data.

[0091] A system for servicing turbomachinery. The system includes turbomachinery having a rotor and a plurality of rotor blades, the rotor having a plurality of hook elements for housing a retaining device. The system further includes a user interface. In addition, the system includes a computing system. The computing system is configured to receive current data indicating the current state of each hook element of a plurality of hook elements having dowel pin holes, and the current number of stakes for each hook element, to receive a prescribed spacing rule for the dowel pins within the plurality of hook elements, and to receive the maximum number of stakes per dowel pin hole. The computing system is further configured to determine a first possible combination of the current hook elements of the plurality of hook elements and the corresponding hook elements, based on the prescribed spacing rule and the current number of stakes in each hook element of each of the first possible combinations. The computing system is configured to identify a first solution combination from the first possible combinations, where the current number of stakes in each hook element of each of the first solution combinations is less than the maximum number of stakes. Furthermore, the computing system is configured to determine at least one desirable solution from the first set of solutions that has the highest number of possible future improvements. In addition, the computing system is configured to control the user interface to show at least one desirable solution.

[0092] The system described in one or more of the above clauses includes a computing system configured to control a user interface to show at least one desired solution, and a computing system configured to control a user interface to show at least one desired solution and the number of possible future improvements for each of the at least one desired solution.

[0093] The systems described in one or more of the above clauses include a computing system configured to control a user interface to show at least one desired solution, which is configured to control a user interface to highlight at least one desired solution from the remaining solutions of a first solution combination.

[0094] A system according to one or more of the above clauses, comprising a computing system configured to determine at least one desirable solution, which includes increasing the number of current stakes in each of the hook elements of a given first solution combination in the current data by a predetermined number of units, for a given first solution combination among the first solution combinations, for each of the hook elements of a given first solution combination after increasing the number of current stakes, determining a second possible combination of a further hook element and a corresponding hook element from a plurality of hook elements based on a prescribed interval rule and the number of current stakes in each of the hook elements of each of the second possible combinations, and identifying a second solution combination from the second possible combinations, wherein at least one desirable solution is determined at least in part based on the second solution combination.

[0095] A system according to one or more of the above clauses, wherein multiple hook elements are provided with multiple hook tabs, and the retaining device is provided with a locking wire. [Explanation of Symbols]

[0096] 10. Gas turbines, turbomachinery 12 Entrance Section 14 Compressor Section 16. Combustor Section 18 Turbine Section 20 Exhaust Section 22 shafts 24 Rotor Discs 26 Rotor blades, rotor discs, blades 28 Rotor Discs 30 rotor blades, blades 31. Outer casing, turbine casing 32 High-temperature gas pathway 34 Combustion gases 100 Turbine rotor and blade assembly 102 Turbine rotor, rotor 104 Blades 106 Radial protrusion 108 dovetail slots 110 Dovetail section 112 Locking wire, retaining device 112A Locking Wire Tab 114 Hook elements, hook tabs, pinning hook tabs 114P1 First pinning hook tab 114P2 Second pinning hook tab 116 slots 118 Blade hook tab element, blade hook tab 120 slots 122 Dowel pin holes 124 Dowel Pins 126 stakes 128 stake holes 128A First stake hole 128B Second stake hole 200A spacing rules 200B spacing rules 200C spacing rules 202 Rotor, Rotor Outer Circumference 220 User Interface 300 Systems 302 Computing Systems 304 Processors 306 memory 308 data 310 Computer-readable instructions, commands 312 Rotor Information Database, Database 314 Interval Rule Database, Database 316 Solution Modules 318 Control Module 320 User Interfaces 400 Algorithms 500 ways 600 ways

Claims

1. A method for servicing a turbomachinery (10), wherein the turbomachinery (10) has a rotor (102) and a plurality of rotor blades (104), the rotor (102) has a plurality of hook elements (114) for housing a holding device (112), and the method is The computing system (302) receives current data indicating the current number of each of the plurality of hook elements (114) having dowel pin holes (122), and the current number of stakes (126) for each of the hook elements (114), The computing system (302) receives a predetermined interval rule for the dowel pins (124) within the plurality of hook elements (114), The computing system (302) receives the maximum number of stakes (126) for each dowel pin hole (122), The computing system (302) determines, for each of the current hook elements (114), the first possible combination of the current hook element (114) and the other hook elements (114) of the plurality of hook elements (114), based on the prescribed interval rule and the number of current stakes (126) in each of the first possible combinations of the hook elements (114). The computing system (302) identifies a first solution combination from the first possible combinations, wherein the current number of stakes (126) in each of the hook elements (114) of the first solution combination is less than the maximum number of stakes (126). The computing system (302) determines at least one desirable solution among the first solution combinations that has the highest number of possible future improvements, and A method comprising using the computing system (302) to control a user interface (320) to present the at least one desired solution.

2. A method for servicing a turbomachinery (10), wherein the turbomachinery (10) has a rotor (102) and a plurality of rotor blades (104), the rotor (102) has a plurality of hook elements (114) for housing a holding device (112), and the method is The user interface (320) of the computing system (302) inputs current data indicating the current number of each of the plurality of hook elements (114) having dowel pin holes (122), and the current number of stakes (126) for each of the hook elements (114), The user interface (320) of the computing system (302) inputs a predetermined interval rule for the dowel pins (124) within the plurality of hook elements (114), The user interface (320) of the computing system (302) allows inputting the maximum number of stakes (126) for each dowel pin hole (122). The computing system (302) determines, for each of the current hook elements (114), the first possible combination of the current hook element (114) among the plurality of hook elements (114) based on the prescribed interval rule and the number of current stakes (126) in each of the hook elements (114) in each of the first possible combinations, The computing system (302) identifies a first solution combination from the first possible combinations, wherein the current number of stakes (126) in each of the hook elements (114) of the first solution combination is less than the maximum number of stakes (126). The computing system (302) determines at least one desirable solution among the combinations of the first solution that has the highest number of possible future improvements. The computing system (302) controls the user interface (320) to show the at least one desired solution, and A method comprising positioning the dowel pins (124) and stakes (126) on the rotor (102) at least partially based on the at least one preferred solution.

3. The method according to claim 1 or 2, wherein controlling the user interface (320) to show the at least one desired solution includes controlling the user interface (320) to show the at least one desired solution and the number of possible future improvements for each of the at least one desired solution.

4. The method according to any one of claims 1 to 3, wherein controlling the user interface (320) to show the at least one preferred solution includes controlling the user interface (320) to highlight the at least one preferred solution from the remaining solutions of the first solution combination.

5. Determining the at least one desirable solution is, for each of the given combinations of first solutions, The computing system (302) increases the number of current stakes (126) in each of the hook elements (114) of the given first solution combination in the current data by a predetermined number of adjustments. The computing system (302) determines, after increasing the number of current stakes (126), a second possible combination of a further hook element (114) and a corresponding hook element (114) from among the plurality of hook elements (114), based on the prescribed spacing rule and the number of current stakes (126) in each of the hook elements (114) of the given first solution combination, and The method according to any one of claims 1 to 4, comprising identifying a second combination of solutions from the second possible combinations using the computing system (302), wherein the at least one desirable solution is determined at least partially on the second combination of solutions.

6. Identifying the second solution combination includes identifying the second solution combination as one of the second possible combinations, and the second possible combination is If the number of stakes (126) at the current time for each of the hook elements (114) in each of the second possible combinations is less than or equal to a predetermined number, then the number of hook elements (114) is the minimum and the number of stakes (126) is less than the maximum, or The method according to claim 5, wherein if the current number of stakes (126) in each of the hook elements (114) of each of the second possible combinations is greater than a predetermined number, the number of hook elements (114) is the minimum and the number of stakes (126) is the maximum.

7. If the first solution combination is not specified, Identifying alternative solution combinations by the computing system (302), wherein the current number of stakes (126) in each of the hook elements (114) of each alternative solution combination is equal to the maximum number of stakes (126). The computing system (302) identifies perforation solutions of alternative solution combinations in which the number of hook elements (114) is the minimum and the number of stakes (126) is the maximum, and The method according to any one of claims 1 to 6, further comprising the computing system (302) recommending that a new dowel pin hole (122) be drilled in each hook element (114) that is directly adjacent in the circumferential direction to each of the hook elements (114) of the plurality of hook elements (114) in which the stake (126) is the maximum number.

8. The computing system (302) receives confirmation of the newly drilled dowel pin holes (122), The computing system (302) updates the current data in response to the receipt of the confirmation, and The method according to claim 7, further comprising determining a new first possible combination based at least in part on the updated current data by the computing system (302).

9. A system (300) for maintaining a turbomachinery (10), wherein the system (300) A turbomachine (10) having a rotor (102) and a plurality of rotor blades (104), wherein the rotor (102) has a plurality of hook elements (114) for housing a holding device (112), User interface (320), A computing system (302), Receiving current data indicating the current number of each hook element (114) and the current number of stakes (126) for each of the plurality of hook elements (114) having dowel pin holes (122), Receiving a prescribed interval rule for the dowel pin (124) within the plurality of hook elements (114), To receive the maximum number of stakes (126) per dowel pin hole (122), For each of the current hook elements (114), the first possible combination of the current hook element (114) and the other hook elements (114) among the plurality of hook elements (114) is determined based on the prescribed spacing rule and the number of current stakes (126) in each of the first possible combinations of the hook elements (114). Identifying a first solution combination from the first possible combinations, wherein the current number of stakes (126) in each of the hook elements of each of the first solution combinations is less than the maximum number of stakes (126). To determine at least one desirable solution among the combinations of the first solution that has the highest number of possible future improvements, and A system (300) including a computing system (302) configured to control the user interface (320) to show the at least one desired solution.

10. The system (300) according to claim 9, wherein the computing system (302) configured to control the user interface (320) to show the at least one desired solution includes a computing system (302) configured to control the user interface (320) to show the at least one desired solution and the number of possible future improvements for each of the at least one desired solution.

11. The system (300) according to claim 9 or 10, wherein the computing system (302) configured to control the user interface (320) to show the at least one desired solution is configured to control the user interface (320) to highlight the at least one desired solution from the remaining solutions of the first solution combination.

12. A computing system (302) configured to determine at least one desirable solution, for each of the given first solution combinations among the first solution combinations, The number of current stakes (126) in each of the hook elements (114) of the given first solution combination in the current data is increased by a predetermined number of adjustments. After increasing the number of current stakes (126), for each of the hook elements (114) of the given first solution combination, the second possible combination of further hook elements (114) and corresponding hook elements (114) from the plurality of hook elements (114) is determined based on the prescribed spacing rule and the number of current stakes (126) in each of the hook elements (114) of each of the second possible combinations, and The system (300) according to any one of claims 9 to 11, comprising a computing system (302) configured to identify a second combination of solutions from the second possible combinations such that the at least one desirable solution is determined at least partially on the second combination of solutions.

13. The system (300) according to any one of claims 9 to 12, wherein the plurality of hook elements (114) comprises a plurality of hook tabs (114), and the retaining device (112) comprises a locking wire (112).

Images