An eigenvalue approach to discrete-time MAP/G/1 queues

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 485
  • Download : 0
In this paper, we demonstrate how one can effectively analyze the operational behavior of the discrete-time MAP/G/1 queue with various control policies. For this purpose, we take the single-vacation system as an example which becomes the basic model for single-machine production system with maintenance. We employ a hybrid approach with supplementary variables, eigenvalue and eigenvectors, and matrix analytic method. We derive the vector generating functions of the queue lengths and show that the queue length vector generating function factors into two components, one of which is the queue length at an arbitrary time during the idle period. Significance: Eigenvalues and eigenvectors can play an important role in analyzing discrete-time MAP/G/1 queues. Factorization of queue length distributions can be easily derived.
Publisher
UNIV CINCINNATI INDUSTRIAL ENGINEERING
Issue Date
2003-12
Language
English
Article Type
Article; Proceedings Paper
Citation

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, v.10, pp.644 - 650

ISSN
1943-670X
URI
http://hdl.handle.net/10203/79611
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0