• 대한산업공학회지
• /
• 제26권2호
• /
• pp.81-87
• /
• 2000

As for M/G/1 queueing system, we use various control policies, with which we can optimize the system. Up to now the most widely adopted policies are N-Policy, T-Policy, D-Policy, and so on. The existing researches are largely concerned to find an optimal operation condition or to optimize the system under single policy in M/G/1 system. There are, however, few literatures dealing with multiple control policies at once to enhance the flexibility of the model. In this study, we consider M/G/1 system adopting N-Policy and T-Policy simultaneously. If one of two conditions is satisfied, then, the server starts the service. We call this Min(N,T)-Policy. We find the probability distribution of the number of customers and mean waiting time in steady state and derive a cost function. Next, we seek the $N^*$, optimal threshold under various N values. Finally, we reveal the characteristics of cost function.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제17권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 the Korean Statistical Society
• /
• 제33권3호
• /
• pp.283-298
• /
• 2004

We present a trial solution approach to GI/M/l queues with generalized vacations. Specific types of generalized vacations we consider are N -policy and a combination of N-policy and exponential multiple vacations. Discussions about how to find trial solutions are given.

• Journal of applied mathematics & informatics
• /
• 제5권1호
• /
• pp.253-261
• /
• 1998

(s,S) inventrory system of a perishable item with positive lead times and finite backlogs under N-policy Under this policy as and when the inventory level drops to s-N during a lead time local purchase is made. Three models are con-sidered. The limiting distribution on the inventory level is obtained and an associated cost analysis is made. Results ae numerically illustrated.

• 한국콘텐츠학회논문지
• /
• 제12권1호
• /
• pp.386-399
• /
• 2012

본 논문에서는 해당 실무자들이 본 치과진료 정책에 관한 주관성을 진단하고, 기능적인 측면에서 세부적인 유형적 효과요인들을 확인하여 향후 개선과 방향성을 알아보고자 한다. 이 논문에서는 치과의사, 치과 위생사, 전공대학생들, 즉 해당 실무자와 전공자들의 주관적 성향을 살펴보기 위해서 Q방법론을 이용하였다. 분석된 결과, 총 6가지의 유형, 즉, 제 1유형[(N=11) : 확대 정책형(Extension Policy Type)], 제 2유형 [(N=13) : 제도적 개선형(Institutional Improvement Type)], 제 3유형[(N=5) : 이미지 개선형(Image Improvement Type)], 제 4유형[(N=14) : 치료 중심형(Treatment Focus Type)], 제 5유형[(N=5) : 효율적 접근형(Efficient Access Type)], 제 6유형[(N=10) : 발전적 요구형(Developmental Demand Type)] 등으로 분류되었다. 또한 QUANL 프로그램을 실시해 본 결과, 전체변량의 약 28(0.2791)%를 설명하였다. 결과적으로, 앞으로 계량적인 실증적 연구와 소비자들의 의견을 종합한 비교와 대안책이 추가된다면, 치과의사, 치과위생사, 전공대학생들의 주관성에 관한 보다 심도 있는 연구결과가 제시될 수 있을 것으로 예상된다. 또한, 이러한 연구의 한계를 보완하는 후속연구가 지속적으로 진행되어지기를 기대한다.

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

• 대한산업공학회지
• /
• 제31권4호
• /
• pp.297-302
• /
• 2005

Kopzon and Weiss adopted the notion of push-pull into the queueing system recently. We extend this queueing system to the ($N_1,N_2$)-policy version such that the original system corresponds to the special case $N_1=N_2=1$. For the extended system, we perform the cycle analysis and obtain the PGF of the stationary number of customers in the system.

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

• 산업경영시스템학회지
• /
• 제38권1호
• /
• pp.21-29
• /
• 2015

A steady-state controllable M/G/1 queueing model operating under the {T:Min(T,N)} policy is considered where the {T:Min(T,N)} policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or after T time units elapsed without a customer' arrival, the time instant when Nth customer arrives at the system or T time units elapsed with at least one customer arrives at the system whichever comes first. After deriving the necessary system characteristics including the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time for the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, procedures to determine the optimal values of the decision variables included in the operating policy are provided based on minimizing the total expected cost function per unit time to operate the queueing system under considerations.

• 한국경영과학회지
• /
• 제37권3호
• /
• pp.69-78
• /
• 2012

Reduction of power consumption has been a major issue and an interesting challenge to maximize the lifetime of wireless sensor networks. We investigate the practical meaning of N-policy in queues as a power saving technique in a WSN. We consider the N-policy of a finite M/M/1 queue. We formulate the optimization problem of power consumption considering the packet loss probability. We analyze the trade-off between power consumption and the packet loss probability and demonstrate the operational characteristics of N-policy as a power saving technique in a WSN with various numerical examples.