Qmp/USP: A modern alternative to MIL-STD-105D

The Quality Measurement Plan (QMP) and the Universal Sampling Plan (USP) are the data analysis and sampling plans for the AT&T Technologies quality audit. This article describes QMP/USP, an acceptance sampling plan based on QMP and USP principles. QMPIUSP is a complete acceptance sampling system. It combines the elements of classical rectification inspection plans with those of MIL-STD-IOSD. There is no switching between plans, no tables of numbers to look through, and no discontinue state. QMP/USP is a computerized, self-contained system that features:

• Acceptance decisions based on the QMP Bayes empirical Bayes analysis of current and past sampling result
• Sample size selection based on USP, i.e., lot size, AQL, a cost ratio, the QMP analysis, and a budget constraint
• Guaranteed AOQ
• A complete statistical analysis of the quality process.

In this article, we describe the operation of QMP/USP and compare its performance with that of MIL-STD-IOSD. The comparison is made under many different quality environments with many metrics. Our results show that QMP/USP and MIL/STD/IOSD perform similarly for the environments where quality could be described as “in control”; and that QMPlUSP is superior in the environments where quality is “out of control”.     

Optimal set partitioning,matchings and lagrangian duality

We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones.     

Explicit steady state solutions for a particular M(x)/M/1 queueing system

An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given.     

Simulation of stochastic activity networks using path control variates

This article details several procedures for using path control variates to improve the accuracy of simulation-based point and confidence-interval estimators of the mean completion time of a stochastic activity network (SAN). Because each path control variate is the duration of the corresponding directed path in the network from the source to the sink, the vector of selected path controls has both a known mean and a known covariance matrix. This information is incorporated into estimation procedures for both normal and nonnormal responses. To evaluate the performance of these procedures experimentally, we examine the bias, variance, and mean square error of the controlled point estimators as well as the average half-length and coverage probability of the corresponding confidence-interval estimators for a set of SANs in which the following characteristics are systematically varied: (a) the size of the network (number of nodes and arcs); (b) the topology of the network; (c) the percentage of activities with exponentially distributed durations; and (d) the relative dominance of the critical path. The experimental results show that although large improvements in accuracy can be achieved with some of these procedures, the confidence-interval estimators for normal responses may suffer serious loss of coverage probability in some applications.     

The fateful phoenix: the revival of Al-Qa’ida in Iraq

Although the Islamic State in Iraq and al-Sham (ISIS) is seen as a novel manifestation of Islamic extremism, it is in fact the latest, albeit perhaps the most effective, of a long line of revivalist movements in the Islamic and the Arab worlds. Its motivations – hisba and jihad – differ little from its predecessors and its ambitions – to create a state organised in accordance with the precepts of the Islamic caliphate – reflect a long-standing Islamic ambition. It differs, of course, in terms of the sophistication of its political and military strategies, which mirror the contemporary complexities of the world in which it operates, but its objectives recall long-standing Islamic ideals, even if articulated in radically brutal and extremist ways. More importantly, perhaps, ISIS or Da’ish, to give it its Arabic sobriquet, reflects the enormous degree of resentment inside the Middle East at the ways in which Western powers have intervened in regional affairs over recent years, particularly their support for regimes and economic systems there that have betrayed, in the popular imaginary, the essential principles of social justice that lie at the root of Islamic vision of ideal social order. Indeed, in many respects, its analysis of the world in which it operates and of the objectives it seeks differ little in essence from those any other resistance and rejectionist movement, whether religious or sectarian. More specifically, it has been the sectarian conflict that resulted from the reversal of political order in Iraq as a result of the 2003 American-led invasion that has driven the success of the movement in capturing widespread Sunni support. Whether it can manage the complexities of the administration of a state remains open to question.     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

An experimental comparison of solution algorithms for the single-machine tardiness problem

A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study.     

A Bayesian approach to demand estimation and inventory provisioning

This article addresses the problem of explicitly taking into account uncertainty about the demand for spare parts in making inventory procurement and stockage decisions. The model described provides for a unified treatment of the closely related problems of statistical estimation of demand and resource allocation within the inventory system, and leads to an easily implemented, efficient method of determining requirements for spare parts both in the early provisioning phase and in later periods of operations when demand data have accumulated Analyses of the model's theoretical foundations and of sample outcomes of the model based upon data on parts intended for use in the F-14 lead to conclusions of great importance to both support planners and operations planners Finally, of particular significance is the ability afforded the planner by this model to quantify the impact on inventory system costs of varying levels of system reliability or management uncertainty as to projected system performance. This will provide an economic basis for analysis of such alternatives as early deployment, operational testing, and equipment redesign.