dc.contributor.author |
Moretta, Brian |
en |
dc.contributor.author |
Ziedins, I. |
en |
dc.date.accessioned |
2009-06-12T00:11:18Z |
en |
dc.date.available |
2009-06-12T00:11:18Z |
en |
dc.date.issued |
1998 |
en |
dc.identifier.citation |
Journal of Applied Mathematics and Decision Sciences 2 (2), 119-132. 1998 |
en |
dc.identifier.issn |
1173-9126 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/4319 |
en |
dc.description |
An open access copy of this article is available and complies with the copyright holder/publisher conditions. |
en |
dc.description.abstract |
It is known that a threshold policy (or trunk reservation policy) is optimal for Erlang’s loss system under certain assumptions. In this paper we examine the robustness of this policy under departures from the standard assumption of exponential service times (call holding times) and give examples where the optimal policy has a generalized trunk reservation form. |
en |
dc.publisher |
Hindawi Publishing Corporation |
en |
dc.relation.ispartofseries |
Journal of Applied Mathematics and Decision Sciences |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.sherpa.ac.uk/romeo/issn/1173-9126/ |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables |
en |
dc.type |
Journal Article |
en |
dc.subject.marsden |
Fields of Research::230000 Mathematical Sciences::230100 Mathematics |
en |
dc.identifier.doi |
10.1155/S1173912698000066 |
en |
pubs.issue |
2 |
en |
pubs.begin-page |
119 |
en |
pubs.volume |
2 |
en |
dc.description.version |
VoR - Version of Record |
en |
dc.rights.holder |
Copyright: Hindawi Publishing Corporation |
en |
pubs.end-page |
132 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |