• Journal of Industrial Convergence
• /
• v.16 no.1
• /
• pp.21-26
• /
• 2018

The Seaborne Trade Volume accounts for 97% of the total. This means that the port operation management system can improve port efficiency, reducing operating costs, and the manager who manages all operations at the port needs to check and respond quickly when delays of work and equipment support is needed. Based on the real-time location information confirmation of yard automation equipment used the existing system GPS, the real-time location information confirmation system is a GPS system of the tablet, rather than a port operation system that monitors location information for the entered information, depending on the completion of the task or the start of the task. Network configurations also reduce container processing delays by using commercial LTE services that do not have shading due to containers in the yard also reduce container processing delays. Trough introduction of smart devices using Android or IOS and container processing scheduling utilizing artificial intelligence, we will build a minimum delay system with Smart Device usage of container processing applications and optimization of container processing schedule. The adoption of smart devices and the minimization of container processing delays utilizing artificial intelligence are expected to improve the quality of port services by confirming the processing containers in real time to consumers who are container information demanders.

• Journal of Korean Society for Quality Management
• /
• v.41 no.1
• /
• pp.149-162
• /
• 2013

Purpose: The purpose of this study was to design of a probabilistic model for optimum manpower planning in R&D department by Montecarlo simulation. Methods: We investigate the process and the requirement of manpower planning and scheduling in R&D department. The empirical distributions of necessary time and manpower for R&D projects are developed. From the empirical distributions, we can estimate a probability distribution of optimum manpower in R&D department. A simulation method of estimating the probability distribution of optimum manpower is considered. It is a useful tool for obtaining the sum, the variance and other statistics of the distributions. Results: The real industry cases are given and the properties of the model are investigated by Montecarlo Simulation. we apply the model to the research laboratory of the global company, and investigate and compensate the weak points of the model. Conclusion: The proposed model provides various and correct information such as average, variance, percentile, minimum, maximum and so on. A decision maker of a company can easily develop the future plan and the task of researchers may be allocated properly. we expect that the productivity can be improved by this study. The results of this study can be also applied to other areas including shipbuilding, construction, and consulting areas.

• Journal of Digital Contents Society
• /
• v.10 no.1
• /
• pp.169-175
• /
• 2009

Grid computing is an application to obtain the most efficient performance from computing resources in terms of cost and convenience. It is also considered as a good method to solve a problem that cannot be settled by conventional computing technologies such as clustering or is requiring supercomputing capability due to its complex and long-running task. In order to run grid computing effectively, it needs to connect high-performance computing resources in real-time which are distributed geographically. Answering to the needs of this grid application, researchers in several universities with Argonne National Laboratory in the USA (ANL) as the main axis have developed Globus. It is noticed, however, that the quality of service (QoS) is not guaranteed when certain jobs are exchanged through networks in the context of Globus. To tackle with this problem, the ANL has invented Globus Architecture for Reservation and Allocation (GARA). The researchers of this paper constructed a testbed for evaluating the ability to reserve resource in the GARA system and implemented the GARA code for it. We analyzed the applied results and discussed future research plans.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.38-45
• /
• 2012

Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.103-103
• /
• 2000

In this paper to cope with the reduction of products life-cycle as the variety of products along with the various demands of consumers, a virtual simulator is developed to make the changeover of manufacturing line efficient to embody a virtual simulation similar to a real manufacturing line. The developed virtual simulator can design a layout of a factory and make the time scheduling. Every factory has one simulator so that one product can be manufactured in the factories to use them as virtual factories. We suggest a scheme that heightens the agility to the diversity of manufacturing models by making the information of manufacturing lines and products models to be shared. The developed unit simulator can construct a proper virtual manufacturing line along with the required process of products using several kinds of operator and work cell. A user with the simulator can utilize an interface that makes one to manage the separate task process for each manu(acturing module, change operator components and work cells, and easily teach tasks of each task module. The developed simulator was made for users convenience by Microsoft Visual C++ 6.0 that can develop a program supplying graphic user interface environment and by OpenGL of the Silicon Graphics as a graphic library to embody 3D graphic environment. Also, we show that the simulator can be used efficiently for the agile manufacturing by the communication among the factories being linked by TCP/IP and a hybrid database system made by a hierarchical model and a relational model being developed to standardize the data information.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.77-85
• /
• 2009

Execution times of tasks can be variable depend on input data. If we choose a high performance processor to satisfy the worst case execution times, the hard cost becomes high and the energy consumption also becomes large. To apply a lower performance processor, we have to utilize processor capacity maximally while overrunning tasks can not affect deadlines of other tasks. To be used for such systems, this paper presents SBP (Shared Bandwidth Partitioning) that a processor bandwidth is reserved and shared among all tasks. If a task needs more processor capacity, it can use a portion of the shared bandwidth. A simulation result shows that SBP provides better performance than previous algorithms. SBP reduces deadline miss ratio which is related to scheduling quality. And the number of context switches, which is related to system overhead, is also reduced.