Show simple item record

Monotone Optimal Policies for a Transient Queueing Staffing Problem

dc.contributor.authorFu, Michael C.en_US
dc.contributor.authorMarcus, Steven I.en_US
dc.contributor.authorWang, I-Jengen_US
dc.date.accessioned2007-05-23T10:04:18Z
dc.date.available2007-05-23T10:04:18Z
dc.date.issued1997en_US
dc.identifier.urihttp://hdl.handle.net/1903/5879
dc.description.abstractWe consider the problem of determining the optimal policy for staffing a queueing system over multiple periods, using a model that takes into account transient queueing effects. Formulating the problem in a dynamic programming setting, we show that the optimal policy follows a monotone optimal control by establishing the submodularity of the objective function with respect to the staffing level and initial queue size in a period. In particular, this requires proving that the system occupancy in a G/M/s queue is submodular in the number of servers and initial system occupancy.en_US
dc.format.extent191086 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1997-62en_US
dc.subjectoptimizationen_US
dc.subjectdynamic programmingen_US
dc.subjectsubmodularityen_US
dc.subjecttransient queuesen_US
dc.subjectG/M/s queueen_US
dc.subjectservice oper ationsen_US
dc.subjectIntelligent Control Systemsen_US
dc.subjectSystems Integration Methodologyen_US
dc.titleMonotone Optimal Policies for a Transient Queueing 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