• Journal of Distribution Science
• /
• v.17 no.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.

• Journal of Korean Society of Transportation
• /
• v.33 no.5
• /
• pp.488-496
• /
• 2015

The main reason to install pedestrian pushbuttons is improving traffic operations. The current guideline for the installation of signal systems with pedestrian pushbuttons is car-oriented. It is difficult to clearly understand the guideline because there isn't an in-depth study to compare the pros and cons of the pedestrian- and vehicle-oriented methods in terms of waiting time. Thus, this study aims to estimate the waiting times of pedestrians and vehicles. The two delay times are compared considering the hypothetical circumstances such as geometry, pedestrian crossing time, pedestrian/vehicle counts and arrival distribution. The results show that when the pedestrian traffic volume exceeds 97 ped/h in the case of a two-lane road (one lane in each direction) the pushbutton system is effective and beneficial to pedestrians. It means that the total waiting time of pedestrians is less than the one of vehicles. Additional four scenarios are designed and tested by varying the number of lanes and design speeds. In conclusion, the pushbutton signal is more beneficial for pedestrians when the number of pedestrians is less than or equal to 85, 70, and 70 ped/h for the three-lane scenario, the four-lane with the design speed of 80km/h scenario, and the four-lane with the design speed of 100km/h, respectively.

• Journal of the Korean Institute of Navigation
• /
• v.21 no.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.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.1-12
• /
• 2016

In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.153-168
• /
• 1998

In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished Products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be backordered. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the proportion of backordered demands, the average number of backordered demands and the mean waiting time of a backordered demand. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. A matrix geometric method is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method were compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.