• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.8-12
• /
• 2004

In this study we consider a CONWIP system in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied are backordered according to the number of demands that exist at their arrival instants. For this system we develop an approximation method to calculate order based performance measures such as the mean time of fulfilling a customer order and the mean number o: customer orders. 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. Numerical tests show that the approximation method provides fairly good estimation of the performance measures of interest.

• 한국경영과학회지
• /
• 제20권3호
• /
• pp.61-75
• /
• 1995

In a microcellular personal communication service (PCS) it is required to minimize the paging and location updating signals. We propose a multi-layered location registration scheme to reduce the paging and updating signals. In this scheme the subscribers are grouped by their characteristics (velocity and call arrival rate) and are served by appropriately sized location registration area. In order to group the subscriber, we define subscriber grouping problem (SGP). Proposition are examined to solve the grouping problem. The performance of the proposed subscriber grouping algorithm is tested with examples. Simulation results indicate that the subscriber grouping procedure is effective for designing the multi-layered location registration scheme.

• 한국경영과학회지
• /
• 제25권1호
• /
• pp.15-26
• /
• 2000

We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network can not exceed a given value k. Customers arriving at the queueing network when there are more than k customers are forced to walt in an external queue. The arrival process to the queueing network is assumed to be arbitrary. It is known that the queueing network with population constrant and constant service times can be transformed into a simple network involving only two nodes. In this paper, the departure process from the queueing network is examined using this simple network. An approximation can be calculated with accuracy. Finally, validations against simulation data establish the tightness of these.

• 한국경영과학회지
• /
• 제25권2호
• /
• pp.59-66
• /
• 2000

In this paper we propose an approximation analysis for the system size distribution of the M/G/c system which is transform-free,. At first we borrow the system size distribution from the Markovian service models and then introduce a newly defined parameter in place of traffic intensity. In this step we find the distribution of the number of customers up to c. Next we concentrate on each waiting space of the queue separately rather than consider the entire queue as a whole. Then according to the system state of the arrival epoch we induce the probability distribution of the system size recursively. We discuss the effectiveness of this approximation method by comparing with simulation for the mean system size.

• 경영과학
• /
• 제24권1호
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2004년도 추계학술대회
• /
• pp.221-227
• /
• 2004

This study develops a improved gate assignment algorithm and decision support system using its algorithm to extract a assignment result minimizing a walking distance of passengers in airport and maximizing the utilization rate of avaliable gates in domestic airports. By operation support system, it may contribute greatly in efficient enlargement of airport operation and increase the airport reliability through quickly coping with takeoff and landing delay of flight due to weather change, preservation and repair of gate, etc. Also, passengers who use airport terminal can minimize time and walking distance for departure, arrival, and transit, and it may greatly reduce the additional operation cost for common gates through maximizing the utilization rate for exclusive usage gates for airplanes which use gates.

• 대한안전경영과학회지
• /
• 제2권2호
• /
• pp.127-137
• /
• 2000

Inchon Port is the second largest import-export port of Korea, and has the point at issue such as the excessive logistics cost because of the limits of handling capacity and the chronic demurrage. The purpose of this paper is to develop the simulation program as a long-term strategic support tool, considering the dual dock system and the TOC(Terminal Operation Company) system executed since March, 1997 in Inchon Port. The basic input parameters such as arrival intervals, cargo tons, service rates are analyzed and the probability density functions for these parameters are estimated. From the simulation model, it is possible to estimate the demurrage status through analyzing various scenarios and to establish the long-term port strategic plan.

• 유통과학연구
• /
• 제13권1호
• /
• pp.83-91
• /
• 2015

