基于逆向分层的工作流时间-费用优化方法

针对效用网格下基于优先级因子的工作流时间-费用优化问题,基于工作流的同步完成特征对任务进行分层并提出三种实时调度算法:基于逆向分层的sufferage(BLSuff)、基于逆向分层的min-min(BLMin)及基于逆向分层的min-max(BLMax)。算法设计基于优先级因子的衡量标准对时间与费用同时进行优化,并为任务设置期望完成时间以达到充分利用费用优化空间进行费用优化的目标。实验结果表明这三种算法在各种优先级因子下都能对工作流的执行时间与执行费用进行较好的优化。     

软件保障费用估算模型研究

分析了软件保障费用的基本构成和一般表达式,构建了软件错误更改费用估算模型、新功能保障费用估算模型和有时间限制的保障费用估算模型,并结合实例进行了分析。软件保障模型估算的研究对提高软件保障费用估算的精度和效率有重要意义。     

A (Q,R) inventory model with lost sales and erlang-distributed lead times

The exact expression is derived for the average stationary cost of a (Q,R) inventory system with lost sales, unit Poisson demands, Erlang-distributed lead times, fixed order cost, fixed cost per unit lost sale, linear holding cost per unit time, and a maximum of one order outstanding. Explicit expressions for the state probabilities and a fast method of calculating them are obtained for the case of Q greater than R. Exponential lead times are analyzed as a special case. A simple cyclic coordinate search procedure is used to locate the minimum cost policy. Examples of the effect of lead time variability on costs are given.     

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.     

给定人员情况下最小化开发时间和成本的软件项目调度

给出了一种软件项目的随机调度模型.它明确地把调度策略作为输入,一旦调度策略确定,模型就可以输出关于项目的完成时间或成本的一个概率分布.利用随机最优化技术,能够计算出软件项目的一个调度策略,它使得项目在人员给定的情况下开发时间和成本最小.     

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

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

关于装备使用阶段质量问题的探讨

在装备使用阶段部队活动的目的是为了充分发挥、保持、恢复和改善装备的综合保障性能,减少保障人力和费用、缩短保障时间,以满足作战和任务的要求.这些性能、费用和时间的要求正是装备质量的特性.质量要求在论证阶段提出,质量特性在设计和生产制造过程中形成,在使用过程中得到表现.装备质量的表现是使用方对装备质量的最终要求.可以考虑采用全面质量管理的方法,结合部队管理特点,进行使用质量管理.     

Selection of the optimal setup policy

A model is developed taking into consideration all the costs (namely cost of sampling, cost of not detecting a change in the process, cost of a false indication of change, and the cost of readjusting detected changes) incurred when a production process, using an unscheduled setup policy, utilizes fraction-defective control charts to control current production. The model is based on the concept of the expected time between detection of changes calling for setups. It is shown that the combination of unscheduled setups and control charts can be utilized in an optimal way if those combinations of sample size, sampling interval, and extent of control limits from process average are used that provide the minimum expected total cost per unit of time. The costs of a production process that uses unscheduled setups in conjunction with the appropriate optimal control charts are compared to the costs of a production process that uses scheduled setups at optimum intervals in conjunction with its appropriate control charts. This comparison indicates the criteria for selecting production processes with scheduled setups using optimal setup intervals over unscheduled setups. Suggestions are made to evaluate the optimal process setup strategy and the accompanying optimal decision parameters, for any specific cost data, by use of computer enumeration. A numerical example for assumed cost and process data is provided.     

A single-machine replacement model with learning

The replacement or upgrade of productive resources over time is an important decision for a manufacturing organization. The type of technology used in the productive resources determines how effectively the manufacturing operations can support the product and marketing strategy of the organization. Increasing operating costs (cost of maintenance, labor, and depreciation) over time force manufacturing organizations to periodically consider replacement or upgrade of their existing productive resources. We assume that there is a setup cost associated with the replacement of a machine, and that the setup cost is a nonincreasing function of the number of replacements made so far due to learning in setups. The operating cost of a newer machine is assumed to be lower than the operating cost of an older machine in any given period, except perhaps in the first period of operation of the new machine when the cost could be unusually high due to higher initial depreciation. A forward dynamic programming algorithm is developed which can be used to solve finite-horizon problems. We develop procedures to find decision and forecast horizons such that choices made during the decision horizon based only on information over the forecast horizon are also optimal for any longer horizon problem. Thus, we are able to obtain optimal results for what is effectively an infinite-horizon problem while only requiring data over a finite period of time. We present a numerical example to illustrate the decision/forecast horizon procedure, as well as a study of the effects of considering learning in making a series of machine replacement decisions. © 1993 John Wiley & Sons. Inc.     

