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 32, Issue 4 - Dec 2006
Volume 32, Issue 3 - Sep 2006
Volume 32, Issue 2 - Jun 2006
Volume 32, Issue 1 - Mar 2006
Selecting the target year
Production-and-Delivery Scheduling with Transportation Mode Selection Allowed
Cho, Jung Keun ; Lee, Ik Sun ; Sung, Chang Sup ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 163~171
This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.
Analysis on the Bargaining Game Using Artificial Agents
Chang, Seok-cheol ; Soak, Sang-moon ; Yun, Joung-il ; Yoon, Jung-won ; Ahn, Byung-ha ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 172~179
Over the past few years, a considerable number of studies have been conducted on modeling the bargaining game using artificial agents on within-model interaction. However, very few attempts have been made at study on between-model interaction. This paper investigates the interaction and co-evolutionary process among heterogeneous artificial agents in the bargaining game. We present two kinds of the artificial agents participating in the bargaining game. They play some bargaining games with their strategies based on genetic algorithm (GA) and reinforcement learning (RL). We compare agents' performance between two agents under various conditions which are the changes of the parameters of artificial agents and the maximal number of round in the bargaining game. Finally, we discuss which agents show better performance and why the results are produced.
Valuation and Optimal Timing of the Investment in Next Generation Telecommunication Service Using Real Options
Lim, Kum-Soon ; Lee, Deok-Joo ; Kim, Ki-Hong ; Oh, Hyung-Sik ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 180~190
We evaluate the economic value and the optimal investment timing of IMT-2000 in Korea, in the perspective of a service provider who owns the business license for IMT-2000, by using the real options analysis. The result clearly shows the project value with options is positive and delaying the investment is more favorable to the provider. Binomial lattice approach, in which we try to describe American call option and sequential compound option, and sensitivity analysis present the optimal decisions according to future states and enable the management to make decision strategically and proactively.
Design of a Distributed Enactment Model for Business Process Management
Hur, Wonchang ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 191~199
Effective management of business processes is a crucial issue to every enterprise in e-business environment. What's needed is a new framework of applications that can automatically manage distributed and heterogeneous business processes that span multiple functions of a company. In this paper, we propose technical design of a new enactment model that can coordinate such business process that involves multiple functional units or even multiple companies. In our approach, a process model is decomposed into several structural units, called 'process block', according to their procedural characteristics. Each of them is controlled by autonomous enactment units that can communicate with each other using a mutually agreed coordination protocol. The protocol takes the use of 'associative communication' concept, which allows the autonomy for each unit and secure the correctness of process execution.
Agent-based Shipment Algorithm for Capacitated Vehicle Routing Problem with Load Balancing
Oh, Seog-Chan ; Yee, Shang-Tae ; Kim, Taioun ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 200~209
Load building is an important step to make the delivery supply chain efficient. We present a family of load makeup algorithms using market based control strategy, named LoadMarket, in order to build efficient loads where each load consists of a certain number of finished products having destinations. LoadMarket adopts Clark-Wright algorithm for generating initial endowment for Load Traders who cooperate to minimize either total travel distance or the variance with respect to the travel distances of loads by means of the spot market or double-sided auction market mechanism. The efficiency of the LoadMarket algorithms is illustrated using simulation based experiments.
Development of Integrated Variable Sampling Interval EngineeringProcess Control & Statistical Process Control System
Lee, Sung-Jae ; Seo, Sun-Keun ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 210~218
Traditional statistical process control (SPC) applied to discrete part industry in the form of control charts can look for and eliminate assignable causes by process monitoring. On the other hand, engineering process control (EPC) applied to the process industry in the form of feedback control can maintain the process output on the target by continual adjustment of input variable. This study presents controlling and monitoring rules adopted by variable sampling interval (VSI) to change sampling intervals in a predetermined fashion on the predicted process levels under integrated EPC and SPC systems. Twelve rules classified by EPC schemes(MMSE, constrained PI, bounded or deadband adjustment policy) and type of sampling interval combined with EWMA chart of SPC are proposed under IMA (1,1) disturbance model and zero-order (responsive) dynamic system. Properties of twelve control rules under three patterns of process change (sudden shift, drift and random shift) are evaluated and discussed through simulation and control rules for integrated VSI EPC and SPC systems are recommended.
An Integer Programming Approach to Packing Lightpaths on WDM Networks
Lee, Kyungsik ; Lee, Taehan ; Park, Sungsoo ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 219~225
We consider a routing and wavelength assignment (RWA) for the efficient operation of WDM networks. For a given physical network, a set of selected pairs of nodes, the number of required connections for each selected pair of nodes, and a set of available wavelengths, the RWA is to realize as many connections as possible without wavelength collision. We give an integer programming formulation and an algorithm based on column generation. Though the proposed algorithm does not guarantee optimal solutions, test results show that the algorithm gives probably good solutions.
Heuristic Algorithm for Searching Multiple Paths
Shin, Yongwook ; Yang, Taeyong ; Baek, Won ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 226~235
Telematics is expected to be one of the fastest growing businesses in information technology area. It may create a new emerging market in industry related to automotive, telecommunications, and information services. Especially vehicle navigation service is considered as a killer application among telematics service applications. The current vehicle navigation service typically recommends a single path that is based on the traveling time or distance from the origin to the destination. The system provides two options for users to choose either via highway or via any road. Since the traffics and road conditions of big cities are very complicated and dynamic, the demand of multi-path guidance system is increasing in telematics market. The multi-path guidance system should allow drivers to choose a path based on their individual preferences such as traveling time, distance, or route familiarity. Using the Lawler's algorithm, it is possible to find multiple paths; however, due to the lengthy computational time, it is not suitable for the real-time services. This study suggests a computationally feasible and efficient heuristic multiple paths finding algorithm that is reliable for the real-time vehicle navigation services.
Determination of Proper Monitor Height based on the Musculoskeletal Load and Preference during VDT Monitoring Tasks
Lee, Joongho ; Song, Young Woong ; Na, Seokhee ; Chung, Min Keun ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 236~241
Monitor height is one of the key factors in the VDT workstation design. Most of the previous studies have focused on traditional VDT workplace where the operators performed data entry or word processing tasks using single monitor. This study aimed to suggest proper monitor height when the main task was monitoring information from different number of information sources. Twelve male students participated in three experiments: single information source (one monitor), two information sources (one monitor and one CCTV), and three information sources (one monitor, one CCTV and a window). Subjects performed monitoring tasks for 10 minutes with 3 different monitor center heights : 89.0 cm (Low), 111.3 cm (Middle), and 124.8 cm (High). Surface EMG signals of five neck muscles, subjective discomfort ratings, preference, and working postures were recorded. Results indicated that the middle height was proper for one monitor condition, but the low monitor height was recommended for more than two information sources.
An Efficient Algorithm for Mining Frequent Closed Itemsets Using Transaction Link Structure
Han, Kyong Rok ; Kim, Jae Yearn ;
Journal of Korean Institute of Industrial Engineers, volume 32, issue 3, 2006, Pages 242~252
Data mining is the exploration and analysis of huge amounts of data to discover meaningful patterns. One of the most important data mining problems is association rule mining. Recent studies of mining association rules have proposed a closure mechanism. It is no longer necessary to mine the set of all of the frequent itemsets and their association rules. Rather, it is sufficient to mine the frequent closed itemsets and their corresponding rules. In the past, a number of algorithms for mining frequent closed itemsets have been based on items. In this paper, we use the transaction itself for mining frequent closed itemsets. An efficient algorithm is proposed that is based on a link structure between transactions. Our experimental results show that our algorithm is faster than previously proposed methods. Furthermore, our approach is significantly more efficient for dense databases.