The equivalence between processor sharing and service in random order

Author： Borst S.C.   Boxma O.J.   Morrison J.A.   Nunez Queija R.  

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.31, Iss.4, 2003-07, pp. : 254-262

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 93, Iss. 1, 1994-09 ,pp. : 29-91

John Wiley & Sons Inc

Access to resources Recommend Favorite

The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 22-2526, Iss. 1, 1994-09 ,pp. : 29-91

John Wiley & Sons Inc

Access to resources Recommend Favorite

The equivalence between ( AB ) † = B † A † and other mixed-type reverse-order laws

By Tian Yongge  

International Journal of Mathematical Education in Science and Technology, Vol. 37, Iss. 3, 2006-04 ,pp. : 331-339

Taylor & Francis Ltd

Access to resources Recommend Favorite

Strong order equivalence

By Faber Wolfgang  

Annals of Mathematics and Artificial Intelligence, Vol. 47, Iss. 1-2, 2006-06 ,pp. : 43-78

Springer Publishing Company

Access to resources Recommend Favorite

Up-scaling Flow in Fractured Media: Equivalence Between the Large Scale Averaging Theory and the Continuous Time Random Walk Method

By NŒtinger B.  

Transport in Porous Media, Vol. 43, Iss. 3, 2001-06 ,pp. : 581-596

Springer Publishing Company

Access to resources Recommend Favorite