default search action
Annals of Operations Research, Volume 160
Volume 160, Number 1, April 2008
- Qi-Ming He, Tetsuya Takine, Peter G. Taylor, Hanqin Zhang:
Preface. 1-2 - Benny Van Houdt, Jeroen Van Velthoven, Chris Blondia:
QBD Markov chains on binomial-like trees and its application to multilevel feedback queues. 3-18 - Jung Woo Baek, Ho Woo Lee, Se Won Lee, Soohan Ahn:
A factorization property for BMAP/G/1 vacation queues under variable service speed. 19-29 - Nigel G. Bean, Nectarios Kontoleon, Peter G. Taylor:
Markovian trees: properties and algorithms. 31-50 - Levente Bodrog, András Horváth, Miklós Telek:
Moment characterization of matrix exponential and Markovian arrival processes. 51-68 - Marco Gribaudo, Daniele Manini, Bruno Sericola, Miklós Telek:
Second order fluid models with general boundary behaviour. 69-82 - Liming Liu, Masakiyo Miyazawa, Yiqiang Q. Zhao:
Geometric decay in level-expanding QBD models. 83-98 - Nigel G. Bean, Malgorzata M. O'Reilly:
Performance measures of a multi-layer Markovian fluid model. 99-120 - Attahiru Sule Alfa, Barbara Haas Margolius:
Two classes of time-inhomogeneous Markov chains: Analysis of the periodic case. 121-137 - Tamás Éltetö, Péter Vaderna:
Finding upper-triangular representations for phase-type distributions with 3 distinct real poles. 139-172 - Jiashan Tang, Yiqiang Q. Zhao:
Stationary tail asymptotics of a tandem queue with feedback. 173-189 - T. G. Deepak, Achyutha Krishnamoorthy, Narayanan C. Viswanath, K. Vineetha:
Inventory with service time and transfer of customers and/inventory. 191-213 - V. Ramaswami, Douglas G. Woolford, David A. Stanford:
The erlangization method for Markovian fluid flows. 215-225 - Mark S. Squillante, Yanyong Zhang, Anand Sivasubramaniam, Natarajan Gautam:
Generalized parallel-server fork-join queues with dynamic task scheduling. 227-255
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.