METHOD

Abstract

A set of gas turbine engine components comprises N gas turbine engine components. Each gas turbine engine component has a respective flow value. A method for selecting the N gas turbine engine components includes ordering the gas turbine engine components in dependence upon their respective flow value. For each ordered group of components a maximum range is determined for the respective flow values. If this maximum range is less than a pre-determined range limit then the ordered group becomes a set. If this criteria is not met then another component is added to the group, the group is reordered by flow value and the range check is repeated with allowable groups forming selected sets and further components being added as required.

Claims

1. A method of selecting sets of gas turbine engine components, each set comprising N gas turbine engine components, and each gas turbine engine component having a respective flow value, the flow value for each of the gas turbine engine components being within the range of Ct, where C is a nominal target value and t is an allowable variation from the nominal target value, the method comprising the steps of: (i) selecting a pre-determined allowable range value for the flow values of the gas turbine engine components, the pre-determined allowable range value being less than 2*t; (ii) providing a stock of N gas turbine engine components; (iii) ordering the N gas turbine engine components in dependence upon their respective flow value; (iv) for the N gas turbine engine components, determining a maximum range value between the highest flow value and the lowest flow value; (v) if the maximum range value is equal to or less than the pre-determined allowable range value, then assigning the N gas turbine engine components as a set, and repeating steps (ii) to (iv); (vi) if the maximum range value is greater than the pre-determined allowable range value, then adding an additional gas turbine engine component to the stock; (vii) ordering the stock of gas turbine engine components in dependence upon their respective flow values; (viii) for each group of sequential N gas turbine engine components within the ordered stock, determining a maximum range value between the highest flow value and the lowest flow value; (ix) if the maximum range value for any group of sequential N gas turbine engine components is equal to or less than the pre-determined allowable range value, then assigning the group of sequential N gas turbine engine components having the lowest maximum range value as a set; (x) if the maximum range value for any group of sequential N gas turbine engine components is greater than the pre-determined allowable range value, then adding an additional gas turbine engine component to the stock; and (xi) repeating steps (vii) to (x) in dependence upon the quantity of sets of gas turbine engine components that may be required.

2. A method of selecting M sets of gas turbine engine components, each set comprising N gas turbine engine components, and each gas turbine engine component having a respective flow value, the method comprising the steps of: (i) providing a stock of (M*N) gas turbine engine components; (ii) ordering the (M*N) gas turbine engine components in dependence upon their respective flow value; and (iii) dividing the ordered (M*N) gas turbine engine components into M sequentially ordered sets of N gas turbine engine components.

3. The method as claimed in claim 1, wherein the pre-determined allowable range value is determined in dependence on a distribution of the flow values within the allowable variation (t) from the nominal target value (C).

4. Method as claimed in claim 1, wherein the pre-determined allowable range value is determined in dependence on a time-history of the flow values as the components are manufactured.

5. The method as claimed in claim 1, wherein the pre-determined allowable range value is 0.4*(2*t).

6. The method as claimed in claim 1, wherein step (i) comprises the step of (i) providing the stock of gas turbine engine components in a time ordered sequence;

7. The method as claimed in claim 1, wherein each gas turbine engine component has an internal cooling flow, and the respective flow value is a flow-rate value for the internal cooling flow.

8. A computer program that, when read by a computer, enables performance of the method as claimed in claim 1.

9. A non-transitory computer readable storage medium comprising computer readable instructions that, when read by a computer, enables performance of the method as claimed in claim 1.

10. A signal comprising computer readable instructions that, when read by a computer, causes performance of the method as claimed in claim 1.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0049] There now follows a description of an embodiment of the disclosure, by way of non-limiting example, with reference being made to the accompanying drawings in which:

[0050] FIG. 1 shows a sectional side view of a gas turbine engine;

[0051] FIG. 2 shows a flow chart detailing a method according to a first embodiment of the disclosure; and

[0052] FIG. 3 shows a flow chart detailing a method according to a second embodiment of the disclosure.

