Extended Vacation Systems and the Universality of the M/G/1/K Blocking Formula

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5382

Full metadata record

DC Field	Value	Language
dc.creator	Keilson, Julian	-
dc.creator	Servi, Les D.	-
dc.date	2004-05-28T19:36:47Z	-
dc.date	2004-05-28T19:36:47Z	-
dc.date	1989-03	-
dc.date.accessioned	2013-10-09T02:39:25Z	-
dc.date.available	2013-10-09T02:39:25Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5382	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	A simple blocking formula B(K) = (1 - p)EK [1 - pEK]- 1 relates the probability of blocking for the finite capacity M/G/1/K to EK, the steady state occupancy tail probability of the same system with infinite capacity. The validity of this formula is demonstrated for M/G/1 vacation systems augmented by an idle state, an umbrella for a host of priority systems and vacation systems related to M/G/1. A class of occupancy level dependent vacation systems introduced are shown to require a variant of this blocking formula.	-
dc.format	1135373 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 193-89	-
dc.title	Extended Vacation Systems and the Universality of the M/G/1/K Blocking Formula	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI