Note on a Binomial Schedule for an M<sup>X</sup>/G/1 Queueing System with an Unreliable Server

<table>Plot of the total expected cost per unit of time as a function of the threshold level <svg height="11.175" id="M149" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 13.3125 11.175" width="13.3125" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M764 650l-7 -26q-61 -10 -91.5 -22.5t-76.5 -48.5l-235 -184q104 -152 208 -276q31 -37 54.5 -48.5t68.5 -16.5l-7 -28h-156q-138 170 -213 284q-19 29 -33.5 35t-33.5 -7l-29 -173q-15 -75 -5.5 -90.5t74.5 -20.5l-5 -28h-260l7 28q58 5 74 21.5t30 89.5l70 378
q12 68 2 83t-72 22l6 28h257l-7 -28q-62 -7 -76 -21.5t-27 -83.5l-32 -172q29 11 78 46q112 84 217 179q18 16 23.5 25.5t-1 14.5t-26.5 8l-30 4l5 28h249z" id="x1D43E"></path></g>
</svg>.</table>

International Scholarly Research Notices

fig1

Figure 1

Figure 1: Note on a Binomial Schedule for an M<sup>X</sup>/G/1 Queueing System with an Unreliable Server 

International Scholarly Research Notices

Note on a Binomial Schedule for an MX/G/1 Queueing System with an Unreliable Server

Figure 1

Note on a Binomial Schedule for an M^X/G/1 Queueing System with an Unreliable Server