• 한국국방경영분석학회지
• /
• 제2권1호
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• 유통과학연구
• /
• 제17권5호
• /
• pp.29-37
• /
• 2019

Purpose - This paper analyzes the effects of the SST characteristics at airports on behavioral intention through technology acceptance and customer satisfaction, and presents a strategic plan for introducing SSTs to airports providing differentiated services. Research design, data, and methodology - We examine the role of airport self-service characteristics and access the influence of the Technology Acceptance Model (TAM) on both customer satisfaction and behavioral intentions towards SSTs. To do this, a survey is conducted with passengers having used self-service technologies(SSTs) at Incheon International Airport. A total of 400 questionnaires are then analyzed using structural equation modeling. Results - According to the results, of the self-service characteristics, customer satisfaction and behavioral intention were affected by optimism through perceived ease of use, perceived usefulness, and perceived enjoyment and by innovativeness and insecurity through perceived ease of use. Conclusions - According to the results of the study, the purpose of using TBSS in the airport is to save time and convenience. Therefore, it is necessary to closely analyze the differences in technology acceptance by age and generation, increase user self-efficacy, increasing satisfaction through effective management of cognitive and emotional waiting time will have a positive impact on behavioral intentions.

• 대한교통학회지
• /
• 제33권5호
• /
• pp.488-496
• /
• 2015

일부 신호 횡단보도에서는 교통 운영의 효율을 위해 보행자 작동신호기를 설치한다. 현재 보행자 작동신호기의 설치기준은 보행자 수가 적은 단일로 횡단보도에서 설치하도록 제시되어 있다. 또한 해당 기준은 차량을 중심으로 만들어진 것으로 보행자 측면의 고려도 필요하다. 이러한 설치기준은 객관적으로 판단하기 어려우므로 공학적인 기준을 필요로 한다. 그러므로 본 연구는 보행자교통량과 차량교통량에 따라 각각의 지체시간을 산출하고 보행자와 차량을 동등한 입장에서 비교하여 공학적인 설치기준을 정립하는 것을 목적으로 하였다. 지체시간 산출을 위해 도로의 설계기준에 따른 횡단구성, 보행자 녹색시간, 보행자와 차량의 균일 도착분포 시나리오를 가정하였다. 그 결과 양방향 2차로일 경우 보행자 교통량이 97인/시 이하일 경우 보행자 작동신호기의 효과가 있는 것으로 나타났으며 이 결과는 차량보다 보행자에게 유리한 교통량 기준이다. 4개의 차로 수 시나리오에 따라 양방향 3차로, 양방향 4차로(설계속도80km/h, 100km/h)일 경우 각 85, 70, 70인/시 이하일 경우 보행자 작동신호기의 효과가 있는 것으로 나타났다.

• 한국항해학회지
• /
• 제21권1호
• /
• pp.1-11
• /
• 1997

Because of the sharp increase of its export and import container cargo volumes contrast to the lack of related Container Terminal facility, equipment and inefficient procedure, there is now heavy container cargo congestions in Pusan Container Terminal. As a result of such a situation, many container ships avoid their calls into Pusan port. This is a major cause that in tum kads to weakening intemational competitiveness of the Korean industry. This study, therefore, aims are to make a quantitative analysis of Container Terminal System through the computer simulation, especially focusing on its 4 sub-system of a handling system, 'it is checked whether the current operation is being performed effectively through the computer simulation. The overall findings are as folIows; Firstly, average tonnage of the ships visiting the BCTOC was 32,360 G/T in from January '96, to may '96. The average arrival interval and service time of container ships at BCTOC are 5.63 hours and 18.67 hours respectively. Ship's arrival and service pattern at BCTOC was exponential distribution with 95% confidence and Erlang-4 distribution with 99% confidence. Secondly, average waiting time and number of ships was 9.9 hours, 235 ships(38%) among 620 ships. Number of stevedoring container per ship was average 747.7 TED, standard deviation 379.1 TEU and normal distribution with 99% confidence. Thirdly, from the fact that the average storage days of containers at BCTOC are 2.75 days (3.0 days when import, 2.5 days when export). it is founds that most containers were transfered to the off-dock storage areas with the free periods(5 days when import, 4 days when export), the reason for which is considered to be the insufficient storage area at BCTOC. Fourthly, in the case of gate in-out at BCTOC, occupied containers and emptied containers are 89% and 11% respectively in the gate-in, 75% and 25% seperately in the gate-out. Finally, from the quantitative analysis results for container terminal at BCTOC, ship's average wating time of ships was found to be 20.77 hours and berth occupancy rate(${\rho}$) was 0.83. 5~6 berths were required in order that the berth occupancy rate(${\rho}$) may be maintained up to 60% degree.

• 한국산업정보학회논문지
• /
• 제21권6호
• /
• pp.1-12
• /
• 2016

본 논문에서는 D-정책을 갖는 이산시간 BMAP/G/1 대기행렬시스템의 일량을 분석한다. 유휴한 서버는 시스템에 도착한 고객집단의 서비스시간의 총합이 이미 정해진 일량 임계값 D를 초과하면 시스템에 서비스할 고객이 없을 때까지 서비스를 제공한다. 시스템의 안정상태 일량변환벡터를 유도하고 성능척도로서 평균일량을 구하였다. 시뮬레이션을 통해 이론값들의 타당성을 검증하고 간단한 수치예제를 보였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권2호
• /
• pp.69-80
• /
• 1999

Recently in telecommunication, BISDN ( Broadband Integrated Service Digital Network ) has received considerable attention for its capability of providing a common interface for future communication needs including voice, data and video. Since all information in BISDN are statistically multiplexed and are transported in high speed by means of discrete units of 53-octet ATM ( asynchronous Transfer Mode ) cells, appropriate traffic control needs. For traffic shaping of voice, the output cell discarding scheme has been proposed. We analyze the scheme with a MMPP/$D_1$, $D_2$/1/B queueing system to obtain performance measures such as loss probability and waiting time distribution.

• 대한산업공학회지
• /
• 제25권1호
• /
• pp.125-129
• /
• 1999

The Little's formula, $L={\lambda}W$, expresses a fundamental principle of queueing theory: Under very general conditions, the average queue length is equal to the product of the arrival rate and the average waiting time. This useful formula is now well known and frequently applied. In this paper, we demonstrate that the Little's formula has much more power than was previously realized when it is properly decomposed into what we call the microscopic Little's formula. We use the M/G/1 queue with server vacations as an example model to which we apply the microscopic Little's formula. As a result, we obtain a transform-free expression for the queue length distribution. Also, we briefly summarize some previous efforts in the literature to increase the power of the Little's formula.

• 한국정보처리학회논문지
• /
• 제7권6호
• /
• pp.1949-1955
• /
• 2000

This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

• 대한수학회보
• /
• 제43권3호
• /
• pp.657-669
• /
• 2006

In this paper, we analyze a leaky bucket (LB) scheme with queue length dependent arrival rates. In other words, if the queue length exceeds an appropriate threshold value on buffer, the arrivals need to be controlled. In ATM networks, if the congestion occurs, the input traffics must be controlled (reduced) for congestion resolution. By the bursty and correlated properties of traffics, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the loss probability and the waiting time distribution for arbitrary cell. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effects of our proposed LB scheme.

• 대한산업공학회지
• /
• 제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.