• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.18-26
• /
• 2006

여러 형태의 고객이 외부로부터 포아송과정에 따라 각 대기행렬에 도착하고 정해진 서비스규칙에 따라 해당 서비스를 받은 후 마코비안 확률분포에 따라 시스템을 떠나거나 다른 형태의 고객으로 시스템을 다시 돌아 올 수도 있는 M/G/1 대기행렬시스템을 고려한다. 본 연구에서는 기존의 연구 모형을 확장하여 계층적 서비스 규칙을 갖는 우선순위 대기행렬모형을 제시하고 이에 대한 시스템 성능척도를 보다 체계적으로 구할 수 있는 방법을 소개한다. 이를 위하여 먼저 대기행렬시스템의 거동을 나타내는 시스템 상태를 정의하고, 바쁜기간과 서비스기간 분석을 통하여 시스템 상태의 선형 함수로 평균체제시간을 구할 수 있음을 보인다.

• Journal of the Korea Society for Simulation
• /
• v.17 no.2
• /
• pp.75-82
• /
• 2008

The times of service commencement and service completion had been used for inferring the queueing systems. However, the service commencement times are difficult to measure because of unobservable nature in queueing systems. In this paper, for inferring queueing systems, the service commencement times are replaced for arrival times which can be easily observed. Determining the service commencement time is very important in our methods. The methods for first come first served(FCFS), last come first served(LCFS) queueing discipline are already developed in our previous work. In this paper, we extend to random selection for service(RSS) queueing discipline. The performance measures we used are mean queueing time and mean service time, the variances of two. The simulation results verify our proposed methods to infer queueing systems under RSS discipline.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.874-880
• /
• 2005

본 논문에서는 D-정책과 복수휴가를 갖는 MAP/G/1 대기행렬시스템의 고객수를 분석한다. 고객도착은 마코비안 도착과정(MAP)을 따른다. 서어버는 바쁜기간 종료 직후 휴가를 떠나고 휴가에서 돌아온 직후의 시스템 총일량이 D를 초과할 때까지 휴가를 반복한다. 만일, 휴가에서 돌아온 직후의 시스템 총일량이 D를 초과하면, 서어버는 즉시 서비스를 시작한다. 본 논문에서는 임의의 이탈시점 고객수분포를 유도하고, 이를 이용하여 임의시점 고객수분포와 평균고객수를 유도한다. 또한, 동일한 조건하에 D-정책과 복수휴가를 갖는 M/G/1 대기행렬시스템의 평균고객수와의 차이를 비교해 본다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.2
• /
• pp.168-174
• /
• 2000

All the visiting customers makes a queue and then can be served at an unoccupied server, in the queueing system of multi-server. The customer and server, however, have a conflictive feeling of satisfaction at all times. To solve the problem, in this paper, it is proposed that new design method of server number to maximize the satisfaction level of customer and server by the hzzy concept which is applied to the queuing system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.2 s.3
• /
• pp.13-22
• /
• 2003

It is recognized that one of the problems for the current 'Traffic Adaptive Control System in Seoul' is the performance at the oversaturated condition. Instead of 'Degree of Saturation' adopted in the current system, the methodology of balancing the queue length was developed and evaluated in this study. This method keeps the balance of queue lengths on the intersections and reduces the overall queue lengths. In addition a traffic signal control model was developed based on the method. This model can reduce not only the queue lengths but also the average delay of vehicles according to the macroscopic and microscopic evaluations.

• Journal of Korean Society of Transportation
• /
• v.22 no.3 s.74
• /
• pp.85-94
• /
• 2004

Loop detection systems have been used in real-time signal control system to collect traffic information for estimating queue lengths. The queue length algorithm uses speed as a key variable estimated from occupancy time and average vehicle length. The measurement of average vehicle length is affected from the lengths of feeder cable, but their effects have not yet been evaluated. In this study, the variability of average vehicle length due to the lengths of feeder cable is assessed through a field study, and a practical guidelines is proposed. By applying this result, the operational performance of real-time signal control system could be improved.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.23-32
• /
• 2017

In this paper, We suggest a unified approach for the analysis of discrete-time MAP/G/1 queueing system. Many researches on the D-MAP/G/1 queue have been used different approach to analyze system queue length and waiting time for the same system. Therefore, a unified framework for analyzing a system is necessary from a viewpoint of system design and management. We first derived steady-state workload distribution, and then waiting time and sojourn time are derived by the result of workload analysis. Finally, system queue length distribution is derived with generating function from the sojourn time distribution.

• Journal of the Korea Society for Simulation
• /
• v.25 no.3
• /
• pp.117-123
• /
• 2016

This paper presents inference methods for inner operations of a multi-server queue when historical data are limited or system observation is restricted. In a queueing system analysis, autocorrelated arrival and service processes increase the complexity of modeling. Accordingly, numerous analysis methods have been developed. In this paper, we introduce an inference method for specific situations when external observations exhibit autocorrelated structure and and observations of internal operations are difficult. We release an assumption of the previous method and provide lemma and theorem to guarantee the correctness of our proposed inference method. Using only external observations, our proposed method deduces the internal operation of a multi-server queue via non-parametric approach even when the service times are autocorrelated. The main internal inference measures are waiting times and service times of respective customers. We provide some numerical results to verify that our method performs as intended.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.69-80
• /
• 2024

In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.2 s.7
• /
• pp.13-22
• /
• 2005

The purpose of this research is how to estimate the traffic queue length in the signal intersection accurately. The current traffic queue length algorithm in COSMOS has been using the congestion diagram which comes from the speed of an average separated vehicle - using average vehicle length and the occupancy time from loop detectors. So some errors were occurred by the speed estimation method using average vehicle lengths. And Operators had been difficult to optimize some variables for measuring the traffic queue length estimation algorithm in COSMOS. Therefore the traffic queue length estimation algorithm on the basis of the relation between distances and occupancy rates from loop detectors was developed in this thesis. This thesis had the advantage of using occupancy rates which came out from loop detectors easily and no need to optimize some variables for the established algorithm in COSMOS. And the results of testing this algorithm in some sites which had installed COSMOS system showed better results than COSMOS system's results. But it was noted that further studies which carry it out in various sites and under various cases are necessary for applying to actual intersections.