Service design at diagnostic service centers

We study a service design problem in diagnostic service centers, call centers that provide medical advice to patients over the phone about what the appropriate course of action is, based on the caller's symptoms. Due to the tension between increased diagnostic accuracy and the increase in waiting times more in‐depth service requires, managers face a difficult decision in determining the optimal service depth to guide the diagnostic process. The specific problem we consider models the situation when the capacity (staffing level) at the center is fixed, and when the callers have both congestion‐ and noncongestion‐related costs relating to their call. We develop a queueing model incorporating these features and find that the optimal service depth can take one of two different structures, depending on factors such as the nurses' skill level and the maximum potential demand. Sensitivity analyses of the two optimal structures show that they are quite different. In some situations, it may (or may not) be optimal for the manager to try to expand the demand at the center, and increasing skill level may (or may not) increase congestion. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Weakest‐link attacker‐defender games with multiple attack technologies

In this article, we examine a model of terrorism that focuses on the tradeoffs facing a terrorist organization that has two qualitatively different attack modes at its disposal. The terrorist organization's objective is to successfully attack at least one target. Success for the target government is defined as defending all targets from any and all attacks. In this context, we examine how terrorist entities strategically utilize an efficient but discrete attack technology — e.g., suicide attacks — when a more conventional mode of attack is available, and the optimal anti‐terrorism measures.© 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

境外行政主体制度研究

行政主体理论自行政法成为公法重要组成部分时便成为行政法几个核心理论之一。自《中华人民共和国行政诉讼法》实施以来,行政主体理论研究成为我国行政法理论研究的重点之一。我国关于行政主体的内涵及外延,学术界各抒己见,至今缺乏统一的论断。境外一些行政法理论发达国家和地区的行政主体制度对于我们具有借鉴意义。     

Allocating capacity in parallel queues to improve their resilience to deliberate attack

We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

The Banzhaf value and communication situations

Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Critical interfaces in body armour systems

The ballistic performance, and behaviour, of an armour system is governed by two major sets of variables, geometrical and material. Of these, the consistency of performance, especially against small arms ammunition, will depend upon the consistency of the properties of the constituent materials. In a body armour system for example, fibre diameter, areal density of woven fabric, and bulk density of ceramic are examples of critical parameters and monitoring such parameters will form the backbone of associated quality control procedures. What is often overlooked, because it can fall into the User’s domain, are the interfaces that exist between the various products; the carrier, the Soft Armour Insert (SAI), and the one or two hard armour plates (HAP1 and HAP2). This is especially true if the various products are sourced from different suppliers.There are between 30 and 150 individual layers within a typical body armour system, and each of the interfaces between each of those layers will, in some way or another, contribute to the ballistic performance of the system. For example, consider the following interfaces/interlayers: (i) the frictional, sliding, inter-ply surfaces within a soft armour pack, and also between the pack and the carrier, (ii) the air-gaps that may develop within the soft armour pack, (iii) the interconnecting space between the soft armour pack and the hard armour plate, (iv) the nature of the interfaces between adjacent plies of a multiplied backing laminate, even in a highly compressed Ultra High Molecular Weight Polyethylene (UHMWPE) variant, (v) the interlayer between the ceramic and its substrate, within a HAP, and (vi) the geometrical fit between two hard armour plates within a stacked body armour system. This paper will provide a User-friendly overview of all such interfaces and provide unique guidance as to their criticality and influence.     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

Note: Facility location with closest rectangular distances

This paper considers the problem of locating one or more new facilities on a continuous plane, where the destinations or customers, and even the facilities, may be represented by areas and not points. The objective is to locate the facilities in order to minimize a sum of transportation costs. What is new in this study is that the relevant distances are the distances from the closest point in the facility to the closest point in the demand areas. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 77–84, 2000