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 33, Issue 4 - Dec 2007
Volume 33, Issue 3 - Sep 2007
Volume 33, Issue 2 - Jun 2007
Volume 33, Issue 1 - Mar 2007
Selecting the target year
Model-based Estimation of Production Parameters of Electronics FAB Equipment
Kang, Dong-Hun ; Kim, Min-Kyu ; Choi, Byoung-Kyu ; Park, Bum-Chul ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 166~173
In this paper, we propose a model-based approach to estimating production parameters of semiconductor FAB equipment. For FAB scheduling, for example, we need to know equipment's production parameters such as flow time, tact time, setup time, and down time. However, these data are not available, and they have to be estimated from material move data such as loading times and unloading times that are automatically collected in modern automated semiconductor FAB. The proposed estimation method may be regarded as a Bayes estimation method because we use additional information about the production parameters. Namely, it is assumed that the technical ranges of production parameters are known. The proposed estimation method has been applied to a LCD FAB, and found to be valid and useful.
Application of Contradiction Analysis for Determination of Product Platform in Mass Customization and Case Study
Kim, Kyoung Hee ; Park, Joon Young ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 174~182
Mass customization meets various needs of customers as well as produces various products and service in low cost like mass production. However, low cost and product diversity have conflicting concepts. Therefore, in order to solve this problem, we need standardization methods. In this paper, we suggest a method for determining the product platform which is a set of common parts in a product family. To achieve the method, we used the Contradiction Analysis of TRIZ (Theory of Inventive Problem Solving), Using this approach, we found a model that obtains various products within limited resources and conditions. Also, we suggest another method that increases the flexibility of our method by Design Structure Matrix.
A New Decision Tree Algorithm Based on Rough Set and Entity Relationship
Han, Sang-Wook ; Kim, Jae-Yearn ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 183~190
We present a new decision tree classification algorithm using rough set theory that can induce classification rules, the construction of which is based on core attributes and relationship between objects. Although decision trees have been widely used in machine learning and artificial intelligence, little research has focused on improving classification quality. We propose a new decision tree construction algorithm that can be simplified and provides an improved classification quality. We also compare the new algorithm with the ID3 algorithm in terms of the number of rules.
Quality of Service Assurance Model for AMR Voice Traffic in Downlink WCDMA System
Jung, Sung Hwan ; Hong, Jung Wan ; Lie, Chang Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 191~200
We propose the QoS (Quality of Service) assurance model for AMR (Adaptive MultiRate) voice users considering the capacity and service quality jointly in downlink WCDMA system. For this purpose, we introduce a new system performance measure and the number-based AMR mode allocation scheme. The proposed number-based AMR mode allocation can be operated only with the information of total number of ongoing users. Therefore, it can be more simply implemented than the existing power-based allocation. The proposed system performance measure considers the stochastic variations of AMR modes of ongoing users and can be analytically obtained using CTMC (Continuous Time Markov Chain) modeling. In order to validate the proposed analytical model, a discrete event-based simulation model is also developed. The performance measure obtained from the analytical model is in agreement with the simulation results and is expected to be useful for parameter optimization.
Subtour Preservation Crossover Operator for the Symmetric TSP
Soak, Sang-Moon ; Lee, Hong-Girl ; Byun, Sung-Cheal ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 201~212
Genetic algorithms (GAs) are very useful methods for global search and have been applied to various optimization problems. They have two kinds of important search mechanisms, crossover and mutation. Because the performance of GAs depends on these operators, a large number of operators have been developed for improving the performance of GAs. Especially, many researchers have been more interested in a crossover operator than a mutation operator. The reason is that a crossover operator is a main search operator in GAs and it has a more effect on the search performance. So, we also focus on a crossover operator. In this paper we first investigate the drawback of various crossovers, especially subtour-based crossovers and then introduce a new crossover operator to avoid such drawback and to increase efficiency. Also we compare it with several crossover operators for symmetric traveling salesman problem (STSP) for showing the performance of the proposed crossover. Finally, we introduce an efficient simple hybrid genetic algorithm using the proposed operator and then the quality and efficiency of the obtained results are discussed.
A Branch and Bound Algorithm for Two-Stage Hybrid Flow Shop Scheduling : Minimizing the Number of Tardy Jobs
Choi, Hyun-Seon ; Lee, Dong-Ho ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 213~220
This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.
Real Options and Strategic Decision Analysis
Kim, Ki-Hong ; Oh, Hyung-Sik ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 221~226
This paper suggests a valuation framework of investment project using the concept of real options. We show the valuation process of real assets using the risk-neutral pricing. Especially, we focus on the investment lag. Real assets have investment lag in general. The decision time and the payment time are not identical. So the investment lag should be considered when valuing real assets for reality. We provide the valuation process for real assets, including R&D project. The results of this paper can be used for the real assets valuation and strategic decision analysis.
Designing Stacking Facilities of Pyramid Type
Park, Twae Kyung ; Kim, Kap Hwan ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 227~236
This paper proposes a method for designing stacking warehouses of pyramid type which can be found in storage rooms for steel coils, paper rolls, and drums for oils. Formulas were derived for estimating the expected travel time of cranes and the expected time for rehandling activities. Based on the derived formulas, this study derives the cost function for determining the optimal numbers of rows, bays, tiers of stacks under the condition that the requirement for storage space is satisfied. Numerical examples were given.
Efficient Polling Scheme for Multiple Direct Link Communication Between STAs in Infrastructure Mode IEEE 802.11 Wireless LANs
Choi, Woo-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 237~245
In this paper, a modified PCF (Point Coordination Function) MAC (Medium Access Control) Protocol is proposed to support the multiple direct link communication between STAs (STAtions) in infrastructure mode IEEE 802.11 wireless LANs. By the proposed MAC protocol, the direct link communication between STAs, which are located within the communication range of each other, is allowed without the use of AP (Access Point) as a relay. Moreover, when multiple direct data communication between STAs can be simultaneously performed with a sufficiently small interference, multiple simultaneous direct link communication is allowed for the efficient use of radio bandwidth. AP polls STAs to grant the transmission opportunities using the direct link communication by transmitting the polling frames to STAs. An efficient polling method for granting the transmission opportunities to STAs is proposed to reduce the number of the polling frame transmissions and enhance the PCF MAC performance.
A Batch Sizing Model at a Bottleneck Machine in Production Systems
Koo, Pyung-Hoi ; Koh, Shie-Gheun ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 246~253
All of the machines in a production line can be classified into bottleneck and non-bottleneck machines. A bottleneck is a resource whose capacity limits the throughput of the whole production facility. This paper addresses a batch sizing problem at the bottleneck machine. Traditionally, most batch sizing decisions have been made based on the EOQ (economic order quantity) model where setup and inventory costs are considered while throughput rate is assumed to be given. However, since batch size affects the capacity of the bottleneck machine, the throughput rate may not be constant. As the batch size increases, the frequency of the setup decreases. The saved setup time can be transferred to processing time, which results in higher throughput. But, the larger batch size may also result in longer lead time and larger WIP inventory level. This paper presents an alternative method to determine batch size at the bottleneck machine in a manufacturing line. A linear search algorithm is introduced to find optimal throughput rate and batch size at the same time. Numerical examples are provided to see how the proposed method works and to investigate the effects of some parameters.
A Scheduling Problem to Minimize Weighted Completion Time in the Two-stage Assembly-type Flowshop
Yoon, Sang Hum ; Lee, Ik Sun ; Lee, Jong Hyup ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 254~264
This paper considers a scheduling problem to minimize the total weighted completion time in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple components, each component is machined on the fabrication machine specified in advance. The manufactured components of each job are subsequently assembled into a final product on the final-assembly machine. The objective of this paper is to find the optimal schedule minimizing the total weighted completion time of jobs. Three lower bounds are derived and tested in a branch-and-bound (B&B) Procedure. Also, three heuristic algorithms are developed based on the greedy strategies. Computational results show that the proposed B&B procedure is more efficient than the previous work which has considered the same problem as this paper.
Heuristic for Vehicle Routing Problem with Perishable Product Delivery
Kang, Kyung Hwan ; Lee, Young Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 265~272
The purpose of Vehicle Routing Problem (VRP) is to design the least costly (distance, time) routes for a fleet of identically capacitated vehicles to serve geographically scattered customers. There may be some restrictions such as the maximal capacity for each vehicle, maximal distance for each vehicle, time window to visit the specific customers, and so forth. This paper is concerned with VRP to minimize the sum of elapsed time from departure, where the elapsed time is defined as the time taken in a moving vehicle from the depot to each customer. It is important to control the time taken from departure in the delivery of perishable products or foods, whose freshness may deteriorate during the delivery time. An integer linear programming formulation is suggested and a heuristic for practical use is constructed. The heuristic is based on the set partitioning problem whose performances are compared with those of ILOG dispatcher. It is shown that the suggested heuristic gave good solutions within a short computation time by computational experiments.
Optimal System Burn-in for Maximizing Reliability of Non-series Systems
Kim, Kyungmee O. ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 273~281
The decision of how long performing system burn-in must be answered with a probabilistic model of a system lifetime at which infant mortality failures created during assembly processes are quantified. In this paper, we propose such a model which is modified from previous results. Using the system model, we derived system reliability in terms of component and system burn-in times for the two cases of minimal repair at system failure and of component replacement and connection repair at their failure times. The procedure is illustrated with a bridge system and the optimal system burn-in times are obtained for maximizing system reliability. The result suggests that an assumption of minimal repair at system failure may underestimate the optimal burn-in time in practice.
A Recursive Optimization/Simulation Procedure for Express Courier Service Network Design : Determination of Terminal Capacity and Cut-off Time
Ko, Chang Seong ; Lee, Hee Jeon ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 2, 2007, Pages 282~289
While demands for express couriers service are rapidly increasing due to recent progress of electronic commerce, express courier service companies are struggling to take a larger market share through ongoing improvement in their service processes. Cut-off time is the time limit that all orders delivered before the limit are guaranteed for the delivery within the very next day. Extending cut-off time for express service centers can provide the express company with increase of total sales, but it may also cause increasing the possibility not to satisfy customer needs due to work delay in the consolidation terminal. We develop a design model for express courier service network based on a recursive optimization/simulation procedure. With the optimization model, we seek key design parameters such as the cut-off time for express service centers and the capacity of the consolidation terminal maximizing total sales profit while satisfying the desired level of performances. With the simulation model, we consider the dynamic nature of the network and obtain relationships between the design parameters and the performance measures with the multiple linear regression. The validity of the model is examined with an example.