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 31, Issue 4 - Dec 2005
Volume 31, Issue 3 - Sep 2005
Volume 31, Issue 2 - Jun 2005
Volume 31, Issue 1 - Mar 2005
Selecting the target year
A Multiobjective Process Planning of Flexible Assembly Systems with Evolutionary Algorithms
Shin, Kyoung Seok ; Kim, Yeo Keun ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 180~193
This paper deals with a multiobjective process planning problem of flexible assembly systems(FASs). The FAS planning problem addressed in this paper is an integrated one of the assignment of assembly tasks to stations and the determination of assembly routing, while satisfying precedence relations among the tasks and flexibility capacity for each station. In this research, we consider two objectives: minimizing transfer time of the products among stations and absolute deviation of workstation workload(ADWW). We place emphasis on finding a set of diverse near Pareto or true Pareto optimal solutions. To achieve this, we present a new multiobjective coevolutionary algorithm for the integrated problem here, named a multiobjective symbiotic evolutionary algorithm(MOSEA). The structure of the algorithm and the strategies of evolution are devised in this paper to enhance the search ability. Extensive computational experiments are carried out to demonstrate the performance of the proposed algorithm. The experimental results show that the proposed algorithm is a promising method for the integrated and multiobjective problem.
A Study on Dynamic Lot Sizing Problem with Random Demand
Kim, Chang Hyun ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 194~200
A stochastic dynamic lot sizing problem for multi-item is suggested in the case that the distribution of the cumulative demand is known over finite planning horizons and all unsatisfied demand is fully backlogged. Each item is produced simultaneously at a variable ratio of input resources employed whenever setup is incurred. A dynamic programming algorithm is proposed to find the optimal production policy, which resembles the Wagner-Whitin algorithm for the deterministic case problem but with some additional feasibility constraints.
Calculating Empty Moves in Transportation Networks
Kim, Kap Hwan ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 201~209
Empty moves are necessary when there are imbalances among transportation demands from source locations to destination locations and the transportation demands require empty equipment that must be supplied to source locations. When the amount of the inflow exceeds that of the outflow or the amount of the outflow exceeds that of the inflow, repositioning empty equipment is necessary. Examples of the empty equipment are containers, chassis, and pallets. This paper addresses how to estimate the empty moves on several typical transportation networks. Types of transportation networks considered are chain, tree, cycle, tree of cycles, and hybrid networks. Simple procedures are suggested for determining the optimal empty flows. Numerical examples are provided to illustrate procedures in this paper.
A Producer's Allocation Policy Considering Buyers' Demands in the Supply Chain
Eum, Seung Chul ; Lee, Young Hae ; Jung, Jung Woo ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 210~218
In the current global business environment, it is very important how to allocate products from the producer to buyers (or distributors). Sometimes some buyers can order more than pertinent demand due to inappropriate forecasting customers' orders. This is the big obstacle to the efficient allocation of products. If the producer can become aware of buyers' pertinent demand, it is possible to realize the high-level order fulfillment through the effective allocation of products. In this study, a new allocation policy is proposed considering buyers' demands. The backpropagation algorithm, one of algorithms in neural network theory, is used to find pertinent demands from the distributors' orders. In the experiment, an allocation policy considering buyers' demands outperforms previous allocation policies.
Two-Level Power and Rate Allocation Scheme on the Forward Link for Multicell CDMA Data Users
Chang, Kun-Nyeong ; Lee, Ki-Dong ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 219~227
In this paper, an optimal power and rate allocation model is mathematically formulated on the forward link of multicell CDMA mobile systems. The model maximizes total utility considering data rates and fairness among cells under delay and PRER (Post RPL Error Rate) constraints. The two-level power and rate allocation scheme is suggested to solve the proposed model. Experimental results show that the proposed scheme provides a good solution in a fast time.
Study on the Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction
Lee, Sang-Heon ; Lee, Jung-Man ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 228~239
In this paper, we propose a new conceptual HVRPCR(Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction) model including additional restrictions that are consisted of loadage limit and possible visit number of demand post in HVRP. We propose HVRPCR algorithm using the heuristic in order to solve speedily because VRP is NP-Hard and need many solution time. The proposed model is simulated with changing demand post location, demand weight, loading and possible visit number limitation. Results of the computational experiment are provided along with some analysis like travel cost reduction rate.
Multi-product Remanufacturing Planning on a Single Facility
Joo, Un Gi ; Lee, Choong-ho ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 240~247
Today's hightech society requires thousands of different products which ultimately result in billions of tons of materials discarded, most of which end up in landfills. Therefore industrial circles could not help thinking about environmental problems by regulations of government or pressures of consumer. Generally, the related research subjects are classified into both of environmentally conscious manufacturing and product recovery, where product recovery aims to minimize the amount of waste sent to landfills by recovering materials and parts from old or outdated products by means of recycling and remanufacturing (including reuse of parts and products). In this research, we constructed a model for remanufacturing various goods using a single facility and developed a dynamic programing(DP) algorithm based upon the optimal solution characterization. We showed the efficiency of the developed DP algorithm with a numerical example.
Comparative Analysis of Two EOQ based Inventory Models
Jung, Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 248~256
In this paper, we compare two EOQ based inventory models under total cost minimization and profit maximization to investigate the difference in the optimal solutions. First of all, optimal solutions for both models through geometric programming (GP) techniques are found considering production (lot sizing) as well as marketing (pricing) decisions. An investigation of the effects of the changes in the optimal solutions according to varied parameters is performed by studying optimality conditions as well as by performing numerical analysis. We then conduct comparative analysis between the models to show the relationships between the optimal solutions of the models where certain conditions in the cost per unit and the demand per unit time are given. Several interesting economic implications and managerial insights are observed from this analysis.
A Clustering Algorithm using Self-Organizing Feature Maps
Lee, Jong-Sub ; Kang, Maing-Kyu ;
Journal of Korean Institute of Industrial Engineers, volume 31, issue 3, 2005, Pages 257~264
This paper suggests a heuristic algorithm for the clustering problem. Clustering involves grouping similar objects into a cluster. Clustering is used in a wide variety of fields including data mining, marketing, and biology. Until now there are a lot of approaches using Self-Organizing Feature Maps(SOFMs). But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of k output-layer nodes, if they want to make k clusters. This approach has problems to classify elaboratively. This paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We can find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. We use the well known IRIS data as an experimental data. Unsupervised clustering of IRIS data typically results in 15 - 17 clustering error. However, the proposed algorithm has only six clustering errors.