Fluctuations of the optimal advertising and inventory policy: A qualitative analysis

This paper discusses the properties of the inventory and advertising policy minimizing the expected discounted cost over a finite horizon in a dynamic nonstationary inventory model with random demand which is influenced by the level of promotion or goodwill. Attention is focused on the relation between the fluctuations over time of the optimal policies and the variations over time of the factors involved, i.e., demand distributions and various costs. The optimal policies are proved to be monotone in the various factors. Also, three types of fluctuations over time of the optimal policies are discussed according to which factor varies over time. For example, if over a finite interval, the random demand increases (stochastically) from one period to the next, reaches a maximum and then decreases, then the optimal inventory level will do the same. Also the period of maximum of demand never precedes that of maximum inventory. The optimal advertising behaves in the opposite way and its minimum will occur at the same time as the maximum of the inventory. The model has a linear inventory ordering cost and instantaneous delivery of stocks; many results, however, are extended to models with a convex ordering cost or a delivery time lag.     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

效能指数的机载火控雷达研制费用估算模型

为提高机载电子设备研制、生产费用估算的精度,提高估算模型的应用范围和时间跨度,构建了基于效能指数的机载火控雷达研制费用估算模型。在分析机载电子设备研制费用建模特点的基础上,以军用飞机的机载火控雷达设备为研究对象,探讨了其效能指数的构建方法,建立了基于效能指数的研制费用参数模型,并进行实例分析。结果表明,由于效能指数考虑了众多费用驱动因素,该模型形式简明直观,相对误差较小,为研究机载电子设备的费用估算进行了有益的探索。     

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

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

复杂系统复合维修间隔期优化模型

采用组合策略对复杂系统辅以功能检测的定期更换维修工作进行综合优化.在分析复杂系统维修费用结构和组成的基础上,建立了其无限使用期条件下单位时间期望费用的数学模型,从而获得系统最佳的功能检测间隔期、定期更换周期内的检测次数和最优总费用.最后通过一个算例验证了该策略和模型的有效性.     

An (s,q) inventory model with stochastic and interrelated lead times

In this article we introduce a lead time mechanism that allows simultaneous order arrivals. This mechanism ensures that orders never cross each other. For the continuous review (s, q) inventory system with constant demand, we show that the allowance of batch arrivals gives rise to a discontinuous cost function. By exploiting the special structure of this cost function, a search algorithm is derived that yields the optimal order strategy in a reasonable amount of time. The search is restricted to integer order strategies only. We also consider an approximate method of solution that is based on a related model with a continuous cost function. The results obtained by this approximation are, in general, very satisfactory. © 1995 John Wiley & Sons, Inc.     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

An optimum group maintenance policy

In this article we present an optimum maintenance policy for a group of machines subject to stochastic failures where the repair cost and production loss due to the breakdown of machines are minimized. A nomograph was developed for machines with exponential failure time distributions. The optimal schedule time for repair as well as the total repair cost per cycle can be obtained easily from the nomograph. Conditions for the existence of a unique solution for the optimum schedule and the bounds for the schedule are discussed.     

战时交通运输路径优化研究

以战时交通运输路径优化问题为研究对象,分析问题特点,考虑多式联运,以运输时间代价、运输费用代价、路段和运输节点的危险性代价为优化目标,建立起广义运输代价最小的运输路径优化模型,并设计了蚁群算法来求解问题模型。给出的算例表明,文中模型符合战时交通运输的特点和实际需要,可为确定战时运输路径提供决策支持,而采用的蚁群算法是求解该问题的一种有效方法。     

Distributions of manufacturer's and user's replacement costs under warranty

We derive and compute time-dependent distributions of replacement costs under warranty over the product life cycle, both for the manufacturer and the user, under conditional pro-rata and nonrenewing free-replacement warranty policies. For pro-rata warranties, the analysis is based on the joint distribution of the number of replacements and the user's cost over time. For free-replacement warranties, distribution of the user's cost follows from the observation that replacement points outside warranty periods form a renewal process. This property is also exploited to determine the distribution of the manufacturer's cost. We apply our findings to measure the impact of product conformance quality on warranty cost distributions and find that manufacturer's cost measures are more sensitive to changes in quality than user's cost measures. © 1995 John Wiley & Sons, Inc.     

Scheduling customer arrivals to a stochastic service system

An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999