Show simple item record

A Lower Bounding Result for the Optimal Policy in an Adaptive Staffing Problem

dc.contributor.authorAssad, Arjang A.en_US
dc.contributor.authorFu, Michael C.en_US
dc.contributor.authorYoo, Jae-sinen_US
dc.date.accessioned2007-05-23T10:05:35Z
dc.date.available2007-05-23T10:05:35Z
dc.date.issued1998en_US
dc.identifier.urihttp://hdl.handle.net/1903/5940
dc.description.abstractWe 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.en_US
dc.format.extent184748 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1998-7en_US
dc.subjectalgorithmsen_US
dc.subjectdynamic programmingen_US
dc.subjectstaffingen_US
dc.subjectservice operationsen_US
dc.subjectSystems Integration Methodologyen_US
dc.titleA Lower Bounding Result for the Optimal Policy in an Adaptive Staffing Problemen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record