Sojourn times in a random queue with and without preemption

Author： Field A.J.   Harrison P.G.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.112, Iss.3, 1999-02, pp. : 646-653

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

Hitting times for random dynamical systems

By Arbieto Alexander   Junqueira André   Soares Regis  

Dynamical Systems: An International Journal, Vol. 28, Iss. 4, 2013-12 ,pp. : 484-500

Taylor & Francis Ltd

Access to resources Recommend Favorite

Reliability of several component sets with inspections at random times

By Dieulle L.  

European Journal of Operational Research, Vol. 139, Iss. 1, 2002-05 ,pp. : 96-114

Elsevier

Access to resources Recommend Favorite

Random lead times and expedited orders in (Q,r) inventory systems

By Bookbinder J.H.   Cakanyildirim M.  

European Journal of Operational Research, Vol. 115, Iss. 2, 1999-06 ,pp. : 300-313

Elsevier

Access to resources Recommend Favorite

On three-machine flow shops with random job processing times

By Kamburowski J.  

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 440-448

Elsevier

Access to resources Recommend Favorite

Single machine scheduling when processing times are correlated normal random variables

By Boys R.J.   Glazebrook K.D.   McCrone C.M.  

European Journal of Operational Research, Vol. 102, Iss. 1, 1997-10 ,pp. : 111-123

Elsevier

Access to resources Recommend Favorite