Allocation of distinguishable servers (Q1820674): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0305-0548(86)90066-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1964276022 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the hypercube model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Repairman Allocation—Asymptotic Results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Repair Allocation in a Series System / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite state Markovian decision processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5615108 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5526189 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:07, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Allocation of distinguishable servers |
scientific article |
Statements
Allocation of distinguishable servers (English)
0 references
1986
0 references
The model considered is a variation of the hypercube model in which there are R distinguishable servers and N types of customers. We consider two interesting special cases - light and heavy traffic intensities - and use asymptotic techniques to derive policies for assigning servers to arriving customers which are optimal under these conditions. For light traffic, we show that it is optimal to assign the server with the smallest assignment cost while, for heavy traffic, we derive an efficient algorithm for finding the optimal policy.
0 references
hypercube model
0 references
optimal policy
0 references