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 27, Issue 4 - Dec 2001
Volume 27, Issue 3 - Sep 2001
Volume 27, Issue 2 - Jun 2001
Volume 27, Issue 1 - Mar 2001
Selecting the target year
A Global Fairing Algorithm for B-spline Surfaces Using Non-linear Programming
Lee, Hyun-Chan ; Hong, Chung-Seong ; Kim, Deok-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 1~10
In the reverse engineering, surfaces are modeled for new products by interpolating the digitized data points obtained by measuring the existing shapes. However, many measuring or deviation errors are happened during the measuring process. If these errors are ignored, designers could get undesirable results. Therefore, it is important to handle such errors and fairing procedure with the esthetics criteria is needed during surface modeling process. This paper presents algorithms for the fairing of B-spline surfaces. The algorithms are based on automatic repositioning of control points for B-spline surfaces. New positions of the control points are determined by solving a non-linear programming of which the objective functions are derived variously using derived surfaces and constraints are established by distance measures between the original and the modified control points. Changes in surface shapes are analyzed by illustrations of their shapes and continuous plotting of gaussian and mean curvatures.
An Analysis on the M/G/1 Bernoulli Feedback System with Threshold in Main Queue
Lim, Si-Yeong ; Hur, Sun ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 11~17
We consider the M/G/1 with Bernoulli feedback, where the served customers wait in the feedback queue for rework with probability p. It is important to decide the moment of dispatching in feedback systems because of the dispatching cost for rework. Up to date, researches have analyzed for the instantaneous-dispatching model or the case that dispatching epoch is determined by the state of feedback queue. In this paper we deal with a dispatching model whose dispatching epoch depends on main queue. We adopt supplementary variable method for our model and a numerical example is given for clarity.
A Heuristc Algorithm for the Traveling Salesman Problem with Time Windows and Lateness Costs
Suh, Byung-Kyu ; Kim, Jong-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 18~24
This paper presents a model and a heuristic algorithm for the Traveling Salesman Problem with Time Windows(TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are more flexible and realistic than the previous ones. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at each node. But, in real business practice, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we develop a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. A two-phased heuristic algorithm is proposed for the model and is extensively tested to verify the accuracy and efficiency of the algorithm.
On a Two Dimensional Linear Programming Knapsack Problem with the Extended GUB Constrain
Won, Joong-Yeon ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 25~29
We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O(
). A numerical example is given.
An Efficient Tree Structure Method for Mining Association Rules
Kim, Chang-Oh ; Ahn, Kwang-Il ; Kim, Seong-Jip ; Kim, Jae-Yearn ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 30~36
We present a new algorithm for mining association rules in the large database. Association rules are the relationships of items in the same transaction. These rules provide useful information for marketing. Since Apriori algorithm was introduced in 1994, many researchers have worked to improve Apriori algorithm. However, the drawback of Apriori-based algorithm is that it scans the transaction database repeatedly. The algorithm which we propose scans the database twice. The first scanning of the database collects frequent length l-itemsets. And then, the algorithm scans the database one more time to construct the data structure Common-Item Tree which stores the information about frequent itemsets. To find all frequent itemsets, the algorithm scans Common-Item Tree instead of the database. As scanning Common-Item Tree takes less time than scanning the database, the algorithm proposed is more efficient than Apriori-based algorithm.
Object-Oriented Business Process Modeling : Contract-Collaboration Net Model
Kim, Chang-Ouk ; Jun, Jin ; Kim, Sung-Shick ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 37~46
Business process(workflow) analysis has been recognized as a core step to building information systems. However, most analysts have recognized that deriving consistent business process artifacts even in a simple business domain is very difficult, since most analysis methods give the designers narrative and/or diagrammatic tools that do not support rigorous analysis rules. This often generates inconsistent analysis results, leading to create useless information systems and resulting in tremendous budget wastes. To overcome this weakness, this paper presents a declarative business process modeling method called contract-collaboration net(cc-net), which is not only somewhat formal but also useful to the practitioners. A case study on bank domain is presented to illustrate our approach.
Comparing Classification Accuracy of Ensemble and Clustering Algorithms Based on Taguchi Design
Shin, Hyung-Won ; Sohn, So-Young ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 47~53
In this paper, we compare the classification performances of both ensemble and clustering algorithms (Data Bagging, Variable Selection Bagging, Parameter Combining, Clustering) to logistic regression in consideration of various characteristics of input data. Four factors used to simulate the logistic model are (1) correlation among input variables (2) variance of observation (3) training data size and (4) input-output function. In view of the unknown relationship between input and output function, we use a Taguchi design to improve the practicality of our study results by letting it as a noise factor. Experimental study results indicate the following: When the level of the variance is medium, Bagging & Parameter Combining performs worse than Logistic Regression, Variable Selection Bagging and Clustering. However, classification performances of Logistic Regression, Variable Selection Bagging, Bagging and Clustering are not significantly different when the variance of input data is either small or large. When there is strong correlation in input variables, Variable Selection Bagging outperforms both Logistic Regression and Parameter combining. In general, Parameter Combining algorithm appears to be the worst at our disappointment.
Hybrid Genetic Algorithm for Facility Layout Problems with Unequal Area and Fixed Shapes
Lee, Moon-Hwan ; Lee, Young-Hae ; Jeong, Joo-Gi ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 54~60
In this paper, a shape-based block layout (SBL) approach is presented to solve the facility layout problem with unequal-area and fixed shapes. The SBL approach employs hybrid genetic algorithm (Hybrid-GA) to find a good solution and the concept of bay structure is used. In the typical facility layout problem with unequal area and fixed shapes, the given geometric constraints of unequal-area and fixed shapes are mostly approximated to original shape by aspect ratio. Thus, the layout results require extensive manual revision to create practical layouts and it produces irregular building shapes and too much unusable spaces. Experimental results show that a SBL model is able to produce better solution and to create more practical layouts than those of existing approaches.
Development of Diagnostic Expert Systems for A Rotor System
Kim, Sung-Chul ; Kim, Sang-Pyo ; Kim, Young-Jin ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 61~68
A rotor system is composed of a rotating shaft with supporting bearings. The rotor system is widely used in every rotating machinery such as the turbine generator and the high precision machine tools. A negligible error or malfunction in the rotor, however, can cause a catastrophic failure in the system then result in the environmental and economic disasters. A diagnosis of the rotor system is important in preventing these kinds of failures and disasters. Up to now, many researchers have devoted in the development of diagnosing tools for the system. The basic principles behind the tools are to retrieve the data through the sensors for a specific state of the system and then to identify the specific state through the heuristic methods such as neural network, fuzzy logic, and decision matrix. The proper usage of the heuristic methods will enhance the performance of the diagnostic procedure when together used with the statistical signal processing. In this paper, the methodologies in using the above 3 heuristic methods for the diagnostics of the rotor system are established and also tested and validated for the data retrieved from the rolling element bearing and journal bearing supported system.
Determination of Cutting Direction for Tool Path Minimization in Zigzag Milling Operation
Kim, Byoung-Keuk ; Park, Joon-Young ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 69~88
In the zigzag milling operation, an important issue is to design a machining strategy which minimizes the cutting time. An important variable for minimization of cutting time is the tool path length. The tool path is divided into cutting path and non-cutting path. Cutting path can be subdivided into tool path segment and step-over, and non-cutting path can be regarded as the tool retraction. We propose a new method to determine the cutting direction which minimizes the length of tool path in a convex or concave polygonal shape including islands. For the minimization of tool path length, we consider two factors such as step-over and tool retraction. Step-over is defined as the tool path length which is parallel to the boundary edges for machining area and the tool retraction is a non-cutting path for machining any remaining regions. In the determination of cutting direction, we propose a mathematical model and an algorithm which minimizes tool retraction length in complex shapes. With the proposed methods, we can generate a tool path for the minimization of cutting time in a convex or concave polygonal shapes including islands.
Performance Analysis of M/
/c/N Time-out Queueing System
Ryu, Ji-Hyun ; Jun, Chi-Hyuck ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 89~94
There are many queueing systems where customers wait for service up to a certain amount of time and leave the system if they are not served during that time. This paper considers a finite capacity multi-server queueing system with Poisson input and Erlang service time, where a customer becomes a lost customer when his service has not begun within an exponential patient time after his arrival. Performance measures such as average queue length, the average number of customers in service, and the proportion of lost customers can be obtained exactly through the proposed numerical solution procedure.
Assembly Performance Evaluation Using FACTOR / AIM for the Automobile Body Assembly Line
Hwang, Heung-Suk ; Cho, Gyu-Sung ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 95~102
The design of automobile body assembly line is one of essential parts for improving the process performance. The major objective of this research is to develop a performance evaluation model for automobile assembly line using a closed queueing network(CQN) and simulation method. In this study we used a two-step approach to compute the performance of the assembly line : first, we used CQN model considering assembly line equipments and the line operating time under the assumption of no failure, and second we used a well-known simulator FACTOR/AIM. Finally we implemented this model on a K automobile company and we have shown the sample results of automobile body assembly line.
Automation of Assembly System in Make-To-Order
Mok, Hak-Soo ; Moon, Kwang-Sup ; Shin, Hyun-Chang ; Pyo, Seung-Tae ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 103~110
The aim of this paper is the implementation of high assembly productivity through product redesign. The product and process are analyzed by influencing factors for based data of the product redesign. And then, the weak assembly processes are analyzed by weak influencing factors. By this information about product and process, the score of weakness of influencing factors extracts the redesign rules and principles. The sequences of processes are changed according to the product redesign, and they are evaluated using the line efficiency and smoothness index.
M/G/1 Queueing Model for the Performance Estimation of AS/RS
Lim, Si-Yeong ; Hur, Sun ; Lee, Moon-Hwan ; Lee, Young-Hae ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 1, 2001, Pages 111~117
Most of the techniques for the performance estimation of unit-load AS/RS are a static model or computer simulation. Especially, their models have been developed under the assumption that the Storage/Retrieval (S/R) machine performs either single command(SC) or dual command(DC) only. In reality, depending on the operating policy and the status of the system at a particular time, the S/R machine performs a SC or a DC, or becomes idle. In order to resolve this weak point, we propose a stochastic model for the performance estimation of unit-load ASIRS by using a M/G/1 queueing model with a single server and two queues. Server utilization, expected numbers of waiting storage and retrieval commands and mean time spent in queue and system are found.