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 23, Issue 4 - Dec 1997
Volume 23, Issue 3 - Sep 1997
Volume 23, Issue 2 - Jun 1997
Volume 23, Issue 1 - Mar 1997
Selecting the target year
Tabu Search Heuristics for Solving a Class of Clustering Problems
Jung, Joo-Sung ; Yum, Bong-Jin ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 451~467
Tabu search (TS) is a useful strategy that has been successfully applied to a number of complex combinatorial optimization problems. By guiding the search using flexible memory processes and accepting disimproved solutions at some iterations, TS helps alleviate the risk of being trapped at a local optimum. In this article, we propose TS-based heuristics for solving a class of clustering problems, and compare the relative performances of the TS-based heuristic and the simulated annealing (SA) algorithm. Computational experiments show that the TS-based heuristic with a long-term memory offers a higher possibility of finding a better solution, while the TS-based heuristic without a long-term memory performs better than the others in terms of the combined measure of solution quality and computing effort required.
Combinatorial Approach for Solving The Layout Design Problem
Cho, Moon-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 469~485
The Shortest Flow-generating Path Problem in the Generalized Network
Chung, S.J. ; Chung, E.S. ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 487~500
In this paper, we introduce the shortest flow-generating path problem in the generalized network. As the simplest generalized network model, this problem captures many of the most salient core ingredients of the generalized network flows and so it provides both a benchmark and a point of departure for studying more complex generalized network models. We show that the generalized label-correcting algorithm for the shortest flow-generating path problem has O(mn) time complexity if it starts with a good point and also propose an O(
) algorithm for finding a good starting point. Hence, the shortest flow-generating path problem is solved in O(
The Analysis of the Role of Production Input Control in a Job Shop Manufacturing Environment Considering Customers and Suppliers
Kim, Hyun-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 501~514
Manufacturing is fast entering a new age of industrial excellence that is being called "Agile Manufacturing." The goal of Agile Manufacturing is to link customers, suppliers, and the manufacturing system into a super-efficient confederation to produce a variety of products quickly and at a low cost. In order to improve the quality of the study of production input control(PIC) in a job shop manufacturing system by reducing the significant gap between research models and models of actual manufacturing systems, the previous line of research on PICs in a job shop manufacturing system is extended by integrating customers and suppliers with the manufacturing system. Then, a set of measures is developed to evaluate PICs, measures that reflect concerns of customers and suppliers as well as concerns of the manufacturer. Also, a weighted overall measure (with various cases to represent different possible weights of manufacturer's emphasis on the performance measures) is used to synthesize all the performance measures. Then, for each case, various existing PICs are evaluated in combination with various priority dispatching rules(PDRs).
A Genetic Algorithm for Improving the Workload Smoothness in Mixed Model Assembly Lines
Kim, Yeo-Keun ; Lee, Soo-Yeon ; Kim, Yong-Ju ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 515~532
When balancing mixed model assembly lines (MMALs), workload smoothness should be considered on the model-by-model basis as well as on the station-by-station basis. This is because although station-by-station assignments may provide the equality of workload to workers, it causes the utilization of assembly lines to be inefficient due to the model sequences. This paper presents a genetic algorithm to improve the workload smoothness on both the station-by-station and the model-by-model basis in balancing MMALs. Proposed is a function by which the two kinds of workloads smoothness can be evaluated according to the various preferences of line managers. To enhance the capability of searching good solutions, our genetic algorithm puts emphasis on the utilization of problem-specific information and heuristics in the design of representation scheme and genetic operators. Experimental results show that our algorithm can provide better solutions than existing heuristics. In particular, our algorithm is outstanding on the problems with a larger number of stations or a larger number of tasks.
Generation of Visual Field Considering 8 Meridians and Background Conditions of Visual Tasks
Kee, Do-Hyung ; Kim, Hyung-Su ; Jung, Eui-S. ; Kang, Dong-Seok ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 533~544
Among numerous factors that have an effect on visual field, the effects of background condition on the size of the visual field were investigated to obtain more practical visual field that can be readily applicable to industrial settings. A visual experiment was conducted, in which the subject was instructed to search a target with distinct orientations. Size contrast, meridian, nontarget density, and subject's gender showed a significant effect on the size of the visual field at
. The size of the visual field was linearly proportional to size contrast, and inversely proportional to density. Female's visual fields were found to be significantly larger than male subjects', The size of the visual field on horizontal axis was larger than that on vertical axis, and the size of the head & eye field on right meridian was also larger than that on left meridian. The shape was found to be horizontally oriented oval and statistically asymmetric with respect to horizontal and vertical axes. The regression equations to predict the visual fields on the given background condition were suggested. The visual fields suggested in this study would be valuable to the design of visual displays and the panel layout of various displays and controls.
Dynamic Optimal Pricing for New Products in a Duopoly
Jun, Duk-Bin ; Choi, Li-Koon ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 545~557
This paper deals with dynamic optimal pricing for new products by a firm which maximizes the discounted profit stream of it's own in a duopoly. The problem is constructed as differential games and dynamic optimization theory. Cost is assumed to decline as time goes on. A modified customer's choice model is formulated as a diffusion model and we solve a dynamic optimization problem by adopting the diffusion model. Since this paper focus on deriving real prices not showing a time trend, we formulate recursive form equations of costate variables(shadow price) and a simultaneous equation of price. Hence we derive a dynamic optimal pricing model for using in real market. In particular, we construct a dynamic optimal pricing model in the case that there are benefits from not only new subscribers but also previous subscribers. We analyze instant camera market in U.S.A(1976-1985) by utilizing the above model.
A Study on a Congestion-free Design of AGV System
Park, Yun-Sun ; Park, Dae-Hee ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 559~580
It is essential to construct on efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System(AGVS) ploys a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs became complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for partitioning the AGV system by introducing the concept of Central Path. This method named Central Path design has advantages, since each partitioned workstation group is served by one AGV and the material handling between groups is performed by special AGV that is used for the Central Path. Therefore the congestion problems never occur. Furthermore Central Path Design has a high flexibility for alteration and extension of system. Finally, we demonstrate its efficiency using simulation.
Genetic Algorithm for Designing Independent Manufacturing Cells
Moon, Chi-Ung ; Yi, Sang-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 581~595
The procedure of grouping the machines and parts to form cells is called manufacturing cell design. The manufacturing cell design is an important step in the development and implementation of advanced manufacturing systems. For the successful implementation of the manufacturing systems, identification of independent manufacturing cells, i.e., cells where parts are completely processed in the cell and no intercell movements, is necessary in the design phase. In this paper, we developed a mixed integer programming model and genetic algorithm based procedure to solve the independent manufacturing cells design problem considering the alternative process plans and machines duplication. Several manufacturing parameters such as, production volume, machine capacity, processing time, number of cells and cell size, are considered in the process. The model determines the process plan for parts, port families and machine cells simultaneously. The model has been verified with the numerical examples.
Shoring STEP Data over Internet using WWW
Choi, Young ; Shin, Ha-Yong ; Park, Myung-Jin ; Lee, Jong-Gap ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 597~608
Life cycle product data is very important yet difficult to handle for manufacturing companies. Shoring and exchanging product data over world-wide-web is a part of key technology to implement PDM or CALS. STEP is widely accepted as a standard to represent the life-cycle product model data. Described in this paper is a web browser plug-in that can graphically display and explore product data represented by STEP over internet. By the use of the plug-in (named "npSTEP"), a product model data stored in STEP format on a web server can be displayed on a commonly used web client (browser), such as Netscape navigator, without any format conversion process. Furthermore one can explore the components or attributes of the product model data in hierarchical manner.
Study for Variational Characteristics of Brain According to Human Emotion -Human Emotion by Auditory Perception-
Whang, Min-Cheol ; Sohn, Jin-Hun ; Kim, Chul-Jung ;
Journal of Korean Institute of Industrial Engineers, volume 23, issue 3, 1997, Pages 609~619
The concept of human emotion is recently demanded to be imbedded in industrial product and environment for enhancing quality of life. Human emotion is attempted to be qualified and quantified by physiological measurements. EEG variation, one of the physiological measurement, is observed to characterize psychological response in this study. This study is to find function and process of brain according to emotion. Twenty university students participated in this study and experienced positive and negative emotion by auditory stimulus. Delta, theta, alpha and beta waves showed characteristic variation in normalized sense according to positive and negative emotion. Local area showing significant difference between positive and negative emotion decreases with stimulus duration. Delta, theta and beta waves increase with negative emotion while alpha wave does with positive emotion.