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 25, Issue 4 - Dec 1999
Volume 25, Issue 3 - Sep 1999
Volume 25, Issue 2 - Jun 1999
Volume 25, Issue 1 - Mar 1999
Selecting the target year
Development of ICPL for Heterarchical SFCS
Kwon, Sung-Pil ; Cho, Hyun-Bo ; Jung, Moo-Young ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 150~161
This paper deals with the design and development of a real-time integrated communication architecture for heterarchical SFCS(Shop Floor Control System). In autonomous agent-based heterarchical SFCS, each functional unit of parts and resources is equipped with an intelligent controller (agent) that acts as the representative of the entity. The controllers communicate and negotiate with other controllers on a real-time basis through message passing and bidding protocol to achieve mutual agreements for task sharing. ICPL(Integrated Communication Protocol and Language) is proposed for this purpose. ICPL is a language and a protocol for supporting communication among intelligent controllers. Based on the speech act theory, this paper proposes a semantic description for ICPL that associates the description of the cognitive states of controllers with the use of language primitives (message_type). Semantics for the basic set of ICPL messages is described. Eventually, an ICPL-based communication architecture can provide the implementation of the distributed and heterarchical SFCS, and makes the intelligent controller transparent to the negotiation problem.
An Approximate Analysis of Cell Loss Probability of ATM Multiplexer with Homogeneous MPEG Video Sources
Lee, Sang-Cheon ; Hong, Jung-Sik ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 162~172
For VBR video traffic, Motion-Picture Experts Group(MPEG) coding algorithm was adopted as the standard coding algorithm by International Telecommunication Union(ITU). In this paper, we propose a traffic model of an MPEG coded video traffic in frame level and cell level, and develop an approximate model for evaluating performance of a ATM multiplexer with homogeneous MPEG video sources by considering burst-level variation of aggregated traffics. For homogeneous MPEG video traffics which are frame-synchronized, the performance of the ATM multiplexer is influenced by source correlation at the multiplexing time. When sources are highly correlated, we decompose the aggregated cell streams by the frame-type and model multiplexing process during a frame time as n*D/D/1/K queueing model and suggest an approximate method for obtaining CLP of the ATM multiplexer. In the case that sources are highly correlated, the solution has the meaning of the upper bounds of performance of the ATM multiplexer. For the verification of our model, we compare the solution of our model with simulation resets. As the number of sources increases. The CLP obtained from our model approaches to simulation results, and gives upper bounds of simulation results.
An Investigation of Relational Characteristics among the Design Elements of Automobile Seat Packaging with a Triangular Method
Jung, Eui-S. ; Lee, Jugn-K. ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 173~183
The three design elements of automobile occupant packaging such as pedals, steering wheel, and seat are the most important factors to design an ergonomically sound layout for improving driving comfort and performance. The aim of the study is to find out coherent characteristics of the relationships among three design elements. For this purpose, Triangular Method is suggested. We extracted properties for determining the shape, size, and location of the triangle that is composed of Accelerated Heel Point, Steering Wheel Point, and Hip Point. An experiment was conducted at a seating buck in which the design elements are freely adjustable by the subject to investigate driver's preferred arrangement of three elements. Statistical analyses revealed that there was a subtle change in the shape of triangle according to different percentiles and that the significant difference was observed only for the size of the triangle. The results will be effectively applied to design a comfortable seat packaging layout.
A Method for Determining All the k Most Vital Arcs in the Maximum Flow Problem by Ranking of Cardinality Cuts
Ahn, Jae-Geun ; Chung, Ho-Yeon ; Park, Soon-Dal ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 184~191
The k most vital arcs (k-MVA) of a maximum flow problem is defined as those k arcs whose simultaneous removal from the network causes the greatest decrease in the throughput capability of the remaining system between a specified pair of nodes. In this study, we present a method for determining all the k-MVA in maximum flow problem using a minimal cardinality cut algorithm and k-th minimal cut ranking algorithm. For ranking cardinality cuts, we use Hamacher's ranking algorithm for cut capacity and by comparing present residual capacity of cardinality cut with expected residual capacity of next cardinality cut, we also present termination condition for this algorithm. While the previous methods cannot find all the alternatives for this problem, a method presented here has advantage of determining all the k-MVA.
A Study on the Order Release Method in Job Shop
Choi, Ki-Beom ; Kim, Sung-Shick ; Lee, Hong-Chul ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 192~203
This paper deals with the order release problem for minimizing weighted earliness and tardiness as well as Work In Process (WIP) in dynamic job shop environments. A newly designed hierarchical order release mechanism is developed for efficient real-time control of the earliness/tardiness and WIP. The hierarchical order release mechanism consists of the order release plan and the order release control which is composed of two procedures. The experimental results show that the proposed order release mechanism is superior to other four order release mechanisms under overall simulation conditions of utilization rate, due-date allowances, and earliness/tardiness cost structures. In addition, the difference of total cost among the four dispatching rules is much more reduced in the proposed order release mechanism than in other release mechanisms.
An Approach of Combining Failure Physics and Lifetime Analysis for Product Reliability Improvement: An Application to BGA(Ball Grid Array) Package
Lee, K.T. ; Shin, C.H. ; Hahn, H.S. ; Evans, J.W. ; Kim, S.W. ; Lee, H.J. ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 204~216
Failure physics and statistical lifetime analysis constitute the two extreme ends of the reliability engineering spectrum, and studies that relate failure mechanisms to failure distributions have been near non-existent. This paper is an attempt to stimulate interest to fill the gap between the two extremes and proposes an approach of combining them through i) developing a failure mechanism model, ii) generating failure times by Monte Carlo simulation with the model, iii) deriving the failure time distribution and evaluating the product reliability, and iv) improving the product reliability by the sensitivity analysis. An application of the proposed approach to the BGA(Ball Grid Array) surface mount package is also provided.
An Implementation of Preprocessing for the Simplex Method
Lim, Sung-Mook ; Seong, Myeong-Ki ; Park, Soon-Dal ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 217~225
Preprocessing is the essential technique in the implementation of the simplex method for large scale linear programming problems. In this research, we explained the effect of preprocessing in the simplex method, classified the techniques into four categories, and compared our results with those of HOPDM, CPLEX and Soplex by computational experiments. We also noted some implementing issues of preprocessing for the simplex method and the recovery of the optimal basis of the original problem from that of the preprocessed problem.
A Simulated Annealing Method with Search Space Smoothing for T-Coloring Problem
Lee, Jung-Eun ; Han, Chi-Geun ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 226~232
Graph Coloring Problem(GCP) is a problem of assigning different colors to nodes which are connected by an edge. An extended form of GCP is TCP (T-coloring problem) and, in TCP, edge weights are added to GCP and it is possible to extend GCP's applications. To solve TCP, in this paper, we propose an improved Simulated Annealing(SA) method with search space smoothing. It has been observed that the improved SA method obtains better results than SA does.
A Scheduling of Switch Ports for IP Forwarding
Lee, Chae-Y. ; Lee, Wang-Hwan ; Cho, Hee-K. ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 233~239
With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.
Performance Analysis for Closed-Loop Production Systems with Unreliable Machines and Random Processing Times
Kim, H.G. ; Paik, C.H. ; Cho, H.S. ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 240~253
In this paper we propose new approximate methods for the performance analysis of closed-loop production systems with unreliable machines and random processing times. Each approximate method decomposes the production system consisting of K machines into a set of K subsystems, each subsystem consisting of two machines separated by a finite buffer. Then, each subsystem is analyzed by three different analyzing methods in isolation. The population constraint of the closed-loop production system is taken into account by prescribing that the sum of average buffer levels in the subsystems is equal to the number of customers in the closed-loop production system. We establish a set of equations that characterize unknown parameters of the servers in the subsystems. An iterative procedure is then used to determine the unknown parameters. Experimental results show that these methods provide a good estimation of the throughput.
Scheduling Heuristics for a Two-Stage Hybrid Flowshop with Nonidentical Parallel Machines
Lee, Ji-Soo ; Park, Soon-Hyuk ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 254~265
We consider two stage hybrid flowshop scheduling problem when there are two non-identical parallel machines at the first stage, and only one machine at the second stage. Several well-known sequence-first allocate-second heuristics are considered first. We then propose an allocate-first sequence-second heuristic to find minimum makespan schedule. The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated by comparing with easily computable lower bound. The proposed heuristic algorithm as well as the existing heuristics are evaluated by simulation in four cases which have different processing time distribution, and it is found that the proposed algorithm is more effective in every case.
Measurement of Shoulder Muscle Workload at Various Working Postures
Kim, Jung-Yong ; Park, Ji-Soo ; Park, Chang-Soon ; Phyun, Heung-Kook ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 266~273
The maximum work capacity at various shoulder angles was estimated in terms of joint moment through maximum voluntary contraction (MVC) measurement, and the result was compared to workload computed from 3-D static lifting model (3DSSPP) based upon national institute of safety and health (NIOSH) lifting guideline (1991). The electromyography (EMG) of anterior/posterior deltoid and trapezius muscle was also recorded to study the function of individual muscle during asymmetric shoulder lifting. Psychophysical workload was measured to observe the difference from MVC or biomechanical estimation. An apparatus was constructed for the study and twenty five trials including five flexion angles and five add/abduction angles were performed isometrically. Results indicated that MVC at 30 degree of flexion was the strongest whereas MVC at 120 degree was the weakest. In case of add/abduction, MVC decreased to 77 to 89 % during add/abduction compared to the MVC at neutral position. Regarding the normalized EMG value, a substantial increase was observed at 30 and 60 degree abduction. More importantly, the shoulder moment computed from maximum permissible limit (MPL) was greater than the moment at MVC condition during 30 degree adduction. Current result can be used as a reference information for a safe workplace design to prevent the shoulder from an excessive work load in industry.
Optimal Storage Capacity under Random Storage Assignment and Class-based Assignment Storage Policies
Lee, Moon-Kyu ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 274~281
In this paper, we determine the required storage capacity of a unit-load automated storage/retrieval system(AS/RS) under random storage assignment(RAN) and n-class turnover-based storage assignment(CN) policies. For each of the storage policies, an analytic model to determine the optimal storage capacity of the AS/RS is formulated so that the total cost related to storage space and space shortage is minimized while satisfying a desired service level. A closed form of optimal solutions for the RAN policy is derived from the model. For the CN policy, an optimal storage capacity is shown to be determined by applying the existing iterative search algorithm developed for the full turnover-based storage(FULL) policy. Finally, an application of the approach to the standard economic-order-quantity inventory model is provided.
Imprementation of Real Time HILS System for Ground Test of Underwater Vehicle
Park, Yeong-Il ; Choi, Young-Chul ; Cho, Kyu-Kab ; Lee, Man-Hyung ;
Journal of Korean Institute of Industrial Engineers, volume 25, issue 2, 1999, Pages 282~289
To minimize a real world test of underwater guided vehicle, it is necessary to perform a test on ground by using closed loop test techniques. This paper describes implementation of HILS(Hardware In the Loop Simulation) system for ground test and test methodologies for performance evaluation of a guided weapon. HILS system uses a real time distributed computer and a real time processing technique. Ground test results of underwater vehicle are presented for moving and stationary targets by using HILS system.