自动喷水灭火系统成本效益分析

自动喷水灭火系统在我国一直存在质量不高、管理不当的现象,严重威胁人们的生命财产安全。产生这种现象的一个重要原因就在于投资者和业主不了解自动喷水灭火系统所能产生的经济效益,从而对设置该系统不够重视,甚至持反对的态度。针对这种情况,提出了一种定量评估设置自动喷水灭火系统的成本和效益的模型及具体计算方法,并结合工程实例验证了该模型的可行性。     

Noncooperative cost spanning tree games with budget restrictions

We extend the noncooperative game associated with the cost spanning tree problem introduced by Bergantiños and Lorenzo (Math Method Oper Res 59(2004), 393–403) to situations where agents have budget restrictions. We study the Nash equilibria, subgame perfect Nash equilibria, and strong Nash equilibria of this game. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

鱼雷寿命周期费用参数的灰色敏感性分析

鱼雷寿命周期费用受多种因素的影响,各因素对寿命周期费用的作用不同,有的作用大,有的作用小.在对鱼雷寿命周期费用建立模型时,需要分析哪些因素是影响寿命周期费用的主要因素,哪些因素是影响寿命周期费用的次要因素,即对寿命周期费用参数进行敏感性分析.利用灰色系统理论的灰色关联度对鱼雷寿命周期费用参数进行敏感性分析,可对这些参数按重要性进行分类, 有利于建立模型时对参量的选择.     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

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

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

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

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

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     

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