Skip to main content

Advertisement

Log in

Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A parallel server system is considered, with I customer classes and many servers, operating in a heavy traffic diffusion regime where the queueing delay and service time are of the same order of magnitude. Denoting by \(\widehat{X}^{n}\) and \(\widehat{Q}^{n}\), respectively, the diffusion scale deviation of the headcount process from the quantity corresponding to the underlying fluid model and the diffusion scale queue-length, we consider minimizing r.v.’s of the form \(c^{n}_{X}=\int_{0}^{u}C(\widehat{X}^{n}(t))\,dt\) and \(c^{n}_{Q}=\int_{0}^{u}C(\widehat{Q}^{n}(t))\,dt\) over policies that allow for service interruption. Here, C:ℝI→ℝ+ is continuous, and u>0. Denoting by θ the so-called workload vector, it is assumed that \(C^{*}(w):=\min\{C(q):q\in\mathbb{R}_{+}^{\mathbf{I}},\theta\cdot q=w\}\) is attained along a continuous curve as w varies in ℝ+. We show that any weak limit point of \(c^{n}_{X}\) stochastically dominates the r.v. \(\int_{0}^{u}C^{*}(W(t))\,dt\) for a suitable reflected Brownian motion W and construct a sequence of policies that asymptotically achieve this lower bound. For \(c^{n}_{Q}\), an analogous result is proved when, in addition, C is convex. The construction of the policies takes full advantage of the fact that in this regime the number of servers is of the same order as the typical queue-length.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Atar, R.: A diffusion regime with non-degenerate slowdown. Preprint

  2. Atar, R., Gurvich, I.: Work in progress

  3. Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley, New York (1999)

    Book  Google Scholar 

  4. Chen, H., Mandelbaum, A.: Leontief systems, RBVs and RBMs. In: Applied Stochastic Analysis, London, 1989. Stochastics Monogr., vol. 5, pp. 1–43. Gordon and Breach, New York (1991)

    Google Scholar 

  5. Gurvich, I.: Design and control of the M/M/N queue with multi-class customers and many servers. M.Sc. Thesis, Technion (July 2004)

  6. Halfin, S., Whitt, W.: Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3), 567–588 (1981)

    Article  Google Scholar 

  7. Jacod, J., Shiryaev, A.: Limit Theorems for Stochastic Processes. Springer, Berlin (1987)

    Google Scholar 

  8. Mandelbaum, A.: QED Q’s. Notes from a lecture delivered at the Workshop on Heavy Traffic Analysis and Process Limits of Stochastic Networks, EURANDOM (September 2003)

  9. Mandelbaum, A., Stolyar, A.L.: Scheduling flexible servers with convex delay costs: heavy traffic optimality of the generalized rule. Oper. Res. 52, 836–855 (2004)

    Article  Google Scholar 

  10. van Mieghem, J.A.: Dynamic scheduling with convex delay costs: the generalized rule. Ann. Appl. Probab. 5(3), 809–833 (1995)

    Article  Google Scholar 

  11. Whitt, W.: How multiserver queues scale with growing congestion-dependent demand. Oper. Res. 51(4), 531–542 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rami Atar.

Additional information

Rami Atar was supported in part by the ISF (Grant 1349/08), the US–Israel BSF (Grant 2008466), and the Technion’s fund for promotion of research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Atar, R., Solomon, N. Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown. Queueing Syst 69, 217–235 (2011). https://doi.org/10.1007/s11134-011-9218-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-011-9218-1

Keywords

Mathematics Subject Classification (2000)

Navigation