On optimal operating conditions for a data processing system: A stochastic approach

In this paper, we consider the problem of determining optimal operating conditions for a data processing system. The system is burned‐in for a fixed burn‐in time before it is put into field operation and, in field operation, it has a work size and follows an age‐replacement policy. Assuming that the underlying lifetime distribution of the system has a bathtub‐shaped failure rate function, the properties of optimal burn‐in time, optimal work size and optimal age‐replacement policy will be derived. It can be seen that this model is a generalization of those considered in the previous works, and it yields a better optimal operating conditions. This paper presents an analytical method for three‐dimensional optimization problem. An algorithm for determining optimal operating conditions is also given. Copyright © 2007 John Wiley & Sons, Ltd.     

Optimal maintenance of a production-inventory system with idle periods

In this paper we consider a production-inventory system in which an input generating installation supplies a buffer with a raw material and a production unit pulls the raw material from the buffer with constant rate. The installation deteriorates in time and the problem of its optimal preventive maintenance is considered. It is assumed that the installation after the completion of its maintenance remains idle until the buffer is evacuated. Under a suitable cost structure it is shown that the average-cost optimal policy for fixed buffer content is of control-limit type, i.e. it prescribes a preventive maintenance of the installation if and only if its degree of deterioration is greater than or equal to a critical level. Using the usual regenerative argument, the average cost of a control-limit policy is computed exactly and then, the optimal control-limit policy is determined. Furthermore, the stationary probabilities of the system under the optimal policy are computed.     

带环境污染的与年龄相关的非线性种群动力系统的最优控制

研究带环境污染的与年龄相关的非线性种群动力系统的最优控制问题,利用不动点定理得出系统非负解的存在性和唯一性,利用极大化序列及紧性证明最优控制的存在性,利用法锥方法得到控制问题的最优条件.     

An inventory model for slow moving items subject to obsolescence

In this paper, we consider a continuous review inventory system of a slow moving item for which the demand rate drops to a lower level at a known future time instance. The inventory system is controlled according to a one-for-one replenishment policy with a fixed lead time. Adapting to lower demand is achieved by changing the control policy in advance and letting the demand take away the excess stocks. We show that the timing of the control policy change primarily determines the tradeoff between backordering penalties and obsolescence costs. We propose an approximate solution for the optimal time to shift to the new control policy minimizing the expected total cost during the transient period. We find that the advance policy change results in significant cost savings and the approximation yields near optimal expected total costs.     

Optimal control for parallel queues with a single batch server

We consider a queueing system with multiple Poisson arrival queues and a single batch server that has infinite capacity and a fixed service time. The problem is to allocate the server at each moment to minimize the long-run average waiting cost. We propose a Cost-Arrival Weighted (CAW) policy for this problem based on the structure of the optimal policy of a corresponding fluid model. We show that this simple policy enjoys a superior performance by numerical experiments.     

An Optimal Batch Size for a Production System Operating Under a Fixed-Quantity,Periodic Delivery Policy

A manufacturing system which procures raw materials from suppliers and processes them to convert to finished products is considered here. This paper develops an ordering policy for raw materials to meet the requirements of a production facility which, in turn, must deliver finished products demanded by outside buyers at fixed interval points in time. First, a general cost model is developed considering both supplier (of raw material) and buyer (of finished products) sides. This model is used to determine an optimal ordering policy for procurement of raw materials, and the manufacturing batch size to minimize the total cost for meeting equal shipments of the finished products, at fixed intervals, to the buyers. The total cost is found to be a piece-wise convex cost function. An interval that contains the optimal solution is first determined followed by an optimization technique to identify the exact solution from this interval.     

Optimal admission policies for a finite queue with bursty arrivals

We consider a service system with a single server, a finite waiting room and two classes of customers with deterministic service time. Primary jobs arrive at random and are admitted whenever there is room in the system. At the beginning of each period, secondary jobs can be admitted from an infinite pool. A revenue is earned upon admission of each job, with the primary jobs bringing a higher contribution than the secondary jobs, the objective being to maximize the total discounted revenue over an infinite horizon. We model the system as a discrete time Markov decision process and show that a monotone admission policy is optimal when the number of primary arrivals has a fixed distribution. Moreover, when the primary arrival distribution varies with time according to a finite state Markov chain, we show that the optimal policy is conditionally monotone and that the numerical computation of an optimal policy, in this case, is substantially more difficult than in the case of stationary arrivals.This research was supported in part by the National Science Foundation, under grant ECS-8803061, while the author was at the University of Arizona.     

Optimal preventive maintenance of a production system with an intermediate buffer

