Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines (Q3768129)
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: Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines |
scientific article; zbMATH DE number 4026511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines |
scientific article; zbMATH DE number 4026511 |
Statements
Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines (English)
0 references
1987
0 references
convex ordering
0 references
ergodic sojourn times
0 references
work-conserving non-preemptive disciplines
0 references
convex programming problems
0 references
0.8811809420585632
0 references
0.8566614389419556
0 references
0.8303957581520081
0 references
0.8250256180763245
0 references
0.8222816586494446
0 references
