One way of achieving the increased levels of system reliability and availability demanded by critical computer-based control systems is through the use of fault-tolerant distributed computer systems. This article addresses the problem of allocating a set of m tasks among a set of n processors in a manner that will satisfy various task assignment, system capacity, and task scheduling constraints while balancing the workload across processors. We discuss problem background, problem formulation, and a known heuristic procedure for the problem. A new solution-improving heuristic procedure is introduced, and computational experience with the heuristics is presented. With only a modest increase in the amount of computational effort, the new procedure is demonstrated to improve dramatically solution quality as well as obtain near-optimal solutions to the test problems. 相似文献
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. 相似文献
This article discusses the impact of Complex Humanitarian Emergencies on the delivery of humanitarian aids. Complex emergencies were the results of long-term political and social disputes. Its impact brings about public health crises like epidemics, malnutrition, and even widespread desperation. In fact, there are four aspects of these crises which complicate public health programs: 1) emergencies are long and recurring; 2) access to the most vulnerable population is often restricted; 3) restructuring health systems in complex emergencies can be futile; and 4) complex emergencies often result in mass forced migration. What makes matters worse is the breakdown of health networks which collapse early in complex emergencies, leading to extensive losses of human health resources. Not only that, health facilities and transportation, infrastructure are often decimated in complex emergencies, and regional hospitals, district health posts, laboratories, and primary care outposts are similarly abandoned or destroyed. Moreover, because it is difficult to predict the course of these emergencies, ascertaining the optimal time to intervene and to invest in materials and facilities that could be lost to renewed fighting can be impossible. To solve this problem requires a coordinated effort. It should also focus on resources, early warning systems, preparedness measures, ongoing career training of relief workers, and prepositioning of relief supplies. 相似文献
For multiresponse simulations requiring point and confidence-region estimators of the mean response, we propose control-variate selection criteria that minimize mean-square confidence-region volume in two situations: (a) Only the mean control vector is known, and standard linear control-variate estimation procedures are used. (b) Covariances among controls are also known and are incorporated into new linear control-variate estimation procedures. An example illustrates the performance of these selection criteria. 相似文献
In this article an algorithm for computing upper and lower ? approximations of a (implicitly or explicitly) given convex function h defined on an interval of length T is developed. The approximations can be obtained under weak assumptions on h (in particular, no differentiability), and the error decreases quadratically with the number of iterations. To reach an absolute accuracy of ? the number of iterations is bounded by
We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models. 相似文献