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 30, Issue 4 - Dec 2004
Volume 30, Issue 3 - Sep 2004
Volume 30, Issue 2 - Jun 2004
Volume 30, Issue 1 - Mar 2004
Selecting the target year
Optimal Software Release Time Considering Maintenance during Operation
Lee, Chin-Seung ; Na, Il-Yong ; Hong, Jung-Sik ; Lie, Chang-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 261~266
In this paper, the software reliability growth model which incorporates the periodic maintenance after the release is proposed. Using the proposed model, the debugging and periodic maintenance cost subject to the required level of the software reliability are investigated. An optimal software release time is derived for a fixed interval of periodic maintenance. To validate the proposed model, release times obtained in this study are compared with examples. The proposed investigation is expected to be served as one of factors in determining the release time of the software where periodic maintenance is considered.
Improved Decision Tree Algorithms by Considering Variables Interaction
Kwon, Keunseob ; Choi, Gyunghyun ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 267~276
Much of previous attention on researches of the decision tree focuses on the splitting criteria and optimization of tree size. Nowadays the quantity of the data increase and relation of variables becomes very complex. And hence, this comes to have plenty number of unnecessary node and leaf. Consequently the confidence of the explanation and forecasting of the decision tree falls off. In this research report, we propose some decision tree algorithms considering the interaction of predictor variables. A generic algorithm, the k-1 Algorithm, dealing with the interaction with a combination of all predictor variable is presented. And then, the extended version k-k Algorithm which considers with the interaction every k-depth with a combination of some predictor variables. Also, we present an improved algorithm by introducing control parameter to the algorithms. The algorithms are tested by real field credit card data, census data, bank data, etc.
Performance Analysis for CDMA Soft Handoffs between MSC's under Hexagonal Configuration
Choi, Woo-Yong ; Jun, Chi-Hyuck ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 277~284
CDMA (Code Division Multiple Access) is a promising air interface technique for digital cellular systems. The soft handoff between base stations is one of many important features of CDMA for the mobile stations crossing the cell boundaries. The service areas of MSC's (Mobile Switching Centers) are defined as the unions of the service areas of the base stations connected to MSC's and are assumed to have hexagonal shapes. An analytical approach to the performance analysis of the link between MSC's for supporting the inter-MSC soft handoff scheme will be developed to obtain the probability that a soft handoff to an adjacent MSC will be blocked due to the shortage of the link capacity. Also, the rate of new connection establishments that are requested by the mobile stations moving to the service area of an MSC according to the inter-MSC soft handoff scheme will be obtained.
Cell Formation Considering the Minimization of Manufacturing Leadtime in Cellular Manufacturing Systems
Yim, Dong-Soon ; Woo, Hoon-Shik ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 285~293
In this study, a machine grouping problem for the formation of manufacturing cells is considered. We constructed the problem as minimizing manufacturing leadtime consisting of parts' processing, moving, and waiting time. Specifically, the main objective of the defined problem is established as minimizing inter-cell traffic in order to minimize the part's moving time. In addition, to reduce the waiting time of parts, the load balance among cells is implicitly included as constraints. Since this problem is well known as NP-complete and cannot be solved in polynomial time, a genetic algorithm is implemented to obtain solutions. Also, a local optimization algorithm is applied in order to improve the solution by the genetic algorithm. Several experiments show that the suggested algorithms guarantee near optimal solutions in a few seconds.
Optimal Sizing of In-Plant and Leased Storage Spaces under a Randomized Storage Policy
Lee, Moon-Kyu ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 294~300
This paper considers a trade-off effect between in-house storage space and leased storage space in generic warehouses operated under a randomized storage assignment policy. The amount of in-house storage space is determined based on the law of large numbers satisfying a given service level of protection against space shortages. Excess space requirement is assumed to be met via leased storage space. A new analytic model is formulated for determining the excess space such that the total cost of storage space is minimized. Finally, computational results are provided for the systems where the standard economic-order-quantity inventory model is used for all items.
Optimal Sequencing of Orders for Picking in a Plate Warehouse
Myung, Young-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 301~305
In a warehouse, plates listed in the different orders are placed mixed. Nevertheless, when plates are going out, a group of plates listed in the same order should be sequentially loaded on a transporter. Since the access to the plates is only from the top of the stack, it happens often that we have to move some plates on a temporary place in order to access a plate below them. This paper deals with a problem of sequencing orders for transportation to minimize the number of plates temporarily moved.
Expected Waiting Times for Storage and Retrieval Requests in Automated Storage and Retrieval Systems
Cho, Myeonsig ; Bozer, Yavuz A. ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 306~316
We present a closed form approximate analytical model to estimate the expected waiting times for the storage and retrieval requests of an automated storage/retrieval (AS/R) system, assuming that the storage/retrieval (S/R) machine idles either at the rack or at the input/output point. The expected waiting times (and the associated mean queue lengths) can play an important role to decide whether the performance of a stable AS/R system is actually acceptable, to determine buffer size (or length) of the input conveyor, and to compute the number of the rack openings which is required to hold the loads which are requested by processing machines but waiting in the rack to be retrieved by the SIR machine. This model can be effectively used in the early design stage of an AS/R system.
Cyclic Sequencing in Mixed-Model Production Systems
Choi, Wonjoon ; Kim, Yearnmin ; Park, Changkwon ; Lee, Yongil ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 317~327
In mixed-model production systems, various models of products are produced alternately on the same production line. When the total number of models or the total production quantity is large, it takes a long time to determine the production sequence of the products. In this paper, we will show that in case of product rate variation problem (PRV) problem with nonidentical symmetric convex discrepancy function, an optimum sequence can be obtained by repeating an optimum sequence in a reduced subproblem.
Saving Tool Costs in Flexible Manufacturing Systems: Optimal Processing Times and Routing Mix
Kim, Jeong seob ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 328~337
Tool costs can comprise a significant part of the total operating costs of Flexible Manufacturing Systems. We address the problem of determining the optimal processing times of individual operations and routing mix in FMSs with multiple routes for each part type in order to minimize tool cost, subject to meeting a throughput constraint for each part type. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. Numerical examples reveal the potential of our approach for significant saving in tool costs.
A Study of PDAs Icon Design Guideline Considered User's Cognitive Human Factor
Kim, Sang-hwan ; Myung, Rohae ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 338~345
Personal Digital Assistants (PDAs) have become ubiquitous and continued to gain popularity. Since PDAs have some special contexts such as mobility and limited screen size, icons are utilized frequently because icons allow us to do tasks more rapidly and effectively on PDAs like another information appliances. The study presents a cognitive approach to study human factors affecting icon design with multidimensional Scaling (MDS) analysis. In the experiment, a real PDA was used to investigate 29 attributes and2 preference ratings for 22 PDA icons by 20 Korean subjects. As a result, cognitive positioning about icons, attributes, and preference data were arranged on the two dimensional perceptual map. Attributes were grouped by simplicity, universality, activity, complexity, abstraction, static, and alphanumeric time. Subjects preferences were highly related with simplicity attributes group and positive to universality and activity attributes groups. It was also confirmed that there are some icons unfitted to the mental model of Korean. However, when icons are designed for PDAs or similar information appliances to Korean, it should be designed simply and actively with universal image fitted on target users mental model.
A Genetic Algorithm for Vehicle Routing Problems with Mixed Delivery and Pick-up
Chung, Eun-Yong ; Park, Yang-Byung ;
Journal of Korean Institute of Industrial Engineers, volume 30, issue 4, 2004, Pages 346~354
Most industrial logistic systems have focused on carrying products from manufacturers or distribution centers to customers. In recent years, they are faced with the problem of integrating reverse flows into their transportation systems. In this paper, we address the vehicle routing problems with mixed delivery and pick-up(VRPMDP). Mixed operation of delivery and pick-up during a vehicle tour requires rearrangement of the goods on board. The VRPMDP considers the reshuffling time of goods at customers, hard time windows, and split operation of delivery and pick-up. We construct a mixed integer mathematical model and propose a new genetic algorithm named GAMP for VRPMDP. Computational experiments on various types of test problems are performed to evaluate GAMP against the modified Dethloff's algorithm. The results show that GAMP reduces the total vehicle operation time by 5.9% on average, but takes about six times longer computation time.