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 35, Issue 4 - Dec 2009
Volume 35, Issue 3 - Sep 2009
Volume 35, Issue 2 - Jun 2009
Volume 35, Issue 1 - Mar 2009
Selecting the target year
An Improved Ant Colony System for Parallel-Machine Scheduling Problem with Job Release Times and Sequence-Dependent Setup Times
Joo, Cheol-Min ;
Journal of Korean Institute of Industrial Engineers, volume 35, issue 4, 2009, Pages 218~225
This paper considers a parallel-machine scheduling problem with job release times and sequence-dependent setup times. The objective of this problem is to determine the allocation policy of jobs and the scheduling policy of machines so as to minimize the weighted sum of setup times, delay times, and tardy times. A mathematical model for optimal solution is derived and a meta heuristic algorithm based on the improved ant colony system is proposed in this paper. The performance of the meta heuristic algorithm is evaluated through compare with optimal solutions using randomly generated several examples.
Services Innovation : Research Framework and Research Issues
Kim, Kwang-Jae ; Hong, Yoo-S. ; Shin, Dong-Min ; Cho, Nam-Wook ; Jung, Jae-Yoon ; Lee, Yeon-Hee ; Park, Ha-Young ; Hong, Jung-Wan ; Kang, Wan-Mo ; Shin, Ha-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 35, issue 4, 2009, Pages 226~247
The competitiveness of the service sector is driven by its productivity. Services innovation is essential to enhancing service productivity. This paper first presents a framework for services innovation. The framework consists of three main phases of a service lifecycle (namely, service development, service operation, and service improvement), which are supported by IT infrastructure and service R&D management functions. This paper then identifies major research issues that should be investigated in the near future. The current issues of three representative service industries (namely, healthcare service, telecommunications service, and financial service) are also discussed.
Analytic Model for Performance Evaluation of Asynchronous MAC Protocol in Wireless Sensor Networks
Jung, Sung-Hwan ; Kwon, Tae-Kyoung ;
Journal of Korean Institute of Industrial Engineers, volume 35, issue 4, 2009, Pages 248~256
In this paper, under saturated traffic condition in a single-hop wireless sensor network, we present an analytic model that evaluates the performance of asynchronous MAC protocol which uses a preamble technique. Our model considers the impact of several important factors such as sleep cycle, the backoff mechanism and the number of contending nodes. After obtaining the cumulative backoff time of a sending node and expected delay of a receiving node, an iterative algorithm is presented for calculating the performance measures such as expected energy consumption usage per packet and latency. Simulation results show that the proposed analytic model can accurately estimate the performance measures under saturated traffic conditions.
Surrogate Objective based Search Heuristics to Minimize the Number of Tardy Jobs for Multi-Stage Hybrid Flow Shop Scheduling
Choi, Hyun-Seon ; Kim, Hyung-Won ; Lee, Dong-Ho ;
Journal of Korean Institute of Industrial Engineers, volume 35, issue 4, 2009, Pages 257~265
This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel machines at each stage as well as the sequence of the jobs assigned to each machine. Due to the complexity of the problem, we suggest search heuristics, tabu search and simulated annealing algorithms with a new method to generate neighborhood solutions. In particular, to evaluate and select neighborhood solutions, three surrogate objectives are additionally suggested because not much difference in the number of tardy jobs can be found among the neighborhoods. To test the performances of the surrogate objective based search heuristics, computational experiments were performed on a number of test instances and the results show that the surrogate objective based search heuristics were better than the original ones. Also, they gave the optimal solutions for most small-size test instances.
A Scheduling Algorithm for Workstations with Limited Waiting Time Constraints in a Semiconductor Wafer Fabrication Facility
Joo, Byung-Jun ; Kim, Yeong-Dae ; Bang, June-Young ;
Journal of Korean Institute of Industrial Engineers, volume 35, issue 4, 2009, Pages 266~279
This paper focuses on the problem of scheduling wafer lots with limited waiting times between pairs of consecutive operations in a semiconductor wafer fabrication facility. For the problem of minimizing total tardiness of orders, we develop a priority rule based scheduling method in which a scheduling decision for an operation is made based on the states of workstations for the operation and its successor or predecessor operation. To evaluate performance of the suggested scheduling method, we perform simulation experiments using real factory data as well as randomly generated data sets. Results of the simulation experiments show that the suggested method performs better than a method suggested in other research and the one that has been used in practice.