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 23, Issue 4 - Dec 1997
Volume 23, Issue 3 - Sep 1997
Volume 23, Issue 2 - Jun 1997
Volume 23, Issue 1 - Mar 1997
Selecting the target year
Multiobjective Vehicle Scheduling Problem with Time and Area-Dependent Travel Speeds: Scheduling Algorithm and Expert System
Park, Yang-Byung ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 621~633
This paper is concerned with the multiobjective vehicle scheduling problem with time and area-dependent travel speeds(MVSPTD), in which two conflicting objectives are explicitly treated and the travel speed between two locations depends on the passing area and time of day. The two objectives are the minimization of total vehicle travel time and the minimization of total weighted tardiness. First, I construct a mixed integer linear programming formulation of the MVSPTD, and present o heuristic algorithm that builds the vehicle schedules based on the savings computed. The results of computational experiments showed that the heuristic performs very well. Finally, I propose an expert system for vehicle scheduling in the MVSPTD. Its whole process is executed under VP-Expert expert system environment.
Finding the Mostly Preferred Solution for MADM Problems Using Fuzzy Choquet's Integral
Cho, Sung-Ku ; Lee, Kang-In ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 635~643
The purpose of this paper is to propose an interactive method, using fuzzy Choquet's integral, which is designed to find out the mostly preferred solutions for deterministic MADM problems with many attributes and alternatives. The basic idea of the paper is essentially the same as that of the one we have published before; subgrouping of attributes and eliminating of inefficient solutions. But the difference between these two methods lies in the fact that the present method evaluates and eliminates alternatives using fuzzy Choquet's integral on the basis of decision-maker's judgements about the relative importance of subgroups of attributes, rather than using mathematical programming on the basis of pair-wise comparisons of alternatives. If such information is obtainable from the decision-maker, the method can be proved to be much easier to understand and more efficient to compute.
Load Scheduling Using a Genetic Algorithm in Port Container Terminals
Kim, Kap-Hwan ; Kim, Ki-Young ; Ko, Chang-Seong ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 645~660
An application of the genetic algorithm(GA) to the loading sequencing problem in port container terminals is presented in this paper. The efficiency of loading operations in port container terminals is highly dependent on the loading sequence of export containers. In order to sequence the loading operation, we hove to determine the route of each container handling equipment (transfer crane or straddle carried in the yard during the loading operation. The route of a container handling equipment is determined in a way of minimizing the total container handling time. An encoding method is developed which keeps intermediate solutions feasible and speeds up the evolution process. We determine the sequence of each individual container which the container handling equipment picks up at each yard-bay as well as the visiting sequence of yard-bays of the equipment during the loading operation. A numerical experiment is carried out to evaluate the performance of the algorithm developed.
An Efficient Algorithm for the Generalized Continuous Multiple Choice linear Knapsack Problem
Won, Joong-Yeon ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 661~667
We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O(
) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.
Object-Oriented Petri Net Model for Representation of Flexible Process Plan
Lee, Kyung-Huy ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 669~686
In this research, an object-oriented Petri net model for representing a flexible process plan is proposed, which is hierarchically multi-faceted for supporting planning, scheduling, and shop floor control functions. The multi-faceted process plan model consists of the following: a) an object model which represents on object-oriented data model, b) a static model which represents a process flow model with process alternatives, and c) a dynamic model which represents a process activity model with resources alternatives, of a flexible process plan. Petri nets allow the static and the dynamic process plan models to be represented in a unified formalism with an ease of model transformation. The multi-faceted process plan model suggested in this paper, is illustrated with a prismatic port in comprehensive detail.
Throughput Analysis for Blast Protocols under Markov Error Type
Hong, Jung-Sik ; Hong, Jung-Wan ; Lie, Chang-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 687~698
In this paper, a Variation of Blast with Go-Back-N(V-BGBN) protocol is proposed, which differs from Blast with Go-Back-N(BGBN) and Blast with Full Retransmission on Error(BFRE) protocols in the retransmission strategy of packets. Performances of these three protocols under correlated packet errors are analyzed. Throughput efficiency of an arbitrary packet is obtained under the assumption that the round trip delay and the packet length are respectively constant. Recursive formula and difference equations are used as analytical tools. Correlation of packet errors is modelled by a two state Markov chain. The throughput efficiencies under these protocols are compared. V-BGBN protocol is shown to be superior to other two protocols in high speed network.
A Study of New Production Input Control in an Agile Manufacturing Environment
Kim, Hyun-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 699~708
Production control is usually composed of due-dote assignment, production input control, and priority dispatching rule. A production input control(PIC) is mainly to control the WIP level on the shop floor. On the other hand, a priority dispatching rule(PDR) is mainly to control the tardiness/earliness of on order and number of tardy jobs. Therefore, if we select a particular PIC which can control only a particular performance measure(i.e., tardiness), it may cause worsening other performance measure(i.e., WIP level, shopfloor time, etc.) This newly developed production input control, DRD(Dual Release-Dates), is mainly designed to control the WIP level on the shop floor by employing two different release-dates of an order(earliest release. date and latest release-date and the release condition (relationship between the current WIP level and the pre-defined maximum WIP level) while trying to meet the due-date of the order.
A Genetic Algorithm Using Hamiltonian Graph for Rural Postman Problem
Kang, Myung-Ju ; Han, Chi-Geun ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 709~717
For an undirected graph G=(V, E), the Rural Postman Problem (RPP) is a problem that finds a minimum cost tour that must pass edges in E'(
E) at least once. RPP, such as Traveling Salesman Problem (TSP), is known as an NP. Complete problem. In the previous study of RPP, he structure of the chromosome is constructed by E' and the direction of the edge. Hence, the larger the size of IE' I is, the larger the size of the chromosome and the size of the solution space are. In this paper, we transform the RPP into a Hamiltonian graph and use a genetic algorithm to solve the transformed problem using restructured chromosomes. In the simulations, we analyze our method and the previous study. From the simulation results, it is found that the results of the proposed method is better than those of the previous method and the proposed method also obtains the near optimal solution in earlier generations than the previous study.
A methodology for the flexible AGV routing
Kim, Ji-Pyo ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 719~728
In the AGV routing a vehicle can select the shortest route on which no conflicts are anticipated. The procedure includes time constraint and the node/arc occupation times of vehicles in order to locate the conflicting paths. The slight differences among AGV routing algorithms exist in identifying the conflict regions encountered while reaching out to the destination node. In this paper, a novel approach to the use of the re-routing scheme is presented. It will be used to minimize the travel distance of vehicles in a regular vehicle routing process rather than to cope with emergency situations. The proposed algorithm provides existing active vehicles with the ability of changing their current paths for a new vehicle whenever the equal-distance paths exist, in on attempt to optimize the AGV transportation system. This ability is possible because of the flexibility of on AGV system controlled by a computer system.
Development of a New Methodology to find the Expected Busy Periods for Controllable M/G/1 Queueing Models Operating under the Multi-variable Operating Policies: Concepts and applications to the dyadic policies
Rhee, Hahn-Kyou ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 729~739
In this paper, steady-state controllable M/G/1 queueing systems operating under the dyadic policies are considered. A new method to obtain the expected busy period when the D-policy is involved in system operation, is developed. This new method requires derivation of so called 'the pseudo probability density function' of the busy period for the system under consideration, which is completely different from its actual probability density function. However, the proposed pseudo probability density function does generate the correct expected busy period through simple procedures.
A Study on Perfectly and Uniformly Structured Code Matrix
Yee, Soung-Ryong ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 741~754
Code matrix is the matrix of which on element and its neighbors are arranged to have a code value. The code matrix was originally designed by the author for developing a vision system but has not been theoretically studied. In this paper some theoretical properties of the code matrix are investigated. The studied characteristics of the code matrix are useful for not only understanding the matrix itself but efficiently restructuring the matrix. A number of transformation functions, which enable the matrix to have different shape, are thus developed based on the investigated properties. The transformation functions are then applied to build a perfectly and uniformly structured square code matrix, which is proven useful in on image processing example. The study in this paper is expected to serve a theoretical background for the application of the code matrix in many areas.
Improving the Performance of Threshold Bootstrap for Simulation Output Analysis
Kim, Yun-Bae ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 755~767
Analyzing autocorrelated data set is still an open problem. Developing on easy and efficient method for severe positive correlated data set, which is common in simulation output, is vital for the simulation society. Bootstrap is on easy and powerful tool for constructing non-parametric inferential procedures in modern statistical data analysis. Conventional bootstrap algorithm requires iid assumption in the original data set. Proper choice of resampling units for generating replicates has much to do with the structure of the original data set, iid data or autocorrelated. In this paper, a new bootstrap resampling scheme is proposed to analyze the autocorrelated data set : the Threshold Bootstrap. A thorough literature search of bootstrap method focusing on the case of autocorrelated data set is also provided. Theoretical foundations of Threshold Bootstrap is studied and compared with other leading bootstrap sampling techniques for autocorrelated data sets. The performance of TB is reported using M/M/1 queueing model, else the comparison of other resampling techniques of ARMA data set is also reported.
Throughput Upper and lower Bounds for Assembly/Disassembly Queueing Networks with Blocking
Paik, Chun-Hyun ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 769~778
Assembly/Disassembly Queueing Networks (ADQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing and parallel processing systems. In this study, we present simple but effective methods which yield throughput upper and lower bounds for ADQNs with exponential service times and finite buffers. These methods are based on the monotonicity properties of throughputs with respect to service times and buffer capacities. The throughput-upper bounding method is elaborated on with general network configuration (specifically acyclic configuration). But our lower bounding method is restricted to the ADQNs with more specialized configuration. Computational experiments will be performed to confirm the effectiveness of our throughput-bounding methods.
Ranking of Perceived Joints Discomfort in Sitting and Standing Postures
Shin, Sung-Heon ; Kee, Do-Hyung ; Kim, Hyung-Su ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 779~791
The purpose of this study is to measure a perceived joint discomfort in the seated and standing position, and to provide ranking systems of perceived joint discomfort. Nineteen mole subjects with no history of musculo-skeletal disorders participated in the experiment. Their physical characteristics were: age
, and body weight
. The results showed that the perceived joint discomforts were different depending upon the joints involved in motion and their movement directions (degree of freedom of motions), which implied that the human body motions and their degrees of freedom should be classified into several distinct classes that need to be assigned different weights of postural stress. Therefore, three ranking systems based on the perceived joint discomforts were suggested, which were classified by the degree of freedom of motions and joints, by only degree of freedom motions, and by joints involved in motion, respectively. In the seated position, the hip movement was the most stressful, the bock was the second, and the shoulder was the third. Likewise, in the standing postures, the hip was the most, the bock was the second, and the ankle was the third. It was expected that these joint motion ranking systems could be used by practitioners of health and safety to improve the comfort of working postures in industry.
An Economic Design of Rectifying Inspection Plans Based on a Correlated Variable
Bai, D.S. ; Lee, K.T. ; Choi, I.S. ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 793~802
A sampling plan is presented for situations where sampling inspection is based on the quality characteristic of interest and items in rejected lots are screened based on a correlated variable. A cost model is constructed which involves the costs of misclassification errors, sampling and screening inspections. A method of finding optimal values of sample size, acceptance number and cutoff value on the correlated variable is presented, and numerical studies are given.
The formation method of part families considering multiple attributes of parts in flexible manufacturing systems
Kim, Jin-Yong ; Hong, Sung-Jo ; Choi, Jin-Yeong ; Lee, Chin-Gyu ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 803~816
In this paper we propose a new approach far part families considering multiple attributes of parts in the design and operating stage of flexible manufacturing systems. We first represent the relationship of parts and the relative attributes using fuzzy membership function, AHP method and normalization. As a result, more realistic nonbinary data of the relationship is obtained. Then we group parts into part families based on the nonbinary data using fuzzy
-cut and new similarity coefficient method. The performance of our method is compared numerically with others.
Optimal Redundent Units and Inspection Interval in Load-Sharing Parallel System
Yun, Won-Young ; Kim, Gui-Rae ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 817~824
This paper is concerned with a parallel system that sustains a time-independent load and consists of n components with exponential lifetimes. It is assumed that the total load is shared by the functioning components and the failures of components induce higher failure rates in the surviving components according to the relationship between the load and the failure rates. The power rule model among several load-failure rate relationships is considered. Firstly, the reliability function is obtained. Secondly, the optimization problem in this load-sharing parallel system is considered. The optimal redundant units and inspection interval are obtained. Some numerical examples are studied.
Postoptimality Analysis of the Maximum Flow Problem
Chung, Ho-Yeon ; Ahn, Jae-Geun ; Park, Soon-Dal ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 4, 1997, Pages 825~833
The purpose of this paper is to develop a method of postoptimality analysis that can be applied to an optimal solution of a maximum flow problem. We first use the transformed network corresponding to a given network. In such a network we conduct postoptimality analysis by determining changes in the optimal solution precipitated by changes in the capacity as the arc capacity varies from 0 to infinite. By this method we can easily calculate not only the characteristic region where the given optimal solution remains unchanged, but also the characteristic region where the value of the maximal flow gradually increases or decreases. The proposed method is demonstrated by numerical example.