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 34, Issue 4 - Dec 2008
Volume 34, Issue 3 - Sep 2008
Volume 34, Issue 2 - Jun 2008
Volume 34, Issue 1 - Mar 2008
Selecting the target year
An Overview of Inventory Management with Some Suggested Research Topics
Silver, Edward A. ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 373~385
This paper presents an overview of inventory management. This includes a categorization, by a number of dimensions, of inventory problems and associated models. Relevant literature references are provided within the dimensions. The paper points out the continuing gap between theory and practice, followed by a number of suggested research topics to help bridge the gap.
Modeling and Evaluating Inventory Replenishment for Short Life-cycle Products
Wang, Ching-Ho ; Lint, Shih-Wei ; Chou, Shuo-Yan ; Tsai, Chun-Hsiang ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 386~397
Due to the rapid advancement of technologies, a growing number of innovative products with a short life-cycle have been introduced to the market. As the life-cycles of such products are shorter than those of durable goods, the demand variation during the life-cycle adds to the difficulty of inventory management. Traditional inventory planning models and techniques mostly deal with products that have long life-cycles. The assumptions on the demand pattern and subsequent solution approaches are generally, not suitable for dealing with products with short life-cycles. In this research, inventory replenishment problems based on the logistic demand model are formulated and solved to facilitate the management of products with short life-cycles. An extended Wagner- Whitin approach is used to determine the replenishment cycle, schedules and lot-sizes.
Joint Decision of Optimal Procurement Policy and Optimal Order ize for a Product Recovery System
Kim, Eungab ; Jeong, Bongju ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 398~407
We consider a product recovery system that a single product is stocked in order to meet a demand from customers who may return products after usage. This paper addresses a problem of when to release a procurement process to replenish serviceable inventory and how many new products to procure. The structure of the optimal procurement policy is examined and numerically identified as a monotonic threshold curve. A numerical procedure is presented to jointly find the optimal procurement order size, optimal procurement policy, and optimal discounted profit. Sensitivity analysis also indicates that these optimal performance measurements have monotonic properties with respect to system parameters.
The Heuristic Approach to the Order Consolidation Problem
Park, Jongho ; Lim, Kyungkuk ; Choi, Bongha ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 408~413
We consider the batch processing of orders where either whole or part of a single order or a specific pair of different orders may be grouped in a batch within a fixed capacity. Our objective is to maximize the total number of batches filled up to the batch size. In this paper, we study the Level-2 problem where at most 2 kinds of orders can be grouped in a batch. This problem is known to be NP-hard and Max SNP-hard. So we develop heuristic algorithm and evaluate the performance of the algorithm.
An Exact Algorithm for Two-Level Disassembly Scheduling
Kim, Hwa-Joong ; Lee, Dong-Ho ; Xirouchakis, Paul ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 414~424
Disassembly scheduling is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts or components over a given planning horizon. This paper considers the two-level disassembly structure that describes a direct relationship between the used product and its parts or components. To formulate the problem mathematically, we first suggest an integer programming model, and then reformulate it to a dynamic programming model after characterizing properties of optimal solutions. Based on the dynamic programming model, we develop a polynomial exact algorithm and illustrate it with an example problem.
Dynamic Operation Policy for Vendor-Managed Inventory using Fixed Production Schedule
Hyun, Hye-Mi ; Rim, Suk-Chul ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 425~432
While the Vendor-Managed Inventory(VMI) is a convenient inventory replenishment policy for the customer company, the supplier usually bears the burden of higher inventory and urgent shipments to avoid shortage. Recently some manufacturers begin to fix the production schedule for the next few days (such as three days). Utilizing that information can improve the efficiency of the VMI. In this study, we present a myopic optimization model using a mixed inter programming; and a heuristics algorithm. We compare the performance of the two proposed methods with the existing (s, S) reorder policy. We consider the total cost as the sum of transportation cost and inventory cost at the customer's site. Numerical tests indicate that the two proposed methods significantly reduce the total cost over the (s, S) policy.
A Methodological Model for Effective RFID System Development
Youm, Se-Kyoung ; Lee, Yong-Han ; Kim, Hoon-Tae ; Rhee, Jong-Tae ; Cho, Sung-Ku ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 433~444
With development of RFID technology, medicine and national defense as well as logistics and distribution industries have tried to adopt RFID system. Small projects as well as large national projects have planned to adopt the new technology. However, a lot of companies that have promoted a RFID-based project have confronted many problems due to a lack of information about demonstration projects and absence of systematic guideline. Therefore, it's urgent to develop a practical and useful guideline for companies that have considered to adopt the RFID system. In this paper, a practical framework to adopt RFID system is suggested by five phases : establishment of project plan, analysis of objectives, selection of equipments, development/installation, and operation/post management phases. Besides, a detail method by each stages is also given. A systematic RFID system adoption procedure has been defined through an analysis on demonstrated projects and interview with an expert and the adoption method by stage has been suggested. The purpose of this paper is to minimize the entry barriers by suggesting a practical RFID adoption procedure.
Study on the Call Admission Control in the Broadband OFDMA Wireless Communication Systems
Paik, Chun-Hyun ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 445~459
This paper addresses a call admission control(CAC) scheme giving handoff calls a priority over new calls for OFDMA wireless communication systems. The characteristics of OFDMA system and a variety of user QoS (Quality of Service) requirements are incorporated into the proposed CAC scheme which consists of several optimization modules for the system resource(subcarriers and power) allocations. The mathematical models and its solution methods for the embedded resource allocation problems are proposed. Some extensive computational experiments are conducted to illustrate the superiority of our CAC.
Improving Process Mining with Trace Clustering
Song, Min-Seok ; Gunther, C.W. ; van der Aalst, W.M.P. ; Jung, Jae-Yoon ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 460~469
Process mining aims at mining valuable information from process execution results (called "event logs"). Even though process mining techniques have proven to be a valuable tool, the mining results from real process logs are usually too complex to interpret. The main cause that leads to complex models is the diversity of process logs. To address this issue, this paper proposes a trace clustering approach that splits a process log into homogeneous subsets and applies existing process mining techniques to each subset. Based on log profiles from a process log, the approach uses existing clustering techniques to derive clusters. Our approach are implemented in ProM framework. To illustrate this, a real-life case study is also presented.
On Optimal Design Methods for Steel Product Pallets
Park, Jong-Ho ; Lim, Kyung-Kuk ; Lee, Jeong-Won ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 470~480
Loading steel coil products on a specialized packing case called pallet can be represented as a bin-packing problem with the special constraint where objects should be loaded on designated positions of bins. In this paper, under assuming that there exist only two types of objects, we focus on finding the optimum number of positions in a bin which minimizes the number of bins needed for packing a collection of objects. Firstly, we propose a method to decide the number of positions and prove that the method is optimum. Finally, for the packing problem using bins designed by the method, we show that the well-known algorithm, First-Fit Decreasing(FFD), is the optimum algorithm.
Production Scheduling for a Two-machine Flow Shop with a Batch Processing Machine
Koh, Shie-Gheun ; Koo, Pyung-Hoi ; Kim, Byung-Nam ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 4, 2008, Pages 481~488
This paper deals with a scheduling problem for two-machine flow shop, in which the preceding machine is a batch processing machine that can process a number of jobs simultaneously. To minimize makespan of the system, we present a mixed integer linear programming formulation for the problem, and using this formulation, it is shown that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of a real problem is very large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify performances of the algorithms, we compare them with lower bound for the problem. From the results of these computational experiments, some of the heuristic algorithms show very good performances for the problem.