• 산업경영시스템학회지
• /
• 제34권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.

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.161-168
• /
• 2009

The most generalized form of the triadic operating 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 pseudo probability density function of the busy period, its expected busy period for the controllable M/G/1 queueing model is derived. Since the obtained result is the most generalized form the triadic polity, the expected busy periods for all known dyadic policies are recovered as special cases from it.

• 산업경영시스템학회지
• /
• 제33권3호
• /
• pp.63-70
• /
• 2010

Based on the known results of the expected busy periods for the triadic Min (N, T, D) and Max (N, T, D) operating policies applied to a controllable M/G/1 queueing model, a relation between them is constructed. Such relation is represented in terms of the expected busy periods for the simple N, T and D, and the dyadic Min (N, T), Min (T, D) and Min (N, D) operating policies. Hence, if any system characteristics for one of the two triadic operating policies are known, unknown corresponding system characteristics for the other triadic operating policy could be obtained easily from the constructed relation.

• 산업경영시스템학회지
• /
• 제36권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.

• 산업경영시스템학회지
• /
• 제30권2호
• /
• pp.51-57
• /
• 2007

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 justify the approach using the pseudo probability density function to derive the expected busy period for the triadic policy, well-known expected busy periods for the dyadic policies are derived from the obtained result as special cases.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.67-73
• /
• 2011

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 in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) and simple N, T and D operating policies. All three input variables N, T and D are equally contributed to construct such bounds for better estimation.

• 산업경영시스템학회지
• /
• 제33권2호
• /
• pp.97-104
• /
• 2010

Using the known result of the expected busy period for the triadic Min (N, T, D) operating policy applied to a controllable M/G/1 queueing model, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) and simple N, T and D operating policies. All three input variables N, T and D are equally contributed to construct such bounds for better approximations.

• 산업경영시스템학회지
• /
• 제31권4호
• /
• pp.86-92
• /
• 2008

The expected busy period for the controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy is derived by using a new concept so called "the pseudo probability density function." In order to justify the proposed approaches for the triadic policy, well-known expected busy periods for the dyadic policies are recovered from the obtained result as special cases.