基于规程匹配的维修作业虚拟确认技术

在建立了维修作业规程信息形式化模型的基础上,利用PAR语言将维修规程进行规范化描述,进而形成作业规程源案例库.采用混合相似度方法对模拟作业内容与源案例库规程进行相似度计算,将计算结果作为维修作业虚拟确认的判断依据,实现了维修作业规程指导虚拟维修仿真的目的.最后,通过实例证明了该方法的适用性和先进性.     

A streamlined simplex approach to the singly constrained transportation problem

A primal simplex procedure is developed to solve transportation problems with an arbitrary additional linear constraint. The approach is a specialization of the Double Reverse Method of Charnes and Cooper. Efficient procedures for pricing-out the basis, determining representations, and implementing the change of basis are presented. These procedures exploit the pure transportation substructure in such a manner that full advantage may be taken of the computational schemes and list structures used to store and update the basis in codifying the MODI method. Furthermore, the pricing-out and change-of-basis procedures are organized in a manner that permits the calculations for one to be utilized in the other. Computational results are presented which indicate that this method is at least 50 times faster than the state-of-the-art LP code, APEX-III. Methods for obtaining basic primal “feasible” starts and “good” feasible integer solutions are also presented.     

Postoptimality analysis in zero-one programming by implicit enumeration

The procedures for postoptimality analysis that are so much a part of linear programming studies have no simple counterparts in an integer programming context. In the case of Balas' Additive Algorithm, however, it would appear that the capacity of the technique to facilitate certain types of postoptimality analysis has not been fully exploited. This paper proposes an extension of the additive algorithm that utilizes insights generated while solving the original problem to do subsequent analysis upon it. In particular, procedures are developed for doing limited parameter ranging and for seeking new optima in light of parameter changes.     

Fully sequential indifference‐zone selection procedures with variance‐dependent sampling

Fully sequential indifference‐zone selection procedures have been proposed in the simulation literature to select the system with the best mean performance from a group of simulated systems. However, the existing sequential indifference‐zone procedures allocate an equal number of samples to the two systems in comparison even if their variances are drastically different. In this paper we propose new fully sequential indifference‐zone procedures that allocate samples according to the variances. We show that the procedures work better than several existing sequential indifference‐zone procedures when variances of the systems are different. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Multiproduct dynamic lot-sizing model with coordinated replenishments

In this article we consider a multiproduct dynamic lot-sizing model. In addition to a separate setup cost for each product ordered, a joint setup cost is incurred when at least one product is ordered. We formulate the model as a concave minimization problem over a compact polyhedral set and present a finite branch and bound algorithm for finding an optimal ordering schedule. Superiority of the branch and bound algorithm to the existing exact procedures is demonstrated. We report computational experience with problems whose dimensions render the existing procedures computationally infeasible.     

Printed circuit board family grouping and component allocation for a multimachine,open-shop assembly cell

This article considers a particular printed circuit board (PCB) assembly system employing surface mount technology. Multiple, identical automatic placement machines, a variety of board types, and a large number of component types characterize the environment studied. The problem addressed is that of minimizing the makespan for assembling a batch of boards with a secondary objective of reducing the mean flow time. The approach adopted is that of grouping boards into production families, allocating component types to placement machines for each family, dividing of families into board groups with similar processing times, and the scheduling of groups. A complete setup is incurred only when changing over between board families. For the environment studied, precedence constraints on the order of component placement do not exist, and placement times are independent of feeder location. Heuristic solution procedures are proposed to create board subfamilies (groups) for which the component mounting times are nearly identical within a subfamily. Assignment of the same component type to multiple machines is avoided. The procedures use results from the theory of open-shop scheduling and parallel processor scheduling to sequence boards on machines. Note that we do not impose an open-shop environment but rather model the problem in the context of an open shop, because the order of component mountings is immaterial. Three procedures are proposed for allocating components to machines and subsequently scheduling boards on the machines. The first two procedures assign components to machines to balance total work load. For scheduling purposes, the first method groups boards into subfamilies to adhere to the assumptions of the open-shop model, and the second procedure assumes that each board is a subfamily and these are scheduled in order of shortest total processing time. The third procedure starts by forming board subfamilies based on total component similarity and then assigns components to validate the open-shop model. We compare the performance of the three procedures using estimated daily, two-day, and weekly production requirements by averaging quarterly production data for an actual cell consisting of five decoupled machines. © 1994 John Wiley & Sons, Inc.     

An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria

In this paper, we consider the multiple criteria decision‐making problem of partitioning alternatives into acceptable and unacceptable sets. We develop interactive procedures for the cases when the underlying utility function of the decision maker is linear, quasiconcave, and general monotone. We present an application of the procedures to the problem of admitting students to the master's degree program at the Industrial Engineering Department, Middle East Technical University. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 592–606, 2001.     

A self‐adapting genetic algorithm for project scheduling under resource constraints

This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029     

Three ways of obtaining the average cost expression in a problem related to joint replenishment inventory control

This paper does not present a new result, rather it is meant to illustrate the choice of modelling procedures available to an analyst in a typical inventory control problem. The same “average cost per unit time” expression is developed by three quite different procedures. This variety of approaches, as well as the recounting of the author's chronological efforts to solve the problem, should be of interest to the reader. The specific inventory problem studied is one where the controller of an item is faced with random opportunities for replenishment at a reduced setup cost; the problem is an integral component of the broader problem of inventory control of a group of items whose replenishments are coordinated to reduce the costs of production, procurement, and/or transportation.     

