Abstract
AbstractWe consider a classic scheduling problem for optimally allocating a resource to multiple competing users and place it in the framework of Stochastic Flow Models (SFMs). We derive Infinitesimal Perturbation Analysis (IPA) gradient estimators for the average holding cost with respect to resource allocation parameters. These estimators are easily obtained from a sample path of the system without any knowledge of the underlying stochastic process characteristics. Exploiting monotonicity properties of these IPA estimators, we prove the optimality of the well-known cμ-rule not only for the two-queue case (as in earlier work) but for an arbitrary finite number of queues and stochastic processes under non-idling policies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
