PKPeter J. Kolesar

Peter J. Kolesar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Peter J. Kolesar has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A simple model of optimal clearance of improvised explosive devices

    by Peter Kolesar, Kellen Leister, Daniel Stimpson, Ronald Woodaman


  • Top Cited Papers

    Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System

    by Linda V. Green, Peter J. Kolesar, Ward Whitt

    We review queueing‐theory methods for setting staffing requirements in service systems where customer demand varies in a predictable pattern over the day. Analyzing these systems is not straightforward, because standard queueing theory focuses on the long‐run steady‐state behavior of stationary models. We show how to adapt stationary queueing models for use in nonstationary environments so that time‐dependent performance is captured and staffing requirements can be set. Relatively little modification of straightforward stationary analysis applies in systems where service times are short and the targeted quality of service is high. When service times are moderate and the targeted quality of service is still high, time‐lag refinements can improve traditional stationary independent period‐by‐period and peak‐hour approximations. Time‐varying infinite‐server models help develop refinements, because closed‐form expressions exist for their time‐dependent behavior. More difficult cases with very long service times and other complicated features, such as end‐of‐day effects, can often be treated by a modified‐offered‐load approximation, which is based on an associated infinite‐server model. Numerical algorithms and deterministic fluid models are useful when the system is overloaded for an extensive period of time. Our discussion focuses on telephone call centers, but applications to police patrol, banking, and hospital emergency rooms are also mentioned.


  • INSIGHTS ON SERVICE SYSTEM DESIGN FROM A NORMAL APPROXIMATION TO ERLANG'S DELAY FORMULA

    by Peter J. Kolesar, Linda V. Green

    We show how a simple normal approximation to Erlang's delay formula can be used to analyze capacity and staffing problems in service systems that can be modeled as M/M/s queues. The numbers of servers, s, needed in an M/M/s queueing system to assure a probability of delay of, at most, p can be well approximated by s ≅ p + z ***I‐ p+, where z 1‐ p, is the (1 ‐ p)th percentile of the standard normal distribution and ρ, the presented load on the system, is the ratio of Λ, the customer arrival rate, to μ, the service rate. We examine the accuracy of this approximation over a set of parameters typical of service operations ranging from police patrol, through telemarketing to automatic teller machines, and we demonstrate that it tends to slightly underestimate the number of servers actually needed to hit the delay probability target—adding one server to the number suggested by the above formula typically gives the exact result. More importantly, the structure of the approximation promotes operational insight by explicitly linking the number of servers with server utilization and the customer service level. Using a scenario based on an actual teleservicing operation, we show how operations managers and designers can quickly obtain insights about the trade‐offs between system size, system utilization and customer service. We argue that this little used approach deserves a prominent role in the operations analyst's and operations manager's toolbags.