• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.81-90
• /
• 2016

Different from general operating policies to be applied for controllable queueing models, two of three well-known simple N, T and D operating policies are applied alternatingly to the single server controllable queueing models, so called alternating (NT), (ND) and (TD) policies. For example, the alternating (ND) operating policy is defined as the busy period is initiated by the simple N operating policy first, then the next busy period is initiated by the simple D operating policy and repeats the same sequence after that continuously. Because of newly designed operating policies, important system characteristic such as the expected busy and idle periods, the expected busy cycle, the expected number of customers in the system and so on should be redefined. That is, the expected busy and idle periods are redefined as the sum of the corresponding expected busy periods and idle periods initiated by both one of the two simple operating policies and the remaining simple operating policy, respectively. The expected number of customers in the system is represented by the weighted or pooled average of both expected number of customers in the system when the predetermined two simple operating policies are applied in sequence repeatedly. In particular, the expected number of customers in the system could be used to derive the expected waiting time in the queue or system by applying the famous Little's formulas. Most of such system characteristics derived would play important roles to construct the total cost functions per unit time for determination of the optimal operating policies by defining appropriate cost elements to operate the desired queueing systems.

• Journal of Applied Reliability
• /
• v.17 no.1
• /
• pp.58-65
• /
• 2017

Different from general operating policies applied for various waiting line situations, two complementary dyadic operating policies are applied alternatingly to a single server maintenance service center model. That is, either of the two dyadic Min (N, T) or Max (N, T) policy is applied to operate such center first and the other operating policy should be applied later, and then the same sequence of both operating policies is followed repeatedly. This operating policy is denoted by the Minimax (N, T) policy. Purpose: Because of the newly introduced operating policy, important system characteristics of the considered service center model such as the expected busy and idle periods, the expected number of customers in the service center and so on should be derived to provide necessary information for determination of the optimal operating policy. Methods: Based on concepts of the newly introduced Minimax (N, T) policy, all necessary system characteristics should be redefined and then derived by constructing appropriate relations between complementary two dyadic operating policies. Results: Desired system characteristics are obtained successfully using simple procedures developed by utilizing peculiar structure of the Minimax (N, T) policy. Conclusion: Applying Minimax (N, T) operating policy is equivalent to applying the simple N and T operating policies alternatingly.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.469-474
• /
• 2011

In a M/G/I queue where the server alternates between busy and idle periods, we assume that firstly customers arrive at the system according to a Poisson process and the arrival process and customer service times are mutually independent, secondly the system has infinite waiting room, thirdly the server utilization is less than 1 and the system has reached a steady state. With these assumptions, we analyze waiting times on the systems where some vacation policies are considered.