Reliability analysis for the consecutive-k-out-of-n: F system with repairmen taking multiple vacations

Commonly studied models of the consecutive-k-out-of-n: F repairable systems in the existing literatures were considering the systems which had one repairman without vacation or infinite repairmen without vacations. In addition to those models, multiple repairmen without vacations are studied occasionally. However, technical personnel are very short in some fields. Some failed components cannot be repaired in time. This paper deals with the phenomenon of waiting for repair by supposing R repairmen with multiple vacations in the system. Using the pairs (i, |j|), the factor that the R repairmen taking multiple vacations was embedded into the classical C(k, n: F) system. Reliability indexes are presented. Finally, the Runge–Kutta method was used to a special case, and the experimental results demonstrate the necessity and validity of the new model.     

Implementation of goal programmingin long-range resource planning in university management

This paper presents a resource allocation model via Goal Programming (GP) in a long-range planning horizon in university management. In the proposed model, the introduction of new courses in the academic units and the allocation of available budget within the academic units as well as the forecast of the budget which is actually needed for better academic performance are taken into consideration. An illustrative example is presented to expound the model     

A method of developing regional road traffic noise management strategies

Road traffic noise management strategies or noise action plans are a necessary tool for pro-active road traffic noise management. A method is proposed for regional scale noise action plans, in part using noise mapping, which is flexible towards various data qualities. A six step method is proposed which links GIS data to road traffic noise calculation methods with the final strategies being presented in GIS format. A ‘Parcel Priority Index’ and a ‘Link Priority Index’ are presented as key variables in the production of regional strategies and planning visions on a road link basis. The noise management strategy method presented is used on a large regional area in South East Queensland, Australia which covers seven local government areas. The results presented indicate the method is successful in prioritising road links equitably for detailed road traffic noise management actions.     

高负荷下非强占优先排队网络系统中队长过程的扩散逼近

本文是在高负荷下非强占优先排除网络系统中给出了队长过程的扩散逼近 .证明了其队长过程的扩散极限是半鞅反射的布朗运动 .     

Flow time distributions in aK classM/G/1 priority feedback queue

In this paper, aK classM/G/1 queueing system with feedback is examined. Each arrival requires at least one, and possibly up toK service phases. A customer is said to be in classk if it is waiting for or receiving itskth phase of service. When a customer finishes its phasek ≤K service, it either leaves the system with probabilityp _k, or it instantaneously reenters the system as a classk + 1 customer with probability (1 −p _k). It is assumed thatp _k = 1. Service is non-preemptive and FCFS within a specified priority ordering of the customer classes. Level crossing analysis of queues and delay cycle results are used to derive the Laplace-Stieltjes Transform (LST) for the PDF of the sojourn time in classes 1,…,k;k ≤K.     

GMPLS网络中基于优先级的M : N保护

给出了一个GMPLS网络中关于广义标签交换通道(G.LSPs)的具有严格优先级M : N保护的排队模型,并通过仿真验证了本模型的正确性.该模型可用于基于优先级的M : N保护设计,通过适当选择保护通道数,可以确保一定的可靠性要求,同时避免过度配置而造成资源浪费.     

Workload in queues having priorities assigned according to service time

System designers often implement priority queueing disciplines in order to improve overall system performance; however, improvement is often gained at the expense of lower priority cystomers. Shortest Processing Time is an example of a priority discipline wherein lower priority customers may suffer very long waiting times when compared to their waiting times under a democratic service discipline. In what follows, we shall investigate a queueing system where customers are divided into a finitie number of priority classes according to their service times.We develop the multivariate generating function characterizing the joint workload among the priority classes. First moments obtained from the generating function yield traffic intensities for each priority class. Second moments address expected workloads, in particular, we obtain simple Pollaczek-Khinchine type formulae for the classes. Higher moments address variance and covariance among the workloads of the priority classes.This work was supported in part by National Science Foundation Grant DDM-8913658.     

Direct LC analysis of selected priority pollutants in water at ppb levels

Thirty-two priority pollutants can be analyzed in water with detection limits of 10 ppb by direct liquid chromatography. High sensitivity is obtained by use of an ultra-violet detector at 202 nm and a reverse phase C₁₈ column with a water-acetonitrile gradient that is compatible with two milliliter water samples.     

Determination of phenols by HPLC down to PPT levels

Summary A mixture of eleven priority pollutant phenols (PPP) have been separated using a Dionex 4000 chromatograph; VAL-U-PAK ODS (250 × 4.6 mm I.D.) column; eluents A: CH₃CN/0.2M NaH₂PO₄/CH₃COOH 40/60/1 and B: CH₃CN with/without gradient; detectors: UV-254 nm and Pulse Amperometric Detector (PAD) with glassycarbon electrode (+1.20V). With preconcentration unit (guard RP-18 column) on line and PAD, detectability limit at ten ppt was achieved. The method has been applied for determination of PPP in tap-water and in leachates from sanitary and industrial landfill sites.     

A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems

The problem of scheduling n jobs with known process times on m identical parallel machines with an objective of minimizing weighted flow time is NP-hard. However, when job weights are identical, it is well known that the problem is easily solved using the shortest processing time rule. In this paper, we show that a generalization of the shortest processing time rule minimizes weighted flow time in a class of problems where job weights are not identical.