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
Decision-making Problems for the Operation of Container Terminals
Kim, Kap Hwan ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 290~302
This paper introduces several decision-making problems that need to be solved in order to facilitate the efficient operation of container terminals. These decision-making problems include the berth planning problem, the quay crane scheduling problem, the unload/load sequencing problem, the yard allocation problem, and the short-term scheduling of transporters and yard cranes. These problems can be classified into strategic decision problems, tactical decision problems, and real time operational decision problems. This paper proposes definitions of the problems that can be used to develop mathematical models for the problems.
A Heuristic Algorithm for Multi-path Orienteering Problem with Capacity Constraint
Hwang, Hark ; Park, Keum Ae ; Oh, Yong Hui ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 303~311
This study deals with a type of vehicle routing problem faced by manager of some department stores during peak sales periods. The problem is to find a set of traveling paths of vehicles that leave a department store and arrive at a destination specified for each vehicle after visiting customers without violating time and capacity constraints. The mathematical model is formulated with the objective of maximizing the sum of the rewards collected by each vehicle. Since the problem is known to be NP-hard, a heuristic algorithm is developed to find the solution. The performance of the algorithm is compared with the optimum solutions obtained from CPLEX for small size problems and a priority-based Genetic Algorithm for large size problems.
Optimal Disposal Policy in a Hybrid Production System with Manufacturing and Remanufacturing
Kim, Eun Gab ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 312~321
We address a disposal issue of returned products in a product recovery system where a single product is stocked in order to meet a demand from customers who may return products after usage. Product returns occur randomly and can be accepted for remanufacturing or disposed of depending on the state of the system. We examine the structure of the optimal disposal policy for returned product that utilizes the information of the inventory of both serviceable and remanufacturable products. Numerical study indicates that it can be characterized by a monotonic threshold type of the curve. A disposal is allowed only when the remanufacturable inventory level exceeds a threshold which is the function of the inventory level of serviceable product and it is decreasing as the serviceable inventory level increases. Sensitivity analysis also indicates that the optimal disposal policy and the optimal profit have monotonic properties with respect to system parameters.
Optimal Allocation of Purchase Orders in Dynamic Bidding
Rim, Suk-Chul ; Lee, Sang-Won ; Kim, Hyun-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 322~328
Highly standardized products are suitable for automated purchasing using electronic commerce technology, where the price becomes the most important factor. Suppliers can change the prices dynamically based on the inventory level and market situation in order to maximize the sales and profit. In the virtual marketplace where multiple customers purchase multiple standardized products from multiple suppliers repetitively, customers can purchase the required amount of each item as a dynamic bidding by allocating purchase orders to the suppliers based on the current price. Customers need a method to quickly determine the optimal allocation of orders to the suppliers using the dynamically changing data to minimize the total cost. We present a LP model which minimizes the sum of the total price plus transportation cost for this problem. Simulation results using random data show meaningful reduction of the total cost.
Scheduling Algorithm for Nonidentical Parallel Machines Problem with Rework
Kang, Yong Ha ; Kim, Sung Shick ; Park, Jong Hyuck ; Shin, Hyun Joon ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 329~338
This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.
New Customer Segmentation and Purchase-forecasting Using Changes in Customer Behavior
Do, Hee Jung ; Kim, Jae Yearn ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 339~348
Since the 1980s, the marketing paradigm has rapidly changed from product-driven marketing to customer-driven marketing. Recently, due to an increase in the amount of information, customer-differentiation strategies have been emphasized more than product-differentiation strategies. This paper suggests a methodology for new customer segmentation and purchase forecasting using changes in customer behavior. This methodology includes a segmentation method for new customers using existing customer's characteristics and a purchase-forecasting system using the purchase-behavior patterns of existing customers. The proposed methodology not only provides differential services from a segmentation system but also recommends differential items from the purchase forecasting system for new and existing customers.
An Economic Screening Method for Mixture Experiments Using Correlation Coefficients
Kim, Jeong-Suk ; Byun, Jai-Hyun ; Choi, Kyungmee ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 349~354
A mixture experiment is a special type of the response surface experiment in which the factors are the components of a mixture, and the response variable is a function of the proportions of each component. When a new mixture product is developed, there are a large number of components, and the first objective of the experiment is to identify the ones that are most important by doing a screening experiment. We propose a method of screening mixture components using the correlation coefficients when t-tests cannot identify significant components.
Automatic Work Time Evaluation Based on a Verification of Disassemblability and Assembly Configuration
Shin, Chul Kyun ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 355~363
This paper presents a method of an automatic work time evaluation based on the verification of a disassemblability and assembly configuration. Even though a work time evaluation is an important field of concern for planning assembly lay-out, there are some limitations using cumbersome user query or approximated work time data without considering assembly condition. To overcome such restriction, this paper presents a method to mathematically verify assembly conditions based on the disassemblability, which is defined by the separability and stability cost. The separability cost represents a facility of the part disassembly operation, and the stability cost which represents a degree of the stability for the base assembly motion. Based upon the results, we propose a new approach of evaluating work time using neural networks. The proposed method provides an effective means of solving the work time evaluation problem and gives a design guidance of planning assembly lay-out in flexible manufacturing application. Example study is given to illustrate the concepts and procedure of the proposed schemes.
Relationship Between Yield and Cost Considering Repair and Rework for LCD Manufacturing System
Ha, Chunghun ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 364~372
The cost modeling of the LCD manufacturing system with the repair and the rework process is hard to achieve because of it's complex manufacturing process. The technical cost modeling divides each process separately and hierarchically, so it is very useful to calculate the total manufacturing cost of the complex manufacturing system. We applied the method to the complex LCD manufacturing system to obtain more accurate cost model. Yields are the most important control parameters in manufacturing. In this paper, we propose a yield based cost model for the LCD manufacturing system and reveal the relationship between manufacturing yield and cost. Through the model, we can estimate the manufacturing cost on the basis of yields that are control indicators of manufacturing. Some simulations are performed to observe the effects of the yield to the cost, and the results are coincide with the real situation. With the proposed model, we expect to develop some optimization problems for enlarging productivity in the LCD industry.
An Alternative Modeling for Lot-sizing and Scheduling Problem with a Decomposition Based Heuristic Algorithm
Han, Junghee ; Lee, Youngho ; Kim, Seong-in ; Park, Eunkyung ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 373~380
In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.
802.11 Ad Hoc LANs with Realistic Channels : Study of Packet Fragmentation
Kim, Chesoong ; Lee, Seokjun ; Lyakhov, Andrey ; Vishnevsky , Vladimir ;
Journal of Korean Institute of Industrial Engineers, volume 33, issue 3, 2007, Pages 381~392
In this paper, we present an analytical method for estimating the saturation throughput of an 802.11 ad hoc LAN in the presence of noise distorting transmitted frames. This is the first method that allows studying analytically the 802.11 network performance with consideration of correlated channel failures usually inherent to realistic wireless channels. With the study, we consider the possible packet fragmentation that can be adopted to reduce the performance degradation caused by noise-induced distortions. In addition to the throughput, our method allows estimating the probability of a packet rejection occurring when the number of packet transmission retries attains its limit. The obtained numerical results of investigating 802.11 LANs by the developed method are validated by simulation and show high estimation accuracy as well as the method efficiency in determining the optimal fragmentation threshold.