Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2009.02.024 Byline: Nir Perel (a), Uri Yechiali (a)(b) Keywords: Alternating queue; M / M / 1 ; M / M / c ; M / M / [infinity] ; Slow server(s); Impatient customers; Abandonment Abstract: We study M/M/c queues (c=1, 1 We concentrate on deriving analytic solutions to the queue-length distributions. We derive, for each case of c, the corresponding probability generating function, and calculate the mean queue size. Several extreme cases are investigated and numerical results are presented. Author Affiliation: (a) Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel (b) Afeka Academic College of Engineering, Afeka, Tel Aviv 69107, Israel Article History: Received 6 August 2008; Accepted 18 February 2009

The effect of breakdown and repairs on polling systems is analyzed. The repairs are considered in three service mechanisms: Gated, Exhaustive and Globally Gated.

A look-ahead method for Value Iteration Algorithms used in solving both discounted and undiscounted Markov decision processes is presented. Based on the value-oriented concept which incorporates multiple adaptive relaxation factors, the approach leads to procedures which perform better than the separate application of either the concept of value oriented or of relaxation. The approach also appears useful in solving large-scale Markov decision processes.