• Journal of the Korean Institute of Navigation
• /
• v.10 no.1
• /
• pp.101-127
• /
• 1986

Transportation provides an infrastructure vital to economic growth, and it is an integral part of production . As a port is the interface between the maritime transport and domestic transport sectors, it certainly plays a key role in any economic development. Therefore, it is doubtless that inadequacy of a nation's port will depress the level of throughput, to the level where it fails to meet the target set by the national economic planning schemes. Korea is surrounded by the seas and the economic structure of Korea consists of processing trades, so that it cannot be overstated that substantial economy in maritime transport coasts can be achieved through the improvement of the port transport system. This paper treats the transportation process in Pusan Port by Queueing Simulation method, and the reasonable size of Pusan Port is suggested from the point of view of efficiency maximization. The results of the analysis are summarized as follows; 1) the utility rate is 47.91 percents in general piers, 85-52 percents in container piers, and waiting time 5.2hrs, in general piers, 0.8 hrs, in container piers, and the probability of maximum queue length 12 ships in general piers, 2 ships in container piers, and the probability of waiting is 44 percents in general piers, 8 percents in container pier. 2) in general piers, the improvement of app. 30 percents in port capacity is desirable for operating effectively concerning the current arrival rate. By introducing the traffic control ion container piers, there is no apparent necessity of port investment, but I is expected to reduce invisible congestion occurred along the waiting line. 3) On Pusan Port, the optimal utility rate and the optimal arrival rate for reducing waiting time are 3.5 to 4.0(hrs./ship) in general piers, 5.1 to 6.0(hrs./ship) in container piers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.681-683
• /
• 2016

Recently, sharing economy is getting the attention of the public. So this phenomenon to share their goods, home, gifts, etc. in various fields has been increased. Typically when traveling away from home to host as "Airbnb", the share house to share their homes are traded most actively. Through a share house host can make money using house empty, customers can take advantage of the hostel while traveling at low prices. The existing share house system must ensure that every time they empty the house Customers, host had the inconvenience of having to wait for the application of the tenant customers. To solve this problem and to implement a service platform based on the waiting list. Through this platform, customers will be able to eliminate the inconvenience of having to find the house every time you want to apply for a tenant waiting to get home, give the order to wait.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.1
• /
• pp.45-55
• /
• 2022

Currently, the Collective Control Algorithm is the most popular elevator algorithm. The Collective Control Algorithm allows the user to use the elevator when the direction of movement of the elevator and the direction of the user's destination are the same. However, the algorithm has a problem in that only one elevator responds to a user's call when the user's waiting time and using multiple elevators. To solve this problem, this paper proposes a new hybrid HRN algorithm based on the highest response ratio next (HRN) algorithm. In general, HRN Algorithm requires a user's boarding time and getting off time, but due to the nature of the elevator, it is difficult to predict the user's call in advance. Therefore, to overcome these limitations, this paper proposes Hybrid HRN Algorithm that considers the distance between the user's call location and the arrival location. This paper shows that Hybrid HRN Algorithm, proposed through experiments, has an average waiting time of 23.34 seconds, a standard deviation of 11.86, a total moving distance of 535.2m, a total operating time of 84sec, and a driving balance between the two elevators is 92m, which is superior to the previously suggested Collective Control, Zoning, and 3-Passage Algorithm.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.109-117
• /
• 2010

In this study, we consider stationary waiting times in a simple fork-and-join type queue which consists of three single-server machines, Machine 1, Machine 2, and Assembly Machine. We assume that the queue has a renewal arrival process and that independent service times at each node are either deterministic or non-overlapping. We also assume that the Machines 1 and 2 have an infinite buffer capacity whereas the Assembly Machine has two finite buffers, one for each machine. Services at each machine are given by FIFO service discipline and a communication blocking policy. We derive the explicit expressions for stationary waiting times at all nodes as a function of finite buffer capacities by using (max,+)-algebra. Various characteristics of stationary waiting times such as mean, higher moments, and tail probability can be computed from these expressions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.49-57
• /
• 2005

