Convexity properties of the overflow in an ordered-entry system with heterogeneous servers (Q1820673): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: David D. W. Yao / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Monique Bertrand / rank | |||
Normal rank | |||
Revision as of 15:52, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convexity properties of the overflow in an ordered-entry system with heterogeneous servers |
scientific article |
Statements
Convexity properties of the overflow in an ordered-entry system with heterogeneous servers (English)
0 references
1986
0 references
The GI/M/m loss system with ordered entry and heterogeneous servers is considered. The main results are the following: If the sequence of added servers have non-increasing service rates, then the overflow probabilities constitute a decreasing convex sequence. If the sequence of added servers have non-decreasing service rates, then the overflow probabilities constitute a decreasing log-concave sequence.
0 references
overflow system
0 references
convexity
0 references
server allocation
0 references
GI/M/m loss system
0 references
ordered entry
0 references
heterogeneous servers
0 references
overflow probabilities
0 references
