• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.4
• /
• pp.162-168
• /
• 2011

The most generalized form of the triadic operating policy for a controllable M/G/I queueing model is analyzed to obtain fundamental relations among the other forms of operating policies based on its corresponding expected busy period. Since it consists of three decision variables N, T and D, it could be possible to decompose into the simple, the dyadic and other forms of the triadic operating policies. The procedures to decompose the most generalized triadic policy into other forms of operating policies could provide a general methodology to identify each element associated with it.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.1
• /
• pp.58-63
• /
• 2013

Using the known result of the expected busy period for the triadic Med (N, T, D) operating policies applied to a controllable M/G/1 queueing model, its upper and lower bounds are derived to approximate its corresponding actual values. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) or Max (N, T), Max (N, D) and Max (T, D) with the simple N, T and D operating policies without using any other types of triadic operating policies such as Min (N, T, D) and Max (N, T, D) policies. All three input variables N, T and D are equally contributed to construct such bounds for estimation of the expected busy period.