In this paper we consider a model consisting of a deteriorating installation that transfers a raw material to a production unit and a buffer which has been built between the installation and the production unit. The deterioration process of the installation is considered to be nonstationary, i.e. the transition probabilities may depend not only on the working conditions of the installation but on its age as well. The problem of the optimal preventive maintenance of the installation is considered. Under a suitable cost structure it is shown that, for fixed age of the installation and fixed buffer level, the optimal policy is of control-limit type. When the deterioration process is stationary, an efficient Markov decision algorithm operating on the class of control-limit policies is developed. There is strong numerical evidence that the algorithm converges to the optimal policy. Two generalizations of this model are also discussed.     

考虑顾客退货和固定成本的联合补货与定价策略

为了吸引更多顾客,许多电子商务零售商允许顾客在一定时间内退货,导致其利润明显减少。同时,在补货时不仅产生依赖补货量的变动成本,而且会产生与补货量无关的固定成本。基于此,以最大化电子商务零售商的利润为目标,建立考虑顾客退货和固定成本的联合补货与定价模型,其中顾客的退货量与满足的需求呈正比。在一般需求情形下,部分刻画多期问题的最优策略;在特殊需求情形下,证明(s,S,p)策略对单期问题最优,并对多期问题的最优策略进行严格刻画。根据已有刻画为多期问题构造启发式策略。数值结果表明启发式策略近似最优;当初始库存水平足够高/低时,最优补货水平和定价随退货率与固定成本单调变化。关键词:联合补货与定价模型;顾客退货;固定成本;随机动态规划;最优策略     

Optimal control for an age-dependent predator-prey system in a polluted environment

In this paper, we investigate an optimal control problem for an age-dependent predator-prey hybrid system in a polluted environment. Namely, we establish a new toxicant-population model with age-dependence in an environment with small toxicant capacity. By using a fixed point theorem, we obtain the existence and uniqueness of nonnegative solution of the toxicant-population model with age-dependence. We employ tangent-normal cone techniques in nonlinear functional analysis to deduct the optimality conditions for the control problem. The existence of optimal control policy is carefully verified by means of Ekeland’s variational principle.     

Optimization of a Multiperiod Resource Allocation Model

In this paper we examine multiperiod resource allocation problems, such as allocating a given marketing budget among T periods. The return functions of each period are assumed to be concave functions of the effective effort variable, which is composed of the expenditures in all previous periods and the present one. Assuming that the effect of an amount spent in period t is decreasing by a fixed rate in successive periods, necessary and sufficient conditions for a non-boundary optimal policy are derived. Under these conditions the optimal policy which maximizes total returns is obtained.     

带非局部低阶项非线性抛物型方程的时间最优控制

考虑一个带非局部低阶项非线性抛物型方程的时间最优控制问题．首先利用Schauder不动点定理证明了系统的适定性，然后利用Carleman不等式和Kakutani不动点定理证明了容许控制和最优控制的存在性，并且建立了时间最优控制的最大值原理．     

Public and private optimization at a service facility with approximate information on congestion

An M/GI/1 queueing model is considered, where the arrival rate to the facility is a continuous variable which depends, in the steady state, upon the average congestion at the facility. The population of customers arriving to the facility is partitioned into several classes dependent on the ratio of the value of time to the reward due to service but are served according to first-in-first-out rule. It is shown that under the privately optimal behavior of the individuals the facility will be dominated by the class with the highest net reward per value of time. The publicly optimal policy which maximizes the net reward due to service, after costs of waiting are deducted, is shown either to admit only a single class of customers to the facility, thus discriminating against the other classes or to be indifferent to the mix of classes. The class chosen for admission may not be the class which would have privately dominated the facility. When the expected delay experienced at the facility is fixed, a policy of tolls and rebates for the customers is obtained that will assure equal access to the facility for all customers irrespective of their classes. It is shown that the publicly optimal policy, under the condition of fixed aggregate arrival rate to the facility, is shown to be deversified.The optimal arrival rates desired by a single class are derived for two cases. When the proportions of arrivals from the classes are fixed, the aggregate arrival rate desired by a class is shown to be not greater than the equilibrium rate for the individuals from that class. Alternatively, when the aggregate arrival rate is fixed, conditions are obtained under which a class will prefer usage of the facility by several classes to its own domination.     

Optimal Consumption Portfolio and No-Arbitrage with Nonproportional Transaction Costs

In this paper we consider a finite-state financial market with non-proportional transaction cost and bid-ask spreads. The transaction cost consists of two parts: a fixed cost and a proportional cost to the size of transaction. We show that the existence of an optimal consumption policy implies that the market has no strong arbitrage; the opposite, however, is not true, i.e., no strong arbitrage does not imply the existence of an optimal consumption policy. This is in sharp contrast with the case of proportional transaction cost and other cases reported in the literature, where no strong arbitrage is equivalent to the existence of an optimal consumption policy. We also study the relationship between weak arbitrage and strong arbitrage. Different from the market with proportional transaction cost, we find that these two forms of arbitrage are equivalent unless the fixed cost is zero. A necessary and sufficient condition for the existence of an optimal consumption policy is also obtained. Supported by CAS, NSFC, RGC of Hong Kong and NSF under Grant No. DMI-0196084 and DMI-0200306.     

