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 22, Issue 4 - Dec 1996
Volume 22, Issue 3 - Sep 1996
Volume 22, Issue 2 - Jun 1996
Volume 22, Issue 1 - Mar 1996
Selecting the target year
A Study on the Decision Policy for the Waiting Position of an Idle Automated Guided Vehicle
Song, Sung-Hun ; Choi, Hyung-Joo ; Cho, Myeon-Sig ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 313~324
A new policy to determine the waiting position of an idle Automated Guided Vehicle(AGV) is proposed and its performance is compared with the existing waiting position policies. Unlike the existing policies, the queue length in the input buffer is considered in the new policy. As a result, the waiting position based on the new policy depends on the status of the system. The simulation result indicates that the proposed policy reduces the waiting time in both the input and the output buffers significantly, regardless of the number of AGVs in the system. Therefore, the manufacturing lead time can be minimized.
A Heuristic for the Vehicle Routing Problem
Ro, In-Kyu ; Ye, Sung-Young ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 325~336
This study is concerned with developing a heuristic for the vehicle routing problem(VRP) which determines each vehicle route in order to minimize the transportation costs, subject to meeting the demands of all delivery points. VRP is known 10 be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristic are more frequently developed than optimal algorithms. This study aims to develop a heuristic which can give a good solution in comparatively brief time. Finally, the computational tests were performed using the benchmark problems and the proposed heuristic is compared with the other existing algorithms. The result of computational tests shows that the proposed heuristic gives good solutions, in much shorter time, which are not 1% more expensive than the best known solutions, which are same as the best known solutions in the previous researches.
Floor Slipperiness Effect on the Biomechanical Study of Slips and Falls
Myung, Ro-Hae ; Smith, James L. ; Lee, Soon-Yo ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 337~349
A study was conducted to find the possible relationship between slip distance and dynamic coefficient of friction (DCOF) through the biomechanical study of slips and falls using a broader variety of floors and levels of slipperiness than those used before. Four different floor surfaces covering the full range of floor slipperiness (with and without on oil contaminant) were prepared for ten subjects with each walking at a fixed velocity. The results showed that slip distance and heel velocity had a decreasing trend while stride length had a increasing trend as DCOF increased. The contaminant effect overpowered floor slipperiness effect because a higher DCOF surface with oil contaminant created longer slip distance than the lower DCOF with dry floor. Normal gait pattern and suggested heel velocity (10 to 20 cm/sec) were seen on dry floors but abnormally longer stride length and 5 to 10 times faster heel velocity were found an oily floors. In other words, faster heel velocity (greater than 10 to 20 cm/sec) is recommended to measure DCOF on oily floors because the assumption of normal gait was no longer valid.
An Optimal Production Run Length in A Deteriorating Machine
Kim, Chang-Hyun ; Hong, Yu-Shin ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 351~364
This paper presents on EMQ model which determines an optimal production run length in a deteriorating machine. It is assumed that a machine is subject to a random deterioration from an in-control state to an out-of-control state with on arbitrary distribution and thus producing some proportion of defective items. An optimal production run length and a minimum average cost are derived in each of three deteriorating processes; constant, linearly increasing, and exponentially increasing. The model with repair cost is also analyzed. Several mistakes in previous research are found and discussed. Numerical experiments are carried out to see the behavior of the proposed model depending on the cost factors as well as machine parameters, and some interesting behaviors are observed.
A Fast Algorithm for an Extension of the Multiple Choice Linear Knapsack Problem
Won, Joong-Yeon ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 365~375
We consider an extension of the multiple choice linear knapsack problem and develop a fast algorithm of order
by exploiting some new properties, where
is the largest multiple choice number and n is the total number of variables. The proposed algorithm has convenient structures for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.
An Approximate Analysis of the Fork-Join Queue
Yang, W.S. ; Chae, K.C. ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 377~385
We present an approximate algorithmic approach for the m-server fork-join queueing system with infinite queue capacity. We analyze the system size and queue waiting time. We assume Poisson arrival process and independent exponential service times.
Performance Analysis of the MPEG Video Multiplexer Considering Traffic Periodicity in Frame Level
Kang, Jin-Kyu ; Lie, Chang-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 387~398
In this study the cell arrival processes from pre-buffer into multiplexer for MPEG(Motion Picture Experts Group) coding video sources are analyzed with consideration of the traffic periodicity in frame level. The analysis is performed by introducing the two arrival models, that is, periodic on/off source model and periodic uniform arrival model. Modulated
/D/1 queueing system is utilized in periodic on/off source model, while
/D/1 queueing system is used in periodic uniform arrival model. The presented models are validated by comparing with computer simulations. Numerical results for periodic uniform arrival model are shown to be very accurate, but those of periodic on/off source model are shown to be inaccurate as the number of sources are increased.
The Effects of Types of Knowledge on the Performance of Fault Diagnosis
Ham, Dong-Han ; Yoon, Wan-Chul ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 399~412
With respect to the effects of types of knowledge on human diagnostic performance, the results of several experiments claimed that training with procedural knowledge is more effective than training with principle knowledge. However, more useful results would be attained by investigating when and how the principles of system dynamics is valuable for diagnosis. Accordingly, we conducted an experiment to reevaluate the value of principle knowledge in two problem situations. A simulator system, named DLD, to diagnose an electronic device was created. It is a context-free digital logic circuit which includes forty-one gates of three basic types. The experiment investigated the effects of principle knowledge over common procedural knowledge. The experimental results showed that the effects of principle knowledge is dependent on the complexity of diagnostic situations. This adds up on experimental evidence against the presumed ineffectiveness of principle knowledge and forward reasoning in fault diagnosis. The results also suggest the source of the usefulness of principle knowledge.
Analysis of Recycle Manufacturing Systems of Assemble Products
Ree, Sang-Bok ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 413~426
Modern society, as a result of high industrial technology, is characterized by a series of mass production, moss consumption and mass disposal. As the mass disposal is known as the major culprit of destroying ecological system of our environment, human prosperity is in turn threatened by this indiscrete activities. Under current industrial technology which pursuit maximum profit, environmental problems could not be solved. This paper proposes recycle manufacturing systems of assemble products as a measure of current non-recycle manufacturing systems. Products are also composed of a number of ports. All parts are represented by a function of time cost performance variable as reuse level. We develop on information systems which give all the information on reused and recycled parts. We try to implement this result on a real fields. We confide ourselves to the contribution to on effective solution of environmental problems and to give profit to assembly manufacturing and consumers.
Hierarchical Constraint Network Representation of Concurrent Engineering Models
Kim, Yeong-Ho ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 427~440
Constraint networks are a major approach to knowledge representation in Concurrent Engineering (CE) systems. The networks model various factors in CE as constraints linked by shared variables. Many systems have been developed to assist constraint network processing. While these systems can be useful, their underlying assumption that a solution must simultaneously satisfy all the constraints is often unrealistic and hard to achieve. Proposed in this paper is a hierarchical representation of constraint networks using priorities, namely Prioritized Constraint Network (PCN). A mechanism to propagate priorities is developed, and a new satisfiability definition taking into account the priorities is described. Strength of constraint supporters can be derived from the propagated priorities. Several properties useful for investigating PCN's and finding effective solving strategies ore developed.
Recognition Algorithm for Composite Features Considering Process Planning
Kang, Bum-Sick ; Lee, Hyun-Chan ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 441~458
Many researches on feature recognition have been performed up to now, but the general solution for recognizing arbitrary features has not been developed. The most popular research area in feature recognition is automatic extraction of 2.5 dimensional features, because they are frequently used in manufacturing field. In this paper, a faster and more convenient 2.5 dimensional feature recognition algorithm is proposed using a new strategy which is quite different from the existing ones. The proposed algorithm takes process planning into consideration. The algorithm is implemented in C++. By applying the algorithm to practical complicate examples, we verify that the algorithm is working very well.
Time-Censored Ramp Tests with Stress Bound for Exponential
Bai, Do-Sun ; Chun, Young-Rok ; Cha, Myung-Su ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 459~471
This paper considers ramp tests for exponential lifetime distribution when there are limitations on test stress and test time. The inverse power law and a cumulative exposure model are assumed. Maximum likelihood (ML) estimators of model parameters and their asymptotic covariance matrix are obtained. The optimum ramp test plans are also found which minimize the asymptotic variance of the ML estimator of the log mean life at design constant stress. For selected values of the design parameters, tables useful for finding optimal test plans are given. The effect of the pre-estimates of design parameters is studied.
Economic Complete Inspection Plans for Grading Product Quality
Hong, Sung-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 473~483
For situations where there are several markets with different price/cost structures, economic complete inspection plans are developed for determining the market to ship the product to. Two complete inspection plans are considered; the plan based on the performance variable of interest, and the plan based on a variable which is correlated with the performance variable. Profit models are constructed which involve selling price, cost incurred by imperfect quality, and quality inspection cost. Methods of finding the optimal complete inspection plans are presented and a numerical example is given.
A Pseudopolynomial-time Algorithm for Solving a Capacitated Subtree of a Tree Problem in a Telecommunication System
Cho, Geon ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 485~498
For a tree T rooted at a concentrator location in a telecommunication system, we assume that the capacity H for the concentrator is given and a profit
, and a demand
, on each node
of T are also given. Then, the capacitated subtree of a tree problem (CSTP) is to find a subtree of T rooted at the concentrator location so as to maximize the total profit, the sum of profits over the subtree, under the constraint satisfying that the sum of demands over the subtree does not exceed H. In this paper, we develop a pseudopolynomial-time algorithm for CSTP, the depth-first dynamic programming algorithm. We show that a CSTP can be solved by our algorithm in
(nH) time, where n is the number of nodes in T. Our algorithm has its own advantage and outstanding computational performance incomparable with other approaches such as CPLEX, a general integer programming solver, when it is incorporated to solve a Local Access Telecommunication Network design problem. We report the computational results for the depth-first dynamic programming algorithm and also compare them with those for CPLEX. The comparison shows that our algorithm is competitive with CPLEX for most cases.
Collision-Free Path Planning for Robot Manipulator using SOM
Rhee, Jong-Woo ; Rhee, Jong-Tae ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 499~515
The basic function of on industrial robot system is to move objects in the workspace fast and accurately. One difficulty in performing this function is that the path of robot should be programmed to avoid the collision with obstacles, that is, tools, or facilities. This path planning requires much off-line programming time. In this study, a SOM technique to find the collision-free path of robot in real time is developed. That is, the collision-free map is obtained through SOM learning and a collision-free path is found using the map in real time during the robot operation. A learning procedure to obtain the map and an algorithm to find a short path using the map is developed and simulated. Finally, a path smoothing method to stabilize the motion of robot is suggested.
Area and Time-Dependent Vehicle Scheduling Problems Travel Speeds Estimation Model and Scheduling Heuristics
Park, Yang-Byung ; Song, Sung-Hun ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 3, 1996, Pages 517~532
The area and time-dependent vehicle scheduling problem(ATVSP) is a generalization of the vehicle scheduling problem in which the travel speed between two locations depends on the passing areas and time of day. We propose a simple model for estimating area and time-dependent travel speeds in the ATVSP that relieves much burden for the data collection and storage problems. A mixed integer nonlinear programming formulation of the ATVSP is presented. We also propose three heuristics for the ATVSP, developed by extending and modifying existing heuristics for conventional vehicle scheduling problems. The results of computational experiments demonstrate that the proposed estimation model performs well and the saving method is the best among the three heuristics.