Quasi-birth-and-death Markov processes with a tree structure and the MMAP(K)-PH(K)-N-LCFS non-preemptive queue
Year of publication: |
2000
|
---|---|
Authors: | He, Q.-M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 120.2000, 3, p. 641-656
|
Saved in:
Saved in favorites
Similar items by person
-
Optimal and near-optimal inventory control policies for a make-to-order inventory-production system
He, Q.-M., (2002)
-
Flow Time Distributions in Queues With Customer Batching and Setup Times
He, Q.-M., (1997)
-
Computational Analysis of MMAP(K)-PH(K)-1 Queues with a Mixed FCFS and LCFS Service Discipline
HE, Q.-M., (2000)
- More ...