防空导弹成本与防空导弹武器装备建设

在分析低成本防空导弹概念和需求的基础上,探讨了防空导弹武器系统的成本分解结构和对成本价格的敏感因素,研究了实现低成本的可行性、必要性及其与陆军防空装备体系建设的关系。     

寿命周期费用分析在保障性分析中的应用

探讨了费用分析在保障性分析中的作用和实际应用;介绍了在装备研制过程中应用保障性分析所产生的效益.     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

Scheduling with variable time slot costs

In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Multi‐item capacitated lot‐sizing problems with setup times and pricing decisions

We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Revisiting the justification for an all-volunteer force

In 1968, President Nixon established the Commission on an All-Volunteer Armed Force, or the Gates Commission, which served as the impetus and justification for an All-Volunteer Force (AVF). At the end of its deliberations, the commission recommended abolishing the draft and transforming the U.S. military into a force of volunteers beginning in 1973. Interestingly, the debate regarding the merits of both systems appeared to be largely economic – with cost–benefit analysis playing the primary role. Lately, we are beginning to see a new, politically-motivated impetus for returning to a “system of national service.” The ideas spurring this debate are many: the need to reaffirm the nation state, the commitment of citizens to the state, political ownership and oversight of the forces, the need for social equity in serving the nation, limiting the support for armed conflict by burden-sharing among citizens, and equitably spreading the personal cost of war.     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

基于战备完好率的军用飞机维修费用需求确定方法

军用飞机维修费用需求与战备完好率要求密切相关,为保持飞机一定的战备完好率水平,必须投入一定的维修费用。维修费用投入多,则维修设备齐全,维修人员维修能力高,维修备件充足,飞机故障修复时间短,战备完好率高;维修费用投入少,会造成维修设备短缺,设施破旧,维修人员培训不到位,维修备件供应不足等各种问题,直接影响战备完好率水平。     

Global planning of accelerated degradation tests based on exponential dispersion degradation models

The accelerated degradation test (ADT) is an efficient tool for assessing the lifetime information of highly reliable products. However, conducting an ADT is very expensive. Therefore, how to conduct a cost-constrained ADT plan is a great challenging issue for reliability analysts. By taking the experimental cost into consideration, this paper proposes a semi-analytical procedure to determine the total sample size, testing stress levels, the measurement frequencies, and the number of measurements (within a degradation path) globally under a class of exponential dispersion degradation models. The proposed method is also extended to determine the global planning of a three-level compromise plan. The advantage of the proposed method not only provides better design insights for conducting an ADT plan, but also provides an efficient algorithm to obtain a cost-constrained ADT plan, compared with conventional optimal plans by grid search algorithms.