Server staffing to meet time-varying demand

Otis B. Jennings, Avishai Mandelbaum, William A. Massey, Ward Whitt

Research output: Contribution to journalArticlepeer-review

156 Scopus citations

Abstract

We consider a multiserver service system with general nonstationary arrival and service-time processes in which s(t), the number of servers as a function of time, needs to be selected to meet projected loads. We try to choose s(t) so that the probability of a delay (before beginning service) hits or falls just below a target probability at all times. We develop an approximate procedure based on a time-dependent normal distribution, where the mean and variance are determined by infinite-server approximations. We demonstrate that this approximation is effective by making comparisons with the exact numerical solution of the Markovian Mt/M/ st model.

Original languageEnglish (US)
Pages (from-to)1383-1394
Number of pages12
JournalManagement Science
Volume42
Issue number10
DOIs
StatePublished - Oct 1996

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research

Keywords

  • Capacity Planning
  • Infinite-server Queues
  • Multiserver Queues
  • Nonstationary Queues
  • Operator Staffing
  • Queues
  • Queues with Time-dependent Arrival Rates

Fingerprint Dive into the research topics of 'Server staffing to meet time-varying demand'. Together they form a unique fingerprint.

Cite this