The Nozzle Guide Vane Problem

The Nozzle Guide Vane Problem
复制标题

喷嘴导叶问题

DOI:
10.1287/opre.36.1.18
复制
发表时间:
1988
期刊:
Oper. Res.
影响因子:
--
通讯作者:
R. Plante
R. Plante
中科院分区:
--
文献类型:
--
作者:
R. Plante

文献摘要

被引文献

相似文献

喷嘴导叶问题解决了最大化可在严格规格内从喷嘴导叶库存组装的飞机燃气涡轮发动机喷嘴的数量的问题。过去的研究工作已将该问题分解为两个相关问题:(1)将库存中的喷嘴导向叶片分配给喷嘴,以及(2)已分配给喷嘴的叶片的统一排序。这两个问题都已被证明是 NP 困难的。因此,为了获得可在实时制造环境中有效使用的高效系统,我们开发了启发式程序并证明它们可以有效解决这些问题。我们详细描述了喷嘴导叶问题,并追踪了测量技术的一些发展,这些技术促进了该问题的实现,并促进了运筹学技术的使用来解决该问题。然后,我们开发了一个程序,用于对同一容器内的一组异质叶片进行统一排序。
The nozzle guide vane problem addresses the issue of maximizing the number of aircraft gas turbine engine nozzles that can be assembled, within strict specifications, from an inventory of nozzle guide vanes. Past research efforts have decomposed this problem into two related problems: (1) the assignment of nozzle guide vanes in inventory to a nozzle, and (2) the uniform sequencing of the vanes that have been assigned to a nozzle. Both of these problems have been shown to be NP-hard. Consequently, to obtain an efficient system that may be used effectively in a real-time manufacturing environment, we developed heuristic procedures and showed them to be effective in solving these problems. We describe the nozzle guide vane problem in detail and trace some of the developments in measurement technology that fostered the realization of the problem and facilitated the use of operations research techniques to solve it. We then develop a procedure for the uniform sequencing of a heterogeneous set of vanes within a...