In existing AS/RS research, storage assignment policies are evaluated based on the probability that item type j will be stored (and subsequently retrieved). This note applies the turnover-based and class-based assignment policies of Hausman et al. (1976) to a stochastic environment by...

We consider the problem of designing a multivehicle automated guided vehicle system (AGVS) to supplement an existing nonautomated material handling system. The AGVS consists of a pool of vehicles that deliver raw components from a central storage area to workcenters throughout the factor floor....

This paper analyzes the costs and benefits of screening women of childbearing age for HIV. The analysis is based on a dynamic compartmental model of the HIV epidemic that incorporates disease transmission and progression over time, behavioral changes, and effects of screening and associated...

We assess the cost-effectiveness of maintenance treatment for heroin addiction, with emphasis on its role in preventing HIV infection. The analysis is based on a dynamic compartmental model of the HIV epidemic among a population of adults, ages 18 to 44. The population is divided into nine...

We present a survey of over 50 representative problems in location research. Our goal is not to review all variants of different location models or to describe solution results, but rather to provide a broad overview of major location problems that have been studied, indicating briefly how they...

Introduction to the special issue devoted to police deployment. By publishing these four refereed papers together in one issue of Management Science, we have the dual purpose of presenting new substantive research results in an important public sector problem area and of attracting other...

The transactional data of a queueing system are the recorded times of service commencement and service completion for each customer served. With increasing use of computers to aid or even perform service one often has machine readable transactional data, but virtually no information about the...

We consider a multi-priority, N-server, Poisson arrival, nonpreemptive queue, motivated by police applications. The number of servers requested by an arrival has a known priority dependent probability distribution. All servers requested by a customer must start service simultaneously; the...

A simple modification of one equation in Larson (1990) reduces the computational complexity of the algorithm for the Queue Inference Engine (QIE) from O(N⁵) to O(N³), where N is the number of customers queued during a congestion period.

Officers in police patrol cars operate in a complex stochastic environment. In addition to handling dispatcher-assigned calls for service from the public, they patrol to pose a threat of apprehension to would-be offenders and undertake certain on-site interventions to help improve general public...