• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.143-147
• /
• 2006

Several regulations on converting reusable products are established in many countries, due to the emphasis on environmental issues on manufacturing. Many companies consider reusable and returned items in addition to purchasing new items. In this paper we suggest several algorithms to determine the near optimal quantities of items for converting and new items for purchasing. The reusable items are converted into end items, each facing normally distributed demand in a single period of interest. We develop a mathematical model and a genetic algorithm(GA) to compare the number of convertible units and new items to be purchased. Computational results demonstrate the efficiency of the developed algorithms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.40-43
• /
• 2000

This paper is concerned with development of an efficient Ρ-median approach applicable to large cell formation(CF) problems. A two-phase methodology that seeks to minimize the number of exceptional elements is proposed. In phase I, two efficient Ρ-median formulations which contain fewer binary variables than existing Ρ-median formulations are constructed. These make it possible to implement large CF problem within reasonable computer runtime with commercially available linear integer programming codes. Given the initial cell configuration found with the new p-median formulations, in phase II bottleneck machines and parts are reassigned to reduce the number of exceptional elements. This procedure has the flexibility to provide the cell designer with alternative solutions. Test results on large CF problems show a substantial efficiency of the new Ρ-median formulations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.464-464
• /
• 1991

We address the problem of designing a physical CATV network with switched-star topology in which the broadband interactive service is provided. There are two types of decision variables: One is where to place conduit paths, and the other is how many cable units to be installed on each link traversed by an established conduit path. Due to the serious drawback of the conventional approach partitioning the problem into two subproblems, the unified approach handled in one setting is used here to attack the whole problem without dividing into two ones. In this paper, we present a mathematical design model and propose an efficient solution method exploiting the nice structure of it. In addition to this physical design, some results on logical network configuration have also been made. Finally, computaional experiments are conducted to illustrate the efficiency of our design approach.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.426-433
• /
• 2002

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.501-504
• /
• 2004

Through the recent innovative development of information technology Enterprises have applied ERP(Enterprise Resource Planning)system to their company for piling up their management system efficiency. At present the range of its application has been expanded to small and medium enterprises gradually since the ERP system was mainly applied to the large companies. Usually the small and medium enterprises have lower understanding for information management system comparatively than for production system and mostly they do not prepare their own efficient information strategies for the future. In this study, as the ERP system can bring the most efficient results in case it is properly applied to the character of their company we will analyze the character of small and medium enterprises and suggest an appropriate and efficient ERP application strategy to their management system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.2
• /
• pp.39-44
• /
• 2015

Restricted Access Window (RAW) has been designed to improve power saving efficiency by reducing collisions of contending stations in the IEEE 802.11ah Wireless Local Area Networks (WLANs). We conduct simulations in order to observe the stations' operations influencing the lengths of the Restricted Access Window (RAW). From the observation, we consider how to adjust the stations' operations for proper RAW managements.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.464-468
• /
• 2007

In cognitive radio systems, secondary users, unlicensed users, can use primary users' spectrum to increase spectrum efficiency. At that time, the systems must satisfy primary users' QoS. When secondary users use cognitive radio systems, secondary users communication can be terminated, because of satisfying primary users' QoS. However, secondary users' communication terminating is not good for both secondary users and whole systems. So, cognitive radio systems need an efficient algorithm for secondary users of admission control and keeping connections. In this paper, we present an algorithm which consist of two part, admission control and connections control.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.1
• /
• pp.34-44
• /
• 1987

The general vehicle routing problem has been studied by many researchers such as Christofides, et al. and Laporte, et al., but only limited effort has been devoted to developing the optimal algorithms. The purpose of this paper is to develop a branch and bound algorithm which determines the optimal vechicle routes and the optimal number of vehicles concurrenetly for the asymmetrical vehicle routing problem. In order to enhance the efficiency, this algorithm emphasizes the followings ; First, an efficient primal-dual approach is developed to solve subproblems which are called the specialized transportation problem, formed by relaxing the illegal subtour constraints from the vehicle routing problem, second, an improved branching scheme is developed to reduce the number of candidate subproblems by adequate utilization of vehicle capacity restrictions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.2
• /
• pp.42-50
• /
• 1987

This objective of this paper is to develop an efficient method with small memory requirement for a feed-mixing problem on a micro computer. First this method uses the decomposition principle to reduce the memory requirement. Next, the decomposition principle is modified to fit the problem. Further four different variations in solving subproblems are designed in order to improve efficiency of the principle. According to the test with respect to the processing time, the best variation is such that the dual simplex method is used, and the optimal basis of a previous subproblem is used as an initial basis, and the master problem is (M +1) dimensional. In general, the convergence of solution becomes slower near the optimal value. This paper introduces a termination criterion for a sufficiently good solution. According to the test, 5%-tolerence is acceptable with respect to the relation between the processing time and optimal value.

• Journal of the military operations research society of Korea
• /
• v.35 no.1
• /
• pp.51-62
• /
• 2009

In this study, the establishment strategies introduced here are based on the applicable PLM system to Defence Configuration Management. These are applied to enlargement area advanced nations and commercial fields already. Additional1y, the study analyze the problem of current Defence Configuration Management and the establishment strategies improving Defence Configuration Management by adapting PLM system to increase efficiency.