• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.332-341
• /
• 1992

본 연구에서는 가동준비 비용과 시간의 특수구조를 갖는 다품종 제품군이 있을때의 생산일정계획을 고려하며, 제품군 가동준비에 있어서의 작업순서간 상호의존성에 따라 일정계획 문제를 분류하고, 그 문제들을 정형화시킨다. 특히, 하나의 제품군만이 생산되어지는 작업환경에 대하여 발견적 기법을 개발하여 이를 적용한 생산계획을 마련한다. 또한, 그 결과를 정수선형 계획에 의한 최적해와 비교.분석한다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.242-246
• /
• 1996

Accurate measurements of burr profile and burr size are very important for the automation of deburring. In this paper, a new burr measurement system using capacitance sensor is proposed. Ultra precision milling machine was used as a sensor positioning system. The possibility and limitation of employing a capacitance sensor to defect burrs are also investigated. The proposed system is proven to be relatively accurate, easy to setup and lower cost. This system will be applicable to a fully automated deburring system with minor modifications.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.35
• /
• pp.89-94
• /
• 1995

Previous MRP models were developed without considering learning effects on the determination of the production lot size environment. The only consideration was the setup and inventory holding costs. In this paper the proposed MRP model were developed incorporated the effects of learning. The result of this model show that learning significantly influence the production lot size and total variable cost. The numerical examples have been used to illustrated the impact of proposed model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.1
• /
• pp.29-41
• /
• 2006

As the quality and environmental problems become one of the most concerned issues of company, the rework policy needs to be efficiently designed and implemented to sustain the company's competitiveness. This paper examines three basic rework policies in multi-stage production systems and analyzes them in terms of costs of setup, production, inspection, and inventory. For analyzing the performance of the rework policies, we propose mathematical models which can compute total production cost and determine the optimal production batch size to minimize the total production cost. The rework policies are classified by the number and location of inspection stages. Using the mathematical models, we could analyze the performances of rework policies and suggest the optimal rework policy according to each manufacturing environment. The analyses show that the proposed model can be used to analytically evaluate and choose the rework policies.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.3
• /
• pp.197-204
• /
• 2004

This paper deals with a supply chain with a company and its contractor that produces products by the OEM contract with the company. The supply chain of interest has two distinct features. First, the company is the supplier of raw material required in the production at the contractor. Second, the company and its contractor make a delivery shipment arrangement that the replenishment lead time is determined depending on demand process. We show that the optimal inventory policy is monotonically changed as either the replenishment setup cost or inventory holding cost becomes increased or decreased. We also present asymptotic properties of the optimal inventory policy when either the number of outstanding customer orders or the inventory level becomes very large.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.4
• /
• pp.353-364
• /
• 2009

In this paper, a SLAM (Simultaneous Localization and Mapping) method using a single camera and planar fiducial markers is proposed. Fiducial markers are planar patterns that are mounted on the ceiling or wall. Each fiducial marker has a unique hi-tonal identification pattern with square outlines. It can be printed on paper to reduce cost or it can be painted using retro-reflective paint in order to make invisible and prevent undesirable visual effects. Existing localization methods using artificial landmarks have the disadvantage that landmark locations must be known a priori. In contrast, the proposed method can build a map and estimate robot location even if landmark locations are not known a priori. Hence, it reduces installation time and setup cost. The proposed method works good even when only one fiducial marker is seen at a scene. We perform computer simulation to evaluate proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.4
• /
• pp.398-405
• /
• 1997

This article presents a new model which is called Periodic Square-Wave(PSW) to describe the material flow of the periodic processes involving intermediate buffer. The material flows incoming into and outgoing from the intermediate buffer are assumed to be periodic square shaped. PSW model gives the same result as that of Economic Production Quantity(EPQ) model for determining optimal lot size of single stage batch storage system. However, for batch storage serial train system, PSW model gives a different optimal solution of about 6 % reduced total cost. PSW model provides the more accurate information on inventory and production system than the classical approach by maintaining simplicity and increasing computational burden.

• Management Science and Financial Engineering
• /
• v.11 no.1
• /
• pp.63-78
• /
• 2005

Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used or end-of-life products while satisfying the demand of their parts or components over a certain planning horizon. This paper considers the case of the assembly product structure for the cost-based objective of minimizing the sum of purchase, setup, inventory holding, and disassembly operation costs. To represent and solve the problem optimally, this paper presents an integer programming model, which is a reversed form of the multi-level lot sizing formulation. Computational experiments on an example derived from the literature and a number of randomly generated test problems are done and the results are reported.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.117-126
• /
• 2009

The recent interest in sensor networks has led to a number of routing schemes that use the limited resources available at sensor nodes more efficiently. These schemes typically try to find the minimum energy path to optimize energy usage at a node. Some schemes, however, are prone to unbalance of the traffic and energy. To solve this problem, we propose a novel solution: a gradient-field approach which takes account of the minimum cost data delivery, energy consumption balancing, and traffic equalization. We also modify the backoff-based cost field setup algorithm to establish our gradient-field based sensor network and give the algorithm. Simulation results show that the overhead of routing establishment obtained by our algorithm is much less than the one obtained by Flooding. What's more, our approach guarantees the basic Quality of Service (QoS) without extra spending.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2013

Most calls of a called user are invoked by the group of calling users. This call pattern is defined as call locality. Similarly Internet sessions including IP telephony calls have this pattern. We define it session locality. In this paper, we propose a caching scheme to support session locality in hierarchical SIP networks. The proposed scheme can be applied easily by adding only one filed to cache to a data structure of the SIP mobility agent. And this scheme can reduce signaling cost, database access cost and session setup delay to locate a called user. Moreover, it distributes the load on the home registrar to the SIP mobility agents. Our performance evaluation shows the proposed caching scheme outperforms the hierarchical SIP scheme when session to mobility ratio is high.