[0053] It is noted that the drawings may not be to scale. The drawings are intended to depict only typical aspects of the disclosure, and therefore should not be considered as limiting the scope of the disclosure. In the drawings, like numbering represents like elements between the drawings.

DETAILED DESCRIPTION

[0054] A turbofan gas turbine engine 10, as shown in FIG. 1, comprises in flow series an intake 11, a fan 12, an intermediate pressure compressor 13, a high pressure compressor 14, a combustion chamber 15, a high pressure turbine 16, an intermediate pressure turbine 17, a low pressure turbine 18 and an exhaust 19. The high pressure turbine 16 is arranged to drive the high pressure compressor 14 via a first shaft 26. The intermediate pressure turbine 17 is arranged to drive the intermediate pressure compressor 13 via a second shaft 28 and the low pressure turbine 18 is arranged to drive the fan 12 via a third shaft 30. In operation air flows into the intake 11 and is compressed by the fan 12. A first portion of the air flows through, and is compressed by, the intermediate pressure compressor 13 and the high pressure compressor 14 and is supplied to the combustion chamber 15. Fuel is injected into the combustion chamber 15 and is burnt in the air to produce hot exhaust gases which flow through, and drive, the high pressure turbine 16, the intermediate pressure turbine 17 and the low pressure turbine 18. The hot exhaust gases leaving the low pressure turbine 18 flow through the exhaust 19 to provide propulsive thrust. A second portion of the air bypasses the main engine to provide propulsive thrust.

[0055] Each of the intermediate pressure turbine 17 and the high pressure turbine 16 comprises a circumferential array of turbine blades. These turbine blades are provided with internal cooling flow passages, each of which has an associated cooling flow rate when in normal operation.

[0056] It is understood from the operation of a gas turbine engine that a set of blades having internal flow passages that are high flowing will have a lower Blade Feed Pressure Ratio (BFPR) than will a set of blades that are low flowing.

[0057] Consequently, a low flowing blade within a high flowing set of blades will experience a lower BFPR and therefore a lower flow than a nominal flow rated blade having a nominal BFPR.

[0058] Sets of blades that have a large standard deviation and/or high skewness in their flow values will have blades in the above scenario which will lead to a higher T.sub.metal for the lowest flowing blades.

[0059] FIG. 2 shows a flow chart detailing a method of selecting sets of gas turbine engine components. In the following disclosure these gas turbine engine components are high pressure turbine blades. However, the method of the disclosure is equally applicable to the selection of other turbine blades (i.e. from the intermediate pressure compressor) or compressor blades. Likewise the method may be applied to the selection of other turbomachinery components having an associated flow characteristic.

[0060] At step 200 an allowable range value is selected for the flow values of the components in the stock. This range is a trade-off between the additional costs associated with an increased stock of components, and the predicted service life improvement associated with the narrower distribution of flow values between components in a single set. The trade-off is assessed using knowledge of current manufacturing capability, including (but not necessarily limited to):

[0061] (i) knowledge of the distribution of flow values within the allowable variation (t) from the nominal target value (C); and

[0062] (ii) knowledge of the time-history of flow values as the components are manufactured within the facility. Knowing the variability of the flow values with time enables an assessment of how long it would take to build up the sets.

[0063] A stock of N components is provided as a starting point in step 205, where N (an integer) is the quantity of components that comprise an individual set. In this embodiment the stock of N components is provided in a time ordered sequence. In other words, the stock is accumulated in the order in which the components are produced. In this way the method of the disclosure can be applied on a real-time basis to the component production process.

[0064] This stock of N components is then ordered at step 210, in dependence on the respective flow values for each component. For example the components can be ordered by ascending flow value. In the present example the flow value is a flow-rate value. However in an alternative arrangement this flow value might equally be a flow pressure or a flow temperature.

[0065] At step 215 a maximum range value is determined for the set of N components; this maximum range value being the difference in flow values between the highest flow value and the lowest flow value for the N components.

[0066] This maximum range value is then compared in step 220 to the pre-determined allowable range value (selected at step 200).