Purpose - Despite the structural irrationality of multi-level transportation and the oil price rise, the domestic freight transportation market continues to grow, mirroring the rise in e-commerce and resultant increase in courier services and freight volumes. Several studies on courier services have been conducted. However, few studies or statistics have been published regarding regular freight services although they have played a role in the freight service market. The present study identifies the characteristics of regular freight service users to seek competitiveness enhancement measures specific to regular freight services. Research design, data, and methodology - IPA is a comparative analysis of the relative importance of and satisfaction with each attribute simultaneously. This study used IPA because it facilitates the process of analyzing importance and performance, deriving implications and a visual understanding of results. To enhance the competitiveness of regular freight services, this study surveyed its current users regarding the importance of the regular freight service factors. A total of 200 copies of a questionnaire were circulated and 190 copies were returned. In addition to demographics, respondents answered questions about the importance of and satisfaction with services on a 5-point Likert scale. Excluding 3 inappropriate copies, 187 out of 190 copies were analyzed. PASW Statistics 18 was used for statistical analysis. A total of 20 question items were selected for the service factors presented in the questionnaire based on the 1st pilot survey and previous studies. Results - According to the IPA performed to compare the importance of and satisfaction with service factors, both importance and satisfaction are high in the 1st quadrant, which involves the economic advantage of using regular freight services, quick arrival at destinations, weight freight handling, and less time constraints on freight receipt/dispatch. This area requires continuous management. Satisfaction is higher than importance in the 2nd quadrant, which involves the adequacy of freight, cost savings over ordinary courier services, notification on freight arrival, and freight tracking information. This area requires intensive investment and management. Satisfaction is lower than importance in the 3rd quadrant, involving the credit card payment system, courier delivery service, distance to freight handling sites, easy access to freight handling sites, and prompt problem solving. This area requires further intensive management. Both importance and satisfaction are low in the 4th quadrant, involving the availability of collection service, storage space at freight handling sites, kindness of collection/delivery staff, kindness of outlet staff, and easy delivery checks. This area is a set of variables should be excluded from priority control targets. Conclusions - Based on the IPA, service factors that need priority controls because of high importance and low satisfaction include the credit card payment system, delivery service, distance to freight handling sites, easy access to freight handling sites, and prompt problem solving. The findings need to be applied to future marketing strategies for regular freight services and for developing competitiveness enhancement programs.

• 한국경영과학회지
• /
• 제33권3호
• /
• pp.43-58
• /
• 2008

In this paper, we have presented a dynamic, predictive location update scheme that takes into account each user's mobility patterns. A user's past movement history is used to create two-dimensional transition probability matrix which makes use of two directional consecutive location areas. A mobile terminal utilizes the transition probability to develop a predictive path which consists of several predictive nodes and then the location update is saved as long as a mobile user follows the predictive path. Using continuous-time Markov chain, cost functions of location update and paging are derived and it is shown that the number of predictive nodes can be determined optimally. To evaluate the proposed scheme, simulations are designed and the numerical analysis is carried out. The numerical analysis features user's mobility patterns and regularity, call arrival rates, and cost ratio of location update to paging. Results show that the proposed scheme gives lower total location management cost, compared to the other location update schemes.

• 한국항공운항학회:학술대회논문집
• /
• 한국항공운항학회 2016년도 춘계학술대회
• /
• pp.269-275
• /
• 2016

This paper considers the arrival, airport and departure capacity as a whole, through which, the network effect between airports is fully emphasized, the flight action is coordinated, and the flight demand pattern is reasonably assigned. The optimization problem of flight queues in multi-airport is studied in detail; the mathematical model of multi-airport opening non-real time flow management in terminal area is established, and related problems such as the parameters, the simplification and the solving of the model are discussed in detail to some extent. Appropriate decision making variables are taken to make the multi-airport network system linear 0-1 integer programming model, thus, the solving of the model is available and the central flow management is realized. The heuristic implicit enumeration presented in this paper can effectively solve this kind of problems. Through the simulation of some airports network system, we not only validate the algorithm presented in this paper, but also give a deep analysis of the results, which would produce reference for later practicable use. The simulation proves that this algorithm offers a good way to settle the problem of multi-airport flight queue optimization in air traffic management automation system in terminal area.