Computational study of the multiechelon production planning problem

In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc.     

Adaptive forecasting of the size of a work force subject to random withdrawals

Adaptive forecasting procedures are developed for predicting the size of a work force which is subject to random withdrawals. The procedures are illustrated using Marine Corps data in which four stages of service for incoming cohorts are distinguished. Using these data, three forecasting procedures—conditional maximum likelihood estimation of prediction intervals; tolerance intervals; and Bayes prediction intervals—are compared.     

A time series analysis of some interrelated logistics performance variables

This paper is a case study. We show how the powerful methods of time series analysis can be used to investigate the interrelationships between Alert Availability, a logistics performance variable, and Flying Hours, an operational requirement, in the presence of a major change in operating procedures and using contaminated data. The system considered is the fleet of C-141 aircraft of the U.S. Air Force. The major change in operating procedures was brought about by what is known as Reliability Centered Maintenance, and the contaminated data were due to anomalies in reporting procedures. The technique used is a combination of transfer function modeling and intervention analysis.     

Empirical bayes single sampling plans for specified posterior consumer and producer risks

Empirical Bayes single-sample acceptance sampling procedures are derived. These procedures assume that the lot fraction defective varies randomly according to a completely unknown and unspecified prior distribution. The unknown prior density function is estimated based on sampling results from previous lots. A procedure is developed for obtaining single-sampling plans that achieve specified posterior consumer and producer risks. The procedures are illustrated for a real-data example.     

Approximation techniques in the solution of queueing problems

In the study of complex queueing systems, analysis techniques aimed al providing exact solutions become ineffective. Approximation techniques provide an attractive alternative in such cases. This paper gives an overview of different types of approximation techniques available in the literature and points out their relative merits. Also, the need for proper validation procedures of approximation techniques is emphasized.     

The initial provisioning decision for insurance type items

Initial provisioning decisions (inventory stocking requirements) for low demand items often have to be made without much knowledge of what future demand rates will be. When the nature of an item is such that little demand for it is expected, the problem of whether to stock initially or risk not stocking the item is most critical. This report discusses this problem and presents decision procedures which can be used to handle this aspect of initial provisioning. The procedures relate an item's provisioning desirability to its provisioning characteristics, such as expected cost, expected resupply time, current information on its likely demand rate, and to an overall operating policy or criterion. The criterion function measures the total system degredation as a function of the events of having items out of stock when demand occurs. Several different policy functions are discussed and the provisioning decision rules which apply to each are presented. Demand rate information is handled through a Bayesian type approach. The decision rules presented in this report can be utilized to either determine stocking requirements within a budgetary constraint, or determine the relative stocking desirability on an item-by-item basis.     

A comparison of several attribute sampling plans

The purpose of this research is to examine several types of procedures for attribute sampling inspection-the widely used Military Standard 105D plans [8], the lesser known Double Zero plans as developed by Ellis [4] and the Narrow Limit gaging plans of Ott and Mundel [9]. Each of the procedures is described with an effort made to illuminate their more subtle features. Then the plans are compared, whence it is revealed that (i) Narrow Limit gaging plans have a serious weakness in comparison to the others and (ii) Double Zero plans tend to be essentially conservative, but that sufficiently tight Military Standard 105D plans can be selected to achieve comparable performance in all ways.     

摩步师(团)反空袭作战空中威胁评估

运用定量和定性分析相结合的方法,对摩步师(团)战斗行动中面临的空中威胁进行了分析,提出了评估的方法和步骤,建立了评估模型,并结合实例对评估方法、步骤、模型进行了分析验证.实例计算表明,该方法的判断结果预见性好、可靠性强,对未来摩步师(团)反空袭作战有一定的现实意义.     

Minimal forecast horizon procedures for dynamic lot size models

This article presents new results which should be useful in finding production decisions while solving the dynamic lot sizing problem of Wagner–Whitin on a rolling horizon basis. In a rolling horizon environment, managers obtain decisions for the first period (or the first few periods) by looking at the forecasts for several periods. This article develops procedures to find optimal decisions for any specified number of initial periods (called planning horizon in the article) by using the forecast data for the minimum possible number of future periods. Computational results comparing these procedures with the other procedures reported in the literature are very encouraging.     

C/SiC复合材料残余应力的电火花小孔法测定研究

进行了C/SiC复合材料残余应力的小孔法表征.基于现有小孔法的不足以及材料的较好电导率,提出了电火花打孔法的残余应力测量方法,建立了相应的残余应力测量流程.进行了不同平整表面样品的残余应力测量.结果表明电火花打孔法具有较好的区分性,也表明C/SiC复合材料具有较小的本征残余应力和机加工应力,这说明:C/SiC复合材料作为反射镜材料具有很好的面形稳定性的优势.     

一种综合集成与演示验证一体化系统的构建方法

复杂性科学问题研究中的综合集成方法是构建研究平台的一项重要内容.针对复杂性研究中的系统平台的建模问题,提出一种综合集成与演示验证一体化系统的构建方法,探讨了具体实现方式和数据同步与数据一致性维护等问题.在雷达目标特性研究中,运用上述综合集成与演示验证一体化系统的构建方法,完成了一个具备尺度一致性和可扩展能力的电磁散射特性验证与演示系统.