A Generalized Block Replacement Policy with Minimal Repair and General Random Repair Costs for a Multi-unit System

A generalization of the block replacement policy (BRP) is proposed and analysed for a multi-unit system which has the specific multivariate distribution. Under such a policy an operating system is preventively replaced at times kT (k = 1, 2, 3,...), as in the ordinary BRP, and the replacement of the failed system at failure is not mandatory; instead, a minimal repair to the component of the system can be made. The choice of these two possible actions is based on some random mechanism which is age-dependent. The cost of the ith minimal repair of the component at age y depends on the random part C(y) and the deterministic part C_i(y). The aim of the paper is to find the optimal block interval T which minimizes the long-run expected cost per unit time of the policy.     

Refining Cosmetatos' Approximation for the Mean Waiting Time in the M/D/s Queue

This paper deals with refining Cosmetatos's approximation for the mean waiting time in an M/D/s queue. Although his approximation performs quite well in heavy traffic, it overestimates the true value when the number of servers is large or the traffic is light. We first focus on a normalized quantity that is a ratio of the mean waiting times for the M/D/s and M/M/s queues. Using some asymptotic properties of the quantity, we modify Cosmetatos's approximation to obtain better accuracy both for large s and in light traffic. To see the quality of our approximation, we compare it with the exact value and some previous approximations. Extensive numerical tests indicate that the relative percentage error is less than 1% for almost all cases with s ≤ 20 and at most 5% for other cases.     

Approximating the Mean Waiting Time in the <Emphasis Type="Italic">GI/G/s</Emphasis> Queue

We provide two distribution-dependent approximations for the mean waiting time in a GI/G/s queue. Both approximations are weighted combinations of the exact mean waiting times for the GI/M/s and M/D/s queues each of which has the same mean service time and traffic intensity as in the approximating GI/G/s queue. The weights in the approximations are expressed by the service-time c.d.f. and the first two moments of interarrival and service times. To examine the performance of our approximations, they are numerically compared with exact solutions and previous two-moment approximations for various cases. Extensive numerical comparisons indicate that the relative percentage errors of the approximations are of the order of 5% in moderate traffic and 1% in heavy traffic, except for extreme cases.     

Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers

The time-consuming process of solving large-scale Mixed Integer Programming problems using the branch-and-bound technique can be speeded up by introducing a degree of parallelism into the basic algorithm. This paper describes the development and implementation of a parallel branch-and-bound algorithm created by adapting a commercial MIP solver. Inherent in the design of this software are certain ad hoc methods, the use of which are necessary in the effective solution of real problems. The extent to which these ad hoc methods can successfully be transferred to a parallel environment, in this case an array of at most nine transputers, is discussed. Computational results on a variety of real integer programming problems are reported.     

SDS/苯甲醇/H2O体系的相行为与结构

SDS／苯甲醇／H2O体系能生成胶束、微乳液、层状液晶、六角状液晶等分子有序组合作，它们之间转换关系可以从凝聚能理论得到解释．来甲酸在O／W微乳液中的分配系数K＝168，表明绝大多数苯甲醇被增溶于SDS胶束相内．随重量比本甲醇／SDS增加，层状液晶中的do值几乎不变，溶剂渗透率略有增加，六角状液晶中圆柱缔合体的半径r值几乎不变，溶剂渗透率增加．     

Univariate Stochastic Programming with Random Decision Variable

The problem of minimising E(X) subject to the constraints X ? 0, P(X ? b) ? a(0 < a < 1) has been considered, where b is a non-negative random variable with continuous probability distribution. A necessary and sufficient condition for randomised decisions to be superior to the non-randomised one has been derived.