• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.2
• /
• pp.77-87
• /
• 1986

This paper presents a heuristic method for solving the discrete-time ordering problem with quantity discounts and deterministic, time-varying demand. This algorithm utilizes a variation of the incremental cost approach(ICA) to determine a near optimal solution. The ICA is the method which reduces the total cost with reduction of the number of orders by one. In order to reduce the number of orders, if the incremental cost for one of the periods is negative, the demand of the period should be purchased in its immediate preceding period. In order to test the performance of this algorithm, an experiment is conducted that involves a large number of test problems covering a wide variety of situations. The result of the experiment shows that the proposed algorithm has 80.5% better solutions than the adjusted part period algorithm(APPA), which is known to be the best heuristic method.

• Industrial Engineering and Management Systems
• /
• v.16 no.1
• /
• pp.44-51
• /
• 2017

In today's competitive environment, supply chain management is a major concern for a company. Two of the key issues in supply chain management are transportation and inventory management. To achieve significant savings, companies should integrate these two issues instead of treating them separately. In this paper we develop a framework for modeling stochastic programming in a supply chain that is subject to demand uncertainty. With reasonable assumptions, two stochastic programming models are presented, respectively, including a single-period and a multi-period situations. Our assumptions allow us to capture the stochastic nature of the problem and translate it into a deterministic model. And then, based on the genetic algorithm and stochastic simulation, a solution method is developed to solve the model. Finally, the computational results are provided to demonstrate the effectiveness of our model and algorithm.

• Industrial Engineering and Management Systems
• /
• v.7 no.3
• /
• pp.204-213
• /
• 2008

Companies that produce capital goods need to schedule the production of products that have complex product structures with components that require many operations on different machines. A feasible schedule must satisfy operation and assembly precedence constraints. It is also important to avoid deadlock situations. In this paper a Genetic Algorithm (GA) has been developed that includes a new repair process that rectifies infeasible schedules that are produced during the evolution process. The algorithm was designed to minimise the combination of earliness and tardiness penalties and took into account finite capacity constraints. Three different sized problems were obtained from a collaborating capital goods company. A design of experimental approach was used to systematically identify that the best genetic operators and GA parameters for each size of problem.

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.141-157
• /
• 2007

In this paper, we address a design problem and a case study of a K-stage back-light-unit(BLU) inspection system, which is composed of K stages, each of which includes an inspection process and a rework process. Assuming the type I, II errors and the inspection-free policy for items classified as good, we determine the smallest integer of K which can achieve a given target defective rate. If K does not exist, holding the current values of the type I, II errors, we search reversely the defective rate of an assembly line and the defective rate of a rework process, to meet the target defective rate. Our formulae and methodology based on a K-stage inspection system could be applied and extended to similar situations with slight modification.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.1 no.1
• /
• pp.66-82
• /
• 1998

The hydrodynamic characteristics of oil skimmers are reviewed. The paper consists of (1) introduction of the general aspects of oil skimmers, including kinds, performance indices, current market situations, (2) the analysis of factors affecting oil- skimming, (3) the review of existing papers with a special focus on hydrodynamic problem and finally (4) conclusions and some suggestions. The purpose of this paper is to draw hydrodynamists' attentions on oil skimmer, more broadly on marine oil spill.

• Journal of Multimedia Information System
• /
• v.3 no.3
• /
• pp.77-84
• /
• 2016

The sailors on seagoing ships experience much difficulty in communicating with their families, friends or associates ashore due to communication cost or technical difficulties so that they are sometimes unable to adapt to the rapid social changes promptly. This is mainly the result of an insufficient Information and Communication Technology (ICT)-environment on their ships. To surmount such a problem, an electronic shipboard voting system that guarantees the publicness and absolute secrecy in voting process has been proposed in this paper. The system not only helps crews to catch up with up-to-date news and provides them a feeling that they are being connected to the everyday lives of the outside world, but also allows them to cast their votes based on the newly acquired information (e.g., current political or economic situations in their respective regions and etc.).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.14-30
• /
• 1985

Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools with satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design as interactive software package for microcomputers based on this method. From some computational experiences, we can state that the revised iterative goal simplex method using the sparsity technique is the most efficient one for microcomputer for solving goal programming problems.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.11-23
• /
• 1998

In very large databases, the problem of searching for interesting information effectively is very important in terms of efficiency and flexibility. A multiple layered database approach based on AOG(attribute-oriented generalization) method is one of the useful approaches for knowledge discovery under various situations. In this paper, we propose a multiple layered database design methodology based on AOG method in object-oriented databases. In addition, we propose a dynamic schema evolution model and implementation strategy in order to continue providing information effectively in multiple layered databases.

• International Commerce and Information Review
• /
• v.12 no.3
• /
• pp.197-221
• /
• 2010

China has experienced repid economic growth since it opened its economic market. Apparently, China tends to follow the worldwide trends and it plans to play a leading role in the world. As China has become a global manufacturing center as well as a manufacturing powerhouse with its high economic growth rate, China's logistics industry has entered a stage of fast growth and the demand of logistics infrastructure and third party logistics service are increasing rapidly. This study is to present some efficient entering strategies of Korean logistics firms in China by examining the current situations of logistics industry in China and some business strategies of international logistics firms in China. From the research which sees consequently investigated a various policy, a system and a law about chinese logistics industry and present condition of the Chinese goods enterprise and instance analysis of the large Chinese corporation that branch out to undeveloped markets led and a Chinese logistics industry and problem point escape hereafter the heightening of competitiveness plan which is rational under presenting boil.

• Aerospace Engineering and Technology
• /
• v.8 no.1
• /
• pp.108-116
• /
• 2009

This paper considers the trajectory design problem for a lunar orbiter when launched by KSLV-II. KSLV-II puts its kick motor stage and lunar orbiter into a low earth orbit, and then the kick motor stage performed the translunar injection. To simulate more realistic situations, TLI (Trans-Lunar Injection) and LOI (Lunar Orbit Injection) maneuvers are modeled as finite burns. The feasibility of the lunar mission by KSLV-II are confirmed by the numerical results that show the reasonable required-velocity and propellant usage.