Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korean Institute of Industrial Engineers
Journal Basic Information
Journal DOI :
Korean Institute of Industrial Engineers
Editor in Chief :
Volume & Issues
Volume 20, Issue 4 - Dec 1994
Volume 20, Issue 3 - Sep 1994
Volume 20, Issue 2 - Jun 1994
Volume 20, Issue 1 - Mar 1994
Selecting the target year
An EMQ Model in An Unreliable Machine
Kim, Chang-Hyun ; Hong, Yu-Shin ; Kim, Soo-Young ;
Journal of Korean Institute of Industrial Engineers, volume 20, issue 2, 1994, Pages 3~17
This paper presents an EMQ model which determines an optimal manufacturing lot size in an unreliable machine. The machine has an exponentially distributed life time, and requires a constant time to repair when it fails. We 1) derive an average cost function, 2) obtain an optimal lot size and show that it is unique, 3) carry out sensitivity analysis to examine the effect of machine parameters (life time, time to repair) to optimal lot size.
Concurrent Methodology for Part Selection, Loading, and Routing Mix problems in Flexible Manufacturing System
Ro, In-Kyu ; Jung, Dae-Young ;
Journal of Korean Institute of Industrial Engineers, volume 20, issue 2, 1994, Pages 19~30
Generally, a planning problem in a flexible manufacturing system is considered to be a composite of three interdependent tasks : part selection, loading, and routing mix. This research presents a mathematical model which can concurrently solve part selection, loading, and routing mix problems, so the problems that are caused by treating the planning problems independently are solved. The mathematical model is aimed to minimize system unbalance and the number of late parts, including constraints such as machine capacity, tool magazine capacity, and tool inventory. To illustrate the application of the model, an example is included. Solution procedure based on Lagrangian relaxation is also suggested for larger-sized problems.
A Heuristic for Scheduling Production of Components at a Single Facility
Gim, Bong-Jin ;
Journal of Korean Institute of Industrial Engineers, volume 20, issue 2, 1994, Pages 31~38
We consider a single-machine scheduling problem dealing with the manufacture of components for subsequent assembly into end products. Each product requires both unique components and common components, and each production requires a setup. By making some assumptions on the data and the availability of the components for assembly, Baker provides on efficient dynamic programming algorithm for obtaining the optimal schedule. In this paper we do not impose any requirement on the data, and we solve the more complicated batching and sequencing problem. We suggest a simple heuristic method that is efficient and finds solutions that are optimal or close to the optimal solution.
Performance Analysis of Unit-load AS/R Systems
Kim, Nam-Ha ; Rim, Suk-Chul ; Hong, Suk-Kyo ; Lee, Soo-Hoon ; Hong, Man-Pyo ;
Journal of Korean Institute of Industrial Engineers, volume 20, issue 2, 1994, Pages 39~50
Most research results on the throughput of unit-load automated storage retrieval (AS/R) systems assume the randomized storage; that is, all slots In the entire rack are equally likely to be selected for the storage location. However, for the most existing AS/R systems which use Closest Open location storage policy, Park mathematically showed that this assumption results in a significant difference from the actual performance of AS/R systems. In this study, we present more details about the performance of the unit-load AS/R systems by considering the rack utilization and rack density; and examine their impact on the throughput of AS/R systems by using computer simulation. A new storage policy named Shortest Cycle Location(SCL) is proposed. Simulation results indicate that the performance of SCL policy consistently outperforms the Closest Open location storage policy. We also define the "Extra-Cost Zone" compared to the "No-Cost Zone" and explore its geometric and practical meaning.
Cell Formation Algorithm for the Maximum Number of Cell without Exceptional Element in FMS with Alternative Routings
Lee, Young-Kwang ; Yun, Chang-Won ; Chung, Byung-Hee ;
Journal of Korean Institute of Industrial Engineers, volume 20, issue 2, 1994, Pages 51~64
Cellular manufacturing requires formation of machine cells that can produce families of parts with similar processing requirement. The purpose of cell formation is to create separable machine clusters and part families simultaneously. However, the cell formation process often includes the identification of exceptional elements. This paper presents cell formation method under consideration of alternative routings in FMS which consists of machines capable of multi-processing and parts which require more than one operation. We suggest theorems to calculate the maximum number of machine cell and part family which have no exceptional elements. We also develop a cell formation algorithm which is based on the suggested theorem. A numerical example is provided to illustrate the proposed theorem and algorithm.
FLASOM - Facility Layout by a Self-Organizing Map
Lee, Moon-Kyu ;
Journal of Korean Institute of Industrial Engineers, volume 20, issue 2, 1994, Pages 65~76
The most effective computer algorithms for facility layout that have been found are mainly based on the improvement heuristic such as CRAFT. In this paper, we present a new algorithm which is based on the Kohonen neual network. The algorithm firstly forms a self-organizing feature map where the most important similarity relationships among the facilities are converted into their spatial relationships. A layout is then obtained by a minor adjustment to the map. Some simulation results are given to show the performance of the algorithm.
Construction of curve-net interpolation surface considering trajectory of cross-section curves
Yoo, Woo-Sik ; Shin, Ha-Yong ; Choi, Byoung-K. ;
Journal of Korean Institute of Industrial Engineers, volume 20, issue 2, 1994, Pages 77~90
Curve-net interpolation surface is one of the most popular method in engineering design. Therefore it is supported with many commercial CAD/CAM system. However, construction algorithm of curve-net interpolation surfaces is rarely opened to the public because of its copy-right. In this paper we establish a construction algorithm of curve-net interpolation surface so called sweeping surface which especially concentrates on trajectory of cross-section curve. We also show the method which can construct sweeping surfaces as NURB or Bezier mathematical models. Surfaces having the form of standard mathematical models are very useful for the application of joining, trimming, blending etc. The proposed surface interpolation scheme consists of four steps; (1) preparation of guide curves and section curves, (2) remeshing guide curves and section curves, (3) blending section curves after deformation, and (4) determination of control points for sweeping surface using gordon method. The proposed method guarantee
-continuety, and construct the surface salifying given section curves and trajectory of section curves.