Optimal control of a single server in a finite-population queueing network

We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions under which the optimal policy is an index policy. This index policy assigns the server to the non-empty station where it takes the shortest amount of time (in some stochastic sense) to complete a job. For example, in a network of multiple parallel stations, the optimal policy assigns the highest priority to the fastest station if service times can be ordered in likelihood ratios. Finally, by means of a numerical study, we test the shortest-expected-remaining-service-time policy on parallel-series networks with three stations and find that this index policy either coincides with the optimal policy or provides a near-optimal performance.     

Inventory control with fixed cost and price optimization in continuous time

We continue to study the problem of inventory control, with simultaneous pricing optimization in continuous time. In our previous paper [8], we considered the case without set up cost, and established the optimality of the base stock-list price (BSLP) policy. In this paper we consider the situation of fixed price. We prove that the discrete time optimal strategy (see [11]), i.e., the (s, S, p) policy can be extended to the continuous time case using the framework of quasi-variational inequalities (QVIs) involving the value function. In the process we show that an associated second order, nonlinear two-point boundary value problem for the value function has a unique solution yielding the triplet (s, S, p). For application purposes the explicit knowledge of this solution is needed to specify the optimal inventory and pricing strategy. Se- lecting a particular demand function we are able to formulate and implement a numerical algorithm to obtain good approximations for the optimal strategy.     

Optimal replacement policy for a deteriorating system with increasing repair times

This paper considers an optimal maintenance policy for a practical and reparable deteriorating system subject to random shocks. Modeling the repair time by a geometric process and the failure mechanism by a generalized δ-shock process, we develop an explicit expression of the long-term average cost per time unit for the system under a threshold-type replacement policy. Based on this average cost function, we propose a finite search algorithm to locate the optimal replacement policy N^∗ to minimize the average cost rate. We further prove that the optimal policy N^∗ is unique and present some numerical examples. Many practical systems fit the model developed in this paper.     

A periodic-review inventory control policy for a two-level supply chain with multiple retailers and stochastic demand

We consider a time-based inventory control policy for a two-level supply chain with one warehouse and multiple retailers in this paper. Let the warehouse order in a fixed base replenishment interval. The retailers are required to order in intervals that are integer-ratio multiples of the base replenishment interval at the warehouse. The warehouse and the retailers each adopt an order-up-to policy, i.e. order the needed stock at a review point to raise the inventory position to a fixed order-up-to level. It is assumed that the retailers face independent Poisson demand processes and no transshipments between them are allowed. The contribution of the study is threefold. First, we assume that when facing a shortage the warehouse allocates the remaining stock to the retailers optimally to minimize system cost in the last minute before delivery and provide an approach to evaluate the exact system cost. Second, we characterize the structural properties and develop an exact optimal solution for the inventory control system. Finally, we demonstrate that the last minute optimal warehouse stock allocation rule we adopt dominates the virtual allocation rule in which warehouse stock is allocated to meet retailer demand on a first-come first-served basis with significant cost benefits. Moreover, the proposed time-based inventory control policy can perform equally well or better than the commonly used stock-based batch-ordering policy for distribution systems with multiple retailers.     

Continuous-review,lost-sales inventory models with Poisson demand,a fixed lead time and no fixed order cost

This paper considers continuous-review lost-sales inventory models with no fixed order cost and a Poisson demand process. There is a holding cost per unit per unit time and a lost sales cost per unit. The objective is to minimise the long run total cost. Base stock policies are, in general, sub-optimal under lost sales. The optimal policy would have to take full account of the remaining lead times on all the orders currently outstanding and such a policy would be too complex to analyse, let alone implement. This paper considers policies which make use of the observation that, for lost sales models, base stock policies can be improved by imposing a delay between the placement of successive orders. The performance of these policies is compared with that of the corresponding base stock policy and also with the policy of ordering at fixed and regular intervals of time.     

Optimal control of a big financial company with debt liability under bankrupt probability constraints

This paper considers an optimal control of a big financial company with debt liability under bankrupt probability constraints. The company, which faces constant liability payments and has choices to choose various production/business policies from an available set of control policies with different expected profits and risks, controls the business policy and dividend payout process to maximize the expected present value of the dividends until the time of bankruptcy. However, if the dividend payout barrier is too low to be acceptable, it may result in the company’s bankruptcy soon. In order to protect the shareholders’ profits, the managements of the company impose a reasonable and normal constraint on their dividend strategy, that is, the bankrupt probability associated with the optimal dividend payout barrier should be smaller than a given risk level within a fixed time horizon. This paper aims at working out the optimal control policy as well as optimal return function for the company under bankrupt probability constraint by stochastic analysis, partial differential equation and variational inequality approach. Moreover, we establish a riskbased capital standard to ensure the capital requirement can cover the total given risk by numerical analysis, and give reasonable economic interpretation for the results.