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.

The most generalized form of the triadic operating policy for a controllable M/G/1 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

Using the known result of the expected busy period for a controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented

Us ing the known result of the expected bllsy period for the triadic Min (N, T, 0) operating po licy applied to a controllable M/GI1 queueing model, its upper and lower bounds are derived to approximate its corresponding ac tual value. 80th bounds are rep

The most generalized form of the triadic operation policy for an M/G/1 queueing model is developed It consists of three simple N, T and D operating policies and has a peculiar structure possessing concepts of dyadic policies Using the concept of the pseud

  The expected busy period for the controllable M/G/1 queueing model operating under the triadic policy is derived by using the pseudo probability density function which is totally different from the actual probability density function. In order to justif