• IE interfaces
• /
• v.13 no.3
• /
• pp.358-377
• /
• 2000

A supply chain is a network of facilities and distribution options that performs the functions of procurement of materials, transformation of these materials into intermediate and finished products, and the distribution of these finished products to customers. SCM(Supp1y Chain Management), by definition, encompasses all activities associated with moving goods, from the raw materials stage through to the end user. It includes source and procurement, production scheduling, order processing, inventory management, transportation, warehousing, and customer service. Importantly, it encompasses the information systems used to monitor these activities. In this paper, the present situation and problems of marketing process in Korean agricultural environments were reviewed through a systematic methodology, and then we proposed a new business process for solving these problems by appling a supply chain management. We expect this supply chain management system applied to agricultural marketing process can improve significantly the rationality and transparency of Korean agricultural marketing structure.

• International conference on construction engineering and project management
• /
• 2011.02a
• /
• pp.201-208
• /
• 2011

Today's highly competitive construction scenario forces all the major players in the field to take up multiple projects which have put an undue pressure on the resources available within the organization. Under such a situation, there are many instances where in the resource requirement exceeds its availability due to multiple activities (with same resource requirement) which are scheduled to start simultaneously and thus results in the constrained resource becoming a bottleneck of the project. As a consequence of sharing resources, this paper studies the impact on the completion date of two similar projects under two different conditions, the first one resulting in a postponed end date and the second without any postponement. The resource utilization, the possibility of substitution of a resource and its subsequent impact on the deadline of the project is analyzed under these two circumstances. The study is done on a Critical Chain Project Management (CCPM) platform instead of leaving the schedule with a traditional Critical Path Method (CPM) finish, which gives an added advantage of validating the robustness of the emerging CCPM trend in the field of resource management.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.117-125
• /
• 2004

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship. determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible. while the operation cost of the terminal should be minimized. In this paper. I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.501-504
• /
• 2004

There is a world-wide trend to implement autonomous TM/TC system in satellite operations. KARI developed CALS(Command AutoLoader System) for KOMPSAT-1 operation automation in 2004. This paper provides system requirement, system design, system test and operational procedure. Through test with simulator and KOMPSAT-1, CALS was verified to meet all functional and operational requirement like scheduling, real-time telemetry check, CRC generation, command grouping. CALS is expected to be used in KOMPSAT-1 normal mission operation in end of 2004

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.917-922
• /
• 2004

As the tasks of robots become more diverse, some complicated tasks have come to require force and position hybrid control. A compliant device can be used to control force and position simultaneously by separating the twist of the robot's end effector from the twist of compliance and freedom by using stiffness mapping of the compliant device. The development of a fuzzy gain scheduling scheme of control for a robot with a compliant device is described in this paper. Fuzzy rules and reasoning are performed on-line to determine the gain of twists based on wrench error and twist error and twist of compliance and twist of freedom ratio. Simulation results demonstrate that better control performance can be achieved in comparison with constant gain control.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.04a
• /
• pp.323-328
• /
• 2004

Finish machining of a curved surface is often carried out by an NC system with curved interpolation in a high speed machining strategies. This study aims to develop the NURBS interpolator for the PC-NC based machine tools. In the case of a finish cut using a ball-end mill in high speed machining, low machinability at the bottom of a tool produces a harmful effect on surface roughness. The developed interpolator considers the relation between inclined angle, surface roughness, and feed rate, and adjusts real-time feed rate in order to generate surfaces which have isotropic surface roughness. The proposed interpolator is fully implemented and an experimental results are shown.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.371-374
• /
• 1997

This study presents a new type of real-t~me CNC interpolator that is capable of generating cutter paths for ball-end milling of NURBS surfaces. The proposed surface interpolator comprises real-time algorithms for cutter-contact (CC) path scheduling and CC path interpolation. Especially, in this study, a new interpolator module to regulate cutting forces is developed. This proposed algorithm utilizes variable-feedrate commands according to the curvature of machined surfaces. The proposed interpolator is evaluated and compared with the conventional method based on constant feedrates through computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1016-1022
• /
• 2003

The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm(AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.272-278
• /
• 2004

The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology. EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm (AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.