Optimal assignments in a markovian queueing system

@article{Jarvis1981OptimalAI,
  title={Optimal assignments in a markovian queueing system},
  author={James P. Jarvis},
  journal={Computers & OR},
  year={1981},
  volume={8},
  pages={17-23}
}
A generalization of the Hypercube queueing model for exponential queueing systems is presented which allows for distinguishable servers and multiple types of customers. Given costs associated with each server-customer pair, the determination of the assignment policy which minimizes time-averaged coFts is formulated as a Markov decision problem. A characterization of optimal policies is obtained and used in an efficient algorithm for determining the optimum. The algorithm combines the method of… CONTINUE READING
4 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

A Class of Murkovian Problems Relafed to the Districting Problem /or Urban Emergency Services. Electronic Systems Laboratory, ESL-P-594

  • P. Varaiya. U. Schweizer, J. Hartwick
  • Massachusetts Institute of Technology
  • 1975

Chelst, Truns~e~ng tile Hyper~~be Queue&g coded to the New Haven Police ~pu~rne~t: A Case Study in Technoloav Trunsfer

  • K R.
  • The New York citv Rand institute
  • 1975

Opfimizafion of Stochastic Service Sysfems with Distinguishable Servers

  • J. P. Jarvis
  • Operations Research Center. IRP-TR-19-75…
  • 1975

Opiimal Dispafch Policies for Urban Server Sysfems

  • J. P. Jarvis
  • Operations Research Center. JRP-TR-02-73…
  • 1973

Schweitzer, iterative sot&an of the functional equations of undiscounted Markov renewal programming. 1. ~fathemu~ics Analysis and Appfi~afions

  • 1971

AppEed ~~o~u~i~ify Models wifh Opfim;za~ion App~icafioRs

  • S. M. Ross
  • 1970

Similar Papers

Loading similar papers…