[0067] If the maximum range value is less than or equal to the allowable range value then the stock of N components becomes a set of components at step 225, and the activity returns to step 205 with a fresh set of N components.

[0068] However, if the maximum range value is greater than the allowable range value then an additional component is added to the stock at step 230. At this point the stock comprises (N+1) components.

[0069] The stock of components is then ordered at step 235, again in dependence upon their respective flow value. At this point there is more than one group of sequentially ordered (by flow value) components. For example following the first instance where an additional component is added, there will be two groups of sequentially ordered components, namely 1.fwdarw.N and 2.fwdarw.(N+1).

[0070] For each group of N sequentially ordered components (at step 240) a maximum range is determined between the highest flow value and the lowest flow value. In the example from the last paragraph there will then be two maximum range values; one for each of the 1.fwdarw.N and 2.fwdarw.(N+1) groups.

[0071] At step 245 each of these maximum range values is compared to the pre-determined allowable range value (from step 200).

[0072] If the maximum range value is less than or equal to the allowable range value then the group of N components having the lowest maximum range value becomes a set of components at step 250. At this point, if the stock is less than N components then additional components are added to the stock (at step 255) to bring the quantity back to N, and the activity returns to step 235 in readiness for the stock to be reordered.

[0073] However, if the maximum range value is greater than the allowable range value then an additional component is added to the stock at step 230 and steps 235 to 245 are repeated.

[0074] The method illustrated in the flow chart of FIG. 2 can be worked for as long as required to obtain the required quantity of sets of engine components.

[0075] FIG. 2 shows a flow chart detailing a method of selecting sets of gas turbine engine components according to a second embodiment of the disclosure.

[0076] The method of FIG. 2 starts at step 300 with a selection of the quantity M (an integer) of sets of components that are to be selected.

[0077] At step 310 a stock of (M*N) components is provided, where N (an integer) is the quantity of components that comprise an individual set. In this embodiment the stock of (M*N) components is provided in a time ordered sequence. In other words, the stock is accumulated in the order in which the components are produced. In this way the method of the disclosure can be applied on a real-time basis to the component production process.

[0078] The collection of (M*N) components is then ordered in dependence upon the respective flow values of the components. As outlined above this step of ordering may be by ascending flow value. Similarly, the flow value while a flow-rate value in the present example may alternatively be some other flow characteristic such as pressure or temperature).

[0079] The ordered collection of (M*N) components is then divided (at step 330) into M sequentially ordered sets of N components each.

[0080] For example if four sets of components are to be selected then M=4,and if each set comprises 80 components, then the ordered collection of (M*N) components will comprise 320 components. The selected sets will then be components 1 to 80, 81 to 160, 161 to 240, and 241 to 320.

[0081] In one or more examples, the operations described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the operations may be stored on or transmitted over, as one or more instructions or code, a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media, which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium.

[0082] By way of example, and not limitation, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transient media, but are instead directed to non-transient, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0083] Instructions may be executed by one or more processors, such as one or more DSPs, general purpose microprocessors, ASICs, FPGAs, or other equivalent integrated or discrete logic circuitry. Accordingly, the term processor, as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules. Also, the techniques could be fully implemented in one or more circuits or logic elements.

[0084] The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a processor, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.

[0085] While the invention has been described in conjunction with the exemplary embodiments described above, many equivalent modifications and variations will be apparent to those skilled in the art when given this disclosure. Accordingly, the exemplary embodiments of the invention set forth above are considered to be illustrative and not limiting. Moreover, in determining extent of protection, due account shall be taken of any element which is equivalent to an element specified in the claims. Various changes to the described embodiments may be made without departing from the spirit and scope of the invention.

[0086] In addition, where a range of values is provided, it is understood that every intervening value, between the upper and lower limit of that range and any other stated or intervening value in that stated range, is encompassed within the invention.

[0087] Except where mutually exclusive, any of the features may be employed separately or in combination with any other features and the disclosure extends to and includes all combinations and sub-combinations of one or more features described herein.

[0088] Although specific advantages have been enumerated above, various embodiments may include some, none, or all of the enumerated advantages.