Connector's role between components is very important in the CBD(Component Based Development). The most connector has process ADL based rrethod was choosing FIFO method by component request. But in case many component's with various characteristics request It is difficult that this method operate efficiently, In this research, I did design and implement priority connector considering component's processing time, Also, I used Wright architecture for formal specification. Application result of proposed connector was spend more 388ms compares with existent FIFO method in total processing time. But this method could handle preferentially from components that have short processing time. Also, in case of component's waiting time in connector, existent FIFO method is 23323,1 ms and proposal method is 12731.27ms, So, proposal method could reduce waiting time for component process.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.119-121
• /
• 2022

In this paper, we will make a model that finds optimal phase for each crossroad. When the traffic volume, traffic capacity, and the lane width of every direction is given for each crossroad, we aim to find the most efficient phase. We established an evaluation function that evaluates the efficiency of each phase using the values of the average waiting time in one direction, the average delay time, the standard deviation of the delay time, and the average delay time in each direction. The time allocation to optimize a phase pattern can be obtained by using the gradient decent method. Through this research, we hope to decrease the waiting time in transporation, thus improving the overall traffic condition in cities.

• Tunnel and Underground Space
• /
• v.24 no.6
• /
• pp.430-439
• /
• 2014

This study developed a simulation program for truck-loader haulage systems in an underground mine. A limestone underground mine in Korea was selected as a study area and investigated to design the simulation algorithm for truck-loader haulage systems. GPSS/H simulation language was utilized to develop the simulation program. Simulations were conducted to analyze the optimal number of haulage trucks dispatched in the 540 ML loading point by using the developed program. The simulation results showed that 8 trucks can maximize the daily production (2,076 ton). The real production (1,850 ton/day) of limestone ores was very similar to the simulated one (1,850.35 ton/day) when considers 7 trucks dispatched in the 540 ML loading point. In addition, average waiting time at loader were similar (waiting time by time study : 1.39 min, simulated waiting time : 1.35 min).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.3
• /
• pp.147-155
• /
• 2016

Industry 4.0's goal is the 'Smart Factory' that integrates and controls production process, procurement, distribution and service based on the fundamental technology such as internet of the things, cyber physical system, sensor, etc. Basic requirement for successful promotion of this Industry 4.0 is the large supply of semiconductor. However, company I who produces dicing blades has difficulty to meet the increasing demand and has hard time to increase revenue because its raw material includes high price diamond, and requires very complex and sensitive process for production. Therefore, this study is focused on understanding the problems and presenting optimal plan to increase productivity of dicing blade manufacturing processes. We carried out a study as follows to accomplish the above purposes. First, previous researches were investigated. Second, the bottlenecks in manufacturing processes were identified using simulation tool (Arena 14.3). Third, we calculate investment amount according to added equipments purchase and perform economic analysis according to cost and sales increase. Finally, we derive optimum plan for productivity improvement and analyze its expected effect. To summarize these results as follows : First, daily average blade production volume can be increased two times from 60 ea. to 120 ea. by performing mixing job in the day before. Second, work flow can be smoother due to reduced waiting time if more machines are added to improve setting process. It was found that average waiting time of 23 minutes can be reduced to around 9 minutes from current process. Third, it was found through simulation that the whole processing line can compose smoother production line by performing mixing process in advance, and add setting and sintering machines. In the course of this study, it was found that adding more machines to reduce waiting time is not the best alternative.

• Journal of Korea Water Resources Association
• /
• v.47 no.5
• /
• pp.447-457
• /
• 2014

This research focuses on the changes of return period for nonstationary rainfall data in which exceedance or nonexceedance probability varies depending on time. We examined two definitions of return period under nonstationarity and also performed nonstationary frequency analysis using the nonstationary Gumbel model to investigate variations of return period in Korea. Seogwipo, Inje, Jecheon, Gumi, Mungyeong, and Geochang were selected as subject sites of application. These sites have a trend in rainfall data as well as having more than 30 years data. As the results of application, the return periods considering nonstationarity are different with those considering stationarity. The differences of return periods between nonstationarity and stationarity increase as growing return period increases. In addition, the return period using the expected waiting time method shows lower value than that using the expected number of event method.