Some properties of optimal control policies for entry to an M/M/1 queue

Customers served by an M/M/1 queueing system each receive a reward R but pay a holding cost of C per unit time (including service time) spent in the system. The decision of whether or not a customer joins the queue can be made on an individual basis or a social basis. The effect of increasing the arrival rate on the optimal policy parameters is examined. Some limiting results are also derived.     

The complementary use of regression diagnostics and robust estimators

Regression modeling for prediction or forecasting purposes is critically dependent on the quality of the data which are used to estimate the model parameters. Extreme response or predictor-variable values can substantially influence least-squares estimates and disproportionately affect predictions. Robust alternatives to least-squares are less sensitive to extreme observations and can provide more precise predictions. In this article diagnostic displays are used to identify extreme observations and to assess the sensitivity of least-squares parameter estimates and predictions to the inclusion of these observations in a data set. The displays are shown to aid in the interpretation of weights which robust estimators assign to influential observations.     

Partial orderings of life distributions with respect to their aging properties

New partial orderings of life distributions are given. The concepts of decreasing mean residual life, new better than used in expectation, harmonic new better than used in expectation, new better than used in failure rate, and new better than used in failure rate average are generalized, so as to compare the aging properties of two arbitrary life distributions.     

Scheduling economic lot sizes in deteriorating production systems

The paper considers the economic lot scheduling problem (ELSP) where production facility is assumed to deteriorate, owing to aging, with an increasing failure rate. The time to shift from an “in‐control” state to an “out‐of‐control” state is assumed to be normally distributed. The system is scheduled to be inspected at the end of each production lot. If the process is found to be in an “out‐of‐control” state, then corrective maintenance is performed to restore it to an “in‐control” state before the start of the next production run. Otherwise, preventive maintenance is carried out to enhance system reliability. The ELSP is formulated under the capacity constraint taking into account the quality related cost due to possible production of non‐conforming items, process inspection, and maintenance costs. In order to find a feasible production schedule, both the common cycle and time‐varying lot sizes approaches are utilized. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 650–661, 2003     

Technical note: Traffic intensity estimation

This note examines estimation of the traffic intensity in an M/G/1 queue. We show that the ratio of sample mean service times to the sample mean interarrival times has undesirable sampling properties. To remedy this, two alternative estimators are introduced. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

US–China military relations: competition and cooperation

ABSTRACT

China’s efforts to build a ‘new type of great power relations’ and a ‘new type of military-to-military relations’ do not constitute a major turning point in relations with the United States. Political relations set limits on military cooperation, and the two sides have been unable to construct a sustainable strategic basis for relations. This has contributed to an ‘on-again, off-again’ pattern in military ties. Trends show a pattern of frequent disruptions in military-to-military relations from 2000 to 2010, followed by an increase in interactions beginning in 2012. Nevertheless, obstacles on both sides are likely to limit mutual trust and constrain future development of military-to-military relations.     

Machine scheduling with an availability constraint and job delivery coordination

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007