Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline (Q1708522)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/1 queue under random order service discipline |
scientific article; zbMATH DE number 6852527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline |
scientific article; zbMATH DE number 6852527 |
Statements
Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline (English)
0 references
23 March 2018
0 references
batch Markovian arrival process (BMAP)
0 references
Markovian service process (MSP)
0 references
random order service (ROS)
0 references
RG-factorization
0 references
expected sojourn time
0 references
0 references
0 references
