• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.141-149
• /
• 1999

In this paper, we consider multiple-class queueing systems in which the server starts a set-up as soon as the number of customers in the "start-up class" reaches threshold N. After the set-up the server starts his service. We obtain the Laplace-Stieltjes transform and the mean of the waiting times of each class of customers for FCFS and non-preemptive priority disciplines.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.1
• /
• pp.37-49
• /
• 2003

Using the concept of closed queueing network, we present a consistent way of interpreting existing duality relations among queueing systems. Also, using embedded Markov chains, we present a few new duality relations for the queueing systems with negative customers.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.88-97
• /
• 1995

This paper provides equation for computing the AOQ of an unreliable random FMS. The FMS is described using open central server model with network GI/G/S Queues. And the equation for AOQ is simplified due to computational complexities. Numerical example is used to show the effect of AOQ according to inspection location, reliability of equipment in an FMS, and the effect of difference of routing probability is compared after finding the AOQL of each machine center.

• Journal of Korean Society of Transportation
• /
• v.4 no.2
• /
• pp.75-92
• /
• 1986

The paper contains the data collection methods and procedures employed in the study to evaluate the operational effects of stop sign and signal control at diamond interchanges. An assessment of traffic control alternatives is described in terms of operational effects of queues and travel speed. Guidelines for installing signal control at diamond interchanges are provided in terms of internal volume, left turn proportion within internal volume, and the sum of internal and external volume. The specific traffic volume guidelines were developed based on a combination of these variables affecting operational performance.

• Proceedings of the Optical Society of Korea Conference
• /
• 2005.02a
• /
• pp.162-163
• /
• 2005

One of the most important things in EPON(Ethernet Passive Optical Network) is that ONUs(Optical Network Units) have to share a channel in upstream direction. We proposed a new algorithm of Dynamic Bandwidth Allocation using Multiple LLID(Logical Link IDentifier). We show how to allocate bandwidth in Queues for improving performance from Bandwidth using Multiple LLID.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.403-426
• /
• 1998

We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.179-186
• /
• 1996

This paper provides equations for computing the AOQ of an unreliable random FMS. The FMS is described using an open central server model of GI/G/S Queues. The equation for AOQ is simplified due to computational complexities. A Numerical example is used to show the effect of AOQ according to inspection location, reliability of equipment in an FMS. The effect of difference in routing probability is compared after finding the AOQL of each machine center.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.83-93
• /
• 1996

In this research, we concentrate on the effects of dependencies in arrival processes on queueing measures. In particular, we use a specific form of arrival process which has the advantage of allowing us to change dependency properties without at the same time changing one dimensional distributional conditions. It is shown that the mean queue length can be made arbitrarily large with the same interarrival distributions and the same service time distributions with fixed smaller than one traffic intensity.

• Communications of the Korean Mathematical Society
• /
• v.10 no.2
• /
• pp.443-460
• /
• 1995

We consider a G/M/1 vacation model where the vacation time has k-stages generalized Erlang distribution. By using the methods of the shift operator and supplementary variable, we explicitly obtain the limiting probabilities of the queue length at arrival time points and arbitrary time points simultaneously. Operational calculus technique is used for solving non-homogeneous difference equations.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.291-297
• /
• 2003

This paper considers discrete-time two-class Ge $o^{X/}$G/1 queues with preemptive repeat priority. Service times of messages of each priority class are i.i.d. according to a general discrete distribution function that may differ between two classes. Completion times are derived for the preemptive repeat identical and different priority disciplines. By using the completion time, the stability condition for our system is investigated.d.