最小费用树

本文在赋边权w和顶点权θ的网络中,建立了最小费用树问题的网络模型。文中对问题的复杂性进行了讨论并给出了求解问题的算法     

BP神经网络的飞机机体研制费用估算

提出一种应用人工神经网络预测飞机机体研制费用的方法.该方法利用偏最小二乘法对飞机性能参数进行了主成分提取,用这些主成分作为BP网络的输入变量,建立了一种基于BP神经网络的飞机研制费用的估算模型,应用该模型对典型的飞机机体研制费用进行了预测.预测结果表明,该方法是有效的、可行的.     

武器系统模糊寿命周期费用模型

武器系统的寿命周期费用建模较多采用参数法,而参数法中最常用的是最小二乘回归.考虑费用统计数据的模糊性,提出用模糊最小二乘回归来建立武器系统模糊寿命周期费用模型,并结合实例对武器系统寿命周期费用进行了分析.结果表明,这种方法能达到令人满意的拟合精度,具有实用价值.     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

Optimal allocation of minimal repairs in parallel and series systems

In reliability engineering, the concept of minimal repair describes that the repair brings the failed unit (eg, system or component) to the situation which is same as it was just before the failure. With the help of the well‐known Gamma‐Poisson relationship, this paper investigates optimal allocation strategies of minimal repairs for parallel and series systems through implementing stochastic comparisons of various allocation policies in terms of the hazard rate, the reversed hazard rate, and the likelihood ratio orderings. Numerical examples are presented to illustrate these findings as well. These results not only strengthen and generalize some known ones in the seminal work of Shaked and Shanthikumar, but also solve the open problems proposed by Chahkandi et al.'s study and Arriaza et al.'s study.     

Optimal control policies for an inventory system with commitment lead time

We consider a firm which faces a Poisson customer demand and uses a base‐stock policy to replenish its inventories from an outside supplier with a fixed lead time. The firm can use a preorder strategy which allows the customers to place their orders before their actual need. The time from a customer's order until the date a product is actually needed is called commitment lead time. The firm pays a commitment cost which is strictly increasing and convex in the length of the commitment lead time. For such a system, we prove the optimality of bang‐bang and all‐or‐nothing policies for the commitment lead time and the base‐stock policy, respectively. We study the case where the commitment cost is linear in the length of the commitment lead time in detail. We show that there exists a unit commitment cost threshold which dictates the optimality of either a buy‐to‐order (BTO) or a buy‐to‐stock strategy. The unit commitment cost threshold is increasing in the unit holding and backordering costs and decreasing in the mean lead time demand. We determine the conditions on the unit commitment cost for profitability of the BTO strategy and study the case with a compound Poisson customer demand.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

Oligopolistic contracting: Channel coordination under competition

We study contracts between a single retailer and multiple suppliers of two substitutable products, where suppliers have fixed capacities and present the retailer cost contracts for their supplies. After observing the contracts, the retailer decides how much capacity to purchase from each supplier, to maximize profits from the purchased capacity from the suppliers plus his possessed inventory (endowment). This is modeled as a noncooperative, nonzero‐sum game, where suppliers, or principals, move simultaneously as leaders and the retailer, the common agent, is the sole follower. We are interested in the form of the contracts in equilibrium, their effect on the total supply chain profit, and how the profit is split between the suppliers and the retailer. Under mild assumptions, we characterize the set of all equilibrium contracts and discuss all‐unit and marginal‐unit quantity discounts as special cases. We also show that the supply chain is coordinated in equilibrium with a unique profit split between the retailer and the suppliers. Each supplier's profit is equal to the marginal contribution of her capacity to supply chain profits in equilibrium. The retailer's profit is equal to the total revenue collected from the market minus the payments to the suppliers and the associated sales costs.     

基于博弈论的装备科研、购置、维修经费比例关系优化分析

通过不同时期国家战略部署、科研发展情况及经济承受能力对装备经费分配的影响分析,采用博弈的方法,建立了装备科研、购置和维修费之间的比例关系优化模型,给出了寻求纳什均衡点的迭代算法,并进行了仿真计算.仿真结果证明了该方法的可行性与正确性.     

基于事例推理的装备软件成本估算研究

采用基于事例推理的估算方法可以很好地解决传统经验函数估算软件成本时的局限性。讨论了装备软件成本估算和基于事例推理研究的特点,从总体上描述了基于事例推理装备软件成本估算系统结构和实现流程,阐述了主要的研究内容,包括影响软件成本因素、系统的事例表示方法以及相似度的基本算法及事例的改写,并通过实例验证了事例推理在装备软件成本估算实践中的具体应用。