Digital Repository at the University of Maryland (DRUM)  >
Institute for Systems Research  >
Institute for Systems Research Technical Reports 

Please use this identifier to cite or link to this item:

Title: A Lower Bounding Result for the Optimal Policy in an Adaptive Staffing Problem
Authors: Assad, Arjang A.
Fu, Michael C.
Yoo, Jae-sin
Department/Program: ISR
Type: Technical Report
Keywords: algorithms
dynamic programming
service operations
Systems Integration Methodology
Issue Date: 1998
Series/Report no.: ISR; TR 1998-7
Abstract: We derive a lower bound for the staffing levels required to meet a projected load in a retail service facility. We model the queueing system as a Markovian process with non-homogeneous Poisson arrivals. Motivated by an application from the postal services, we assume that the arrival rate is piecewise constant over the time horizon and retain such transient effects as build- up in the system. The optimal staffing decision is formulated as a multiperiod dynamic programming problem where staff is allocated to each time period to minimize the total costs over the horizon. The main result is the derivation of a lower bound on the staffing requirements that is computed by decoupling successive time periods.
Appears in Collections:Institute for Systems Research Technical Reports

Files in This Item:

File Description SizeFormatNo. of Downloads
TR_98-7.pdf180.42 kBAdobe PDF514View/Open

All items in DRUM are protected by copyright, with all rights reserved.


DRUM is brought to you by the University of Maryland Libraries
University of Maryland, College Park, MD 20742-7011 (301)314-1328.
Please send us your comments