Skip to main content
SpringerLink
Log in

Scheduling arrivals to a stochastic service mechanism

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider the problem of scheduling the arrivals of a fixed number of customers to a stochastic service mechanism to minimize an expected cost associated with operating the system. We consider the special case of exponentially distributed service times and the problems in general associated with obtaining exact analytic solutions. For general service time distributions we obtain approximate numerical solutions using a stochastic version of gradient search employing Infinitesimal Perturbation Analysis estimates of the objective function gradient obtained via simulation.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Dvoretzky, On stochastic approximation,Proc. 3rd Berkeley Symp. on Mathematical Statistics and Probability, ed. J. Neyman, (University of California Press, Berkeley, 1956) pp. 39–55.

    Google Scholar 

  2. K.J. Healy, Scheduling arrivals to a queue, M.S. Thesis, The Pennsylvania State University (May 1982).

  3. K.J. Healy, C.D. Pegden and M. Rosenshine, Scheduling arrivals to multiple server queues, Working Paper No. 82-128, Dept. of Ind. and Mgmt. Sys. Engr., The Pennsylvania State University (October 1982).

  4. Y.C. Ho, M.A. Eyler and T.T. Chien, A gradient technique for general buffer storage design in a serial production line, Int. J. Prod. Res. 17 (1979) 557–580.

    Google Scholar 

  5. Ching-Jong Liao, Planning timely arrivals to stochastic production or service systems, Ph.D. Dissertation, Dept. of Ind. and Mgmt. Sys. Engr., The Pennsylvania State University (August 1988).

  6. C.D. Pegden and M. Rosenshine, Scheduling arrivals to queues, Working Paper No. 82-101, Dept. of Ind. and Mgmt. Sys. Engr., The Pennsylvania State University (January 1982).

  7. L.W. Schruben,Sigma A Graphical Simulation System (Scientific Press, San Francisco, 1991).

    Google Scholar 

  8. R. Suri, Perturbation analysis: The state of the art and research issues explained via theGI/GI/1 queue, Proc. IEEE 77 (1989) 114–137.

    Google Scholar 

  9. A. Van Ackere, Conflicting interests in the timing of jobs, Manag. Sci. 36 (1990) 970–984.

    Google Scholar 

  10. M.A. Zazanis, Infinitesimal perturbation analysis estimates for moments of the system time of anM/M/1 queue, Oper. Res. 38 (1990) 364–369.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Operations Research and Industrial Engineering, 204 Engineering and Theory Center, Cornell University, 14853, Ithaca, NY, USA

    Kevin J. Healy

Authors
  1. Kevin J. Healy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Healy, K.J. Scheduling arrivals to a stochastic service mechanism. Queueing Syst 12, 257–272 (1992). https://doi.org/10.1007/BF01158802

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158802

Keywords

Search

Navigation