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
Warehouse Storage Capacity with Leased Space for Different Storage Policies
Lee, Moon-Kye ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 328~336
In this paper, an approach is presented for determining the required storage capacity of a warehouse with leased public space. Storage assignment policies considered are randomized and class-based storage assignment policies. An analytic model for each of the storage policies is formulated with the objective of minimizing the cost of owned storage space and leased space while satisfying a desired service level of protection against space shortages. Cost functions used in the models are piecewise liear with fixed costs. For the models, algorithms are developed to generate optimal solutions. The approach is applied to the systems where the standard economic-order-quantity inventory model is used for all items being stored in the warehouse.
Multi-Generation Diffusion Model for Economic Assessment of New Technology
Sohn, So-Young ; Ahn, Byung-Joo ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 337~344
As cost invested in developing the specified technology is increasing, investors are paying more attention to cost to benefit analysis (CBA). One of the basic elements of CBA for new technological development is the diffusion pattern of demand of such technology. Many studies of technology evaluation have adopted a single generation model to simulate the diffusion pattern of demand. This approach, however, considers the diffusion of the new technology itself, not taking into account a newer generation that can replace the one just invented. In this paper, we show how a multi-generation technology diffusion model can be applied for more accurate CBA for information technology. Monte Carlo simulation is performed to find influential factors on the CBA of a Cybernetic Building System.
Multiple Replenishment Contract with Purchase Price Discount
Jung, Bong-Ryong ; Kim, Jong-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 345~351
We are concerned with a multiple replenishment contract with a purchase price discount in a supply chain. The chain is composed of one supplier, one buyer and consumers for a product. The replenishment contract is based upon the well-known (s, Q) policy but allows contracting several firmed orders at a time with a price discount. Due to a larger forecast error of the future demand, the buyer should keep a higher level of safety stock to provide the same level of service of the usual (s, Q) policy but can reduce his purchase cost by placing larger quantity. Thus there exists a trade-off between the price discount and inventory holding cost. We present a model for the contract and an algorithm to find the optimum number of the firmed orders. Computer experiments show that the algorithm finds the global optimum solution very fast.
Design of Fractional Factorial Experiments with Four-Level Quantitative and Two-Level Factors
Choi, Kiew-Phil ; Byun, Jai-Hyun ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 352~365
Two-level factorial designs are popular in industry due to their simplicity, efficiency, graphical interpretation, and flexibility in sequential experimentation. However, experimenters are often frustrated when they have factors with more than two levels. There have been some works on design of experiments with two- and four-level factors, which mostly deal with qualitative four-level factors. This paper discusses differences between qualitative and quantitative four-level factors. Optimal designs are provided for some designs with four-level quantitative and two-level factors.
Economic Component Screening Procedures for Multi-Component Products Supplied with Warranty
Chang, Young-Soon ; Bai, Do-Sun ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 366~373
Economic component screening procedures for multi-component assembly products supplied with warranty are proposed. It is assumed that the screening variable is continuous and the performance variable is dichotomous. Logistic and normal models are considered; the proportion of conforming items is a logistic function of the screening variable in the logistic model and the screening variable given the performance variable is normally distributed in the normal model. Cost models are constructed which involve three cost components; screening inspection cost for each component, cost due to disposing a rejected component, and warranty cost for an assembly product. Methods of finding the optimal screening procedures are presented and numerical examples are given.
On the Discrete-Time Version of the Distributional Little's Law
Kim, Nam-Ki ; Chae, Kyung-Chul ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 374~378
We present a discrete-time version of the distributional Little's law, of which the continuous-time version is well known. Then we extend it to the queue in which two or more customers may depart at the same time. As a demonstration, we apply this law to various discrete-time queues such as the standard Geom/G/1 queue, the Geom/G/1 queue with vacations, the multi-server Geom/D/c queue, and the bulk-service Geom/
/1 queue. As a result, we obtain the probability generating functions of the numbers in system/queue and the waiting times in system/queue for those queues.
A Simple Fully Polynomial Approximation Scheme for the Restricted Shortest Path Problem
Hong, Sung-Pil ; Chung, Sung-Jin ; Park, Bum-Hwan ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 379~383
The restricted shortest path problem is known to be weakly NP-hard and solvable in pseudo-polynomial time. Four fully polynomial approximation schemes (FPAS) are available in the literature, and most of these are based on pseudo-polynomial algorithms. In this paper, we propose a new FPAS that can be easily derived from a combination of a set of standard techniques. Although the complexity of the suggested algorithm is not as good as the fastest one available in the literature, it is practical in the sense that it does not rely on the bound tightening phase based on approximate binary search as in Hassin's fastest algorithm. In addition, we provide a review of standard techniques of existing works as a useful reference.
An Optimal Design of Double Carousel System Under Two Class Based Assignment Policy
Kim, Chae-Soo ; Hwang, Hark ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 384~393
The performance of a double carousel system depends on its design and operation strategy. The two-class based assignment policy is expected to be an appropriate storage policy for its efficient operation, since it has two independently-moved carousels, lower and upper sub-carousels. This paper conducts a comparative analysis of the effects of the two-class based assignment policy and those of randomized assignment policy on the throughput of a double carousel system. We also show that, by allowing the sub-carousels not to be equal in size, a further improvement in the throughput can be obtained.
Multi-Interval Discretization of Continuous-Valued Attributes for Constructing Incremental Decision Tree
Baek, Jun-Geol ; Kim, Chang-Ouk ; Kim, Sung-Shick ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 394~405
Since most real-world application data involve continuous-valued attributes, properly addressing the discretization process for constructing a decision tree is an important problem. A continuous-valued attribute is typically discretized during decision tree generation by partitioning its range into two intervals recursively. In this paper, by removing the restriction to the binary discretization, we present a hybrid multi-interval discretization algorithm for discretizing the range of continuous-valued attribute into multiple intervals. On the basis of experiment using semiconductor etching machine, it has been verified that our discretization algorithm constructs a more efficient incremental decision tree compared to previously proposed discretization algorithms.
IP Lookup Table Design Using LC-Trie with Memory Constraint
Lee, Chae-Y. ; Park, Jae-G. ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 406~412
IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor
at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.
Psychophysical Discomfort Evaluation of Complex Trunk Postures
Lee, In-Seok ; Ryu, Hyung-Gon ; Chung, Min-K. ; Kee, Do-Hyung ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 413~423
Low back disorders (LBDs) are one of the most common and costly work-related musculoskeletal disorders. One of the major possible risk factors of LBDs is to work with static and awkward trunk postures, especially in a complex trunk posture involving flexion, twisting and lateral bending simultaneously. This study is to examine the effect of complex trunk postures on the postural stresses using a psychophysical method. Twelve healthy male students participated in an experiment, in which 29 different trunk postures were evaluated using the magnitude estimation method. The results showed that subjective discomfort significantly increased as the levels of trunk flexion, lateral bending and rotation increased. Significant interaction effects were found between rotation and lateral bending or flexion when the severe lateral bending or rotation were assumed, indicating that simultaneous occurrence of trunk flexion, lateral bending and rotation increases discomfort ratings synergistically. A postural workload evaluation scheme of trunk postures was proposed based on the angular deviation levels from the neutral position. Each trunk posture was assigned numerical stress index depending upon its discomfort rating, which was defined as the ratio of discomfort of a posture to that of its neutral posture. Four qualitative action categories for the stress index were also provided in order to enable practitioners to apply corrective actions appropriately. The proposed scheme is expected to be applied to several field areas for evaluating trunk postural stresses.
An Improved Exact Algorithm for the Unconstrained Two-Dimensional Cutting Problem
Gee, Young-Gun ; Kang, Maing-Kyu ;
Journal of Korean Institute of Industrial Engineers, volume 27, issue 4, 2001, Pages 424~431
This paper is concerned with the unconstrained two-dimensional cutting problem of cutting small rectangles (products), each of which has its own profit and size, from a large rectangle (material) to maximize the profit-sum of products. Since this problem is used as a sub-problem to generate a cutting pattern in the algorithms for the two-dimensional cutting stock problem, most of researches for the two-dimensional cutting stock problem have been concentrated on solving this sub-problem more efficiently. This paper improves Hifi and Zissimopoulos's recursive algorithm, which is known as the most efficient exact algorithm, by applying newly proposed upper bound and searching strategy. The experimental results show that the proposed algorithm has been improved significantly in the computational amount of time as compared with the Hifi and Zissimopulos's algorithm.