Decentralized admission control of a queueing system: A game‐theoretic model

Consider a distributed system where many gatekeepers share a single server. Customers arrive at each gatekeeper according to independent Poisson processes with different rates. Upon arrival of a new customer, the gatekeeper has to decide whether to admit the customer by sending it to the server, or to block it. Blocking costs nothing. The gatekeeper receives a reward after a customer completes the service, and incurs a cost if an admitted customer finds a busy server and therefore has to leave the system. Assuming an exponential service distribution, we formulate the problem as an n‐person non‐zero‐sum game in which each gatekeeper is interested in maximizing its own long‐run average reward. The key result is that each gatekeeper's optimal policy is that of a threshold type regardless what other gatekeepers do. We then derive Nash equilibria and discuss interesting insights. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 702–718, 2003.     

The uncertainty sensitivity index method (USIM) and its extension

This article deals with optimization problems that have some uncertain parameters with unknown probabilities. The article proposes a strategy of transferring the system's uncertainty associated with these optimization problems into a norm or a set of norms that is added to the original objective function(s) within a multiobjective framework. The uncertainty sensitivity index method (USIM) proposed by Haimes and Hall [1977] is extended to several general cases. A robust algorithm is developed to guarantee an ideal solution for cases where the nominal value of the uncertain parameter is itself an uncertain variable. A design problem is also addressed to identify the best-compromise values of the system's parameters by integrating the USIM with the envelope approach.     

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998     

Minimizing weighted mean absolute deviation of flow times in single machine systems

We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W-shaped. For the unweighted case, we show that all optimal schedules are V-shaped. This characterization enables us to show that the problem is NP-hard. We then provide a pseudopolynomial algorithm for the unweighted problem. Finally, we consider three heuristic algorithms for the unweighted problem and report computational experience with these algorithms. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 297–311, 1998     

Bounds for circular error probabilities

Bounds for P(X + X ⩽ k²σ) are given where X₁ and X₂ are independent normal variables having zero means and variances σ, σ, respectively. This is generalized when X₁ and X₂ are dependent variables with known covariance matrix.     

Stock-rationing policy for a make-to-stock production system with two priority classes and backordering

This article considers the problem of production control and stock rationing in a make-to-stock production system with two priority customer classes and backordering. The problem is formulated as a queueing control model. With Poisson arrivals and exponential production times, we show that the optimal production control and stock-rationing policies can be characterized by a single, monotone switching curve. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 457–472, 1997     

An economic sequential screening procedure for limited failure populations

An economic sequential screening procedure is considered for limited failure populations in which defective items fail soon after they are put in operation and nondefective ones never fail during the technical life of the items. A cost model is constructed that involves screening test cost and external failure cost. A sequential scheme that minimizes the expected cost is derived from the solution of a dynamic programming formulation and the optimal decision at each stage is obtained in a closed form. © 1994 John Wiley & Sons, Inc.     

滑动导轨等部件的微动态特性

1.简介 这份报告给出了关于传统的滑动导轨系统的一些实验结果,同时论及了机构的精密运动控制。 这些年来,诸如导轨、丝杠和其他驱动机构等机械部件的微动态特性,换句话说,就是在很小位移范围内的非线性传递特性。已成为精密机械工程研究的首要问题。超精密仪器、机床和半导体生产系统都对机械部件的控制精度提出了越来越高的要求。对于精     

War reserve spares kits supplemented by normal operating assets

In peacetime, base stock levels of spares are determined on the assumption of normal resupply from the depot. In the event of war, however, a unit must be prepared to operate from stock on hand for a period of time without being resupplied from the depot. This paper describes a mathematical model for determining such war reserve spares (WRS) requirements. Specifically, the model solves the following kind of optimization problem: find the least-cost WRS kits that will keep the probability of a stockout after K cannibalizations less than or equal to some target objective α. The user of the model specifies the number of allowable cannibalizations, and the level of protection that the kit is supposed to provide. One interesting feature of this model is that in the probability computation it takes into account the possiblility of utilizing normal base operating assets. Results of a sensitivity analysis indicate that if peacetime levels were explicitly taken into account when designing a WRS kit, a cost saving of nearly 40 percent could be effected without degrading base supply performance in wartime.     

Damage to aircraft composite structures caused by directed energy system: A literature review

This paper presents a comprehensive review of the research studies on direct energy system effect on aircraft composite structures to develop a good understanding of state-of-the-art research and devel-opment in this area. The review begins with the application of composite materials in the aircraft structures and highlights their particular areas of application and limitations. An overview of directed energy system is given. Some of the commonly used systems in this category are discussed and the working principles of laser energy systems are described. The experimental and numerical studies re-ported regarding the aircraft composite structures subject to the effect of directed energy systems, especially the laser systems are reviewed in detail. In particularly, the general effects of laser systems and the relevant damage mechanisms against the composite structures are reported. The review draws attention to the recent research and findings in this field and is expected to guide engineers/researchers in future theoretical, numerical, and experimental studies.