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 22, Issue 4 - Dec 1996
Volume 22, Issue 3 - Sep 1996
Volume 22, Issue 2 - Jun 1996
Volume 22, Issue 1 - Mar 1996
Selecting the target year
A Genetic Algorithm for a Multiple Objective Sequencing Problem in Mixed Model Assembly Lines
Hyun, Chul-Ju ; Kim, Yeo-Keun ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 533~549
This paper is concerned with a sequencing problem in mixed model assembly lines, which is important to efficient utilization of the lines. In the problem, we deal with the two objectives of minimizing the risk of stoppage and leveling part usage, and consider sequence-dependent setup time. In this paper, we present a genetic algorithm(GA) suitable for the multi-objective optimization problem. The aim of multi-objective optimization problems is to find all possible non-dominated solutions. The proposed algorithm is compared with existing multi-objective GAs such as vector evaluated GA, Pareto GA, and niched Pareto GA. The results show that our algorithm outperforms the compared algorithms in finding good solutions and diverse non-dominated solutions.
A Design for PCS Network and Analysis of Handover Processing Capacity
Jang, Hee-Seon ; Lim, Seog-Ku ; Yu, Jea-Hoon ; Lee, Yoon-Ju ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 551~565
We present the required handover capacity of personal communication service exchange(PCX). We use the flow-based mobility model. The dimension of PCX area and the number of radio port controller(RPC) in a PCX are determined according to the traffic carrying capacity of switching system and RPC. For the rectangular or square-shaped PCX/RPC area and the personal communication service environment with pedestrian traffic, we perform numerical computations to investigate the sensitivity to cell size, portable station(PS) terminating traffic, its density, and its average speed. The results how that the size of PCX/RPC area decreases as the PS terminating traffic and the PS density increase, and the PCX handover capacity required is more than 73,000 in the number of transactions per hour.
Branch-and-bound method for solving n-ary vertical partitioning problems in physical design of database
Yoon, Byung-Ik ; Kim, Jae-Yern ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 567~578
In relational databases the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. N-ary vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. In this paper, a 0-1 integer programming model for solving n-ary vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve it. A preprocessing procedure reducing the number of variables is presented. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.
Collision-Free Path Planning for Articulated Robots
Choi, Jin-Seob ; Kim, Dong-Won ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 579~588
The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is built by a set of robot joint angles derived from robot inverse kinematics. The joint space, that is made of the joint angle set, forms a Configuration space (Cspcce). Obstacles in the robot workcell are also transformed into the Cobstacles using slice projection method. Actually the Cobstacles means the configurations of the robot causing collision with obstacles. Secondly, a connected graph, a kind of roadmap, is constructed by the free configurations in the Cspace, where the free configurations are randomly sampled from a free Cspace immune from the collision. Thirdly, robot paths are optimally determinant in the connected graph. A path searching algorithm based on
is employed in determining the paths. Finally, the whole procedures for the CFPP method are shown for a proper articulated robot as an illustrative example.
Management of Recycling-Oriented Manufacturing Components Based on an MCDM Model
Shin, Wan-S. ; Oh, Hyun-Joo ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 589~605
Recycling of used products and components has been considered as one of promising strategies for resolving environmental problems. In this respect, most manufacturing companies begin to consider possible recycling (e.q., reuse or re-production) of the components contained in their products. The primary objective of this research is to develop a multiple criteria decision making model for systematic management of recycle-oriented manufacturing components. The production planning problem of recycle-oriented manufacturing components is first formulated as a multiobjective mixed 0-1 integer programming model with three conflicting objectives. An interactive multiple criteria decision making method is then developed for solving the mathematical model. Also, an Input/Output analysis software is developed to help practitioners apply the model to real problems without much knowledge on computers and mathematical programming. A numerical example is used in examining the validity of the proposed model and to investigate the impact of the input variables on recycling production strategy.
Job Scheduling Problem Using Fuzzy Numbers and Fuzzy Delphi Method
Park, Seung-Hun ; Chang, In-Seong ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 607~617
This paper shows that fuzzy set theory can be useful in modeling and solving job scheduling problems with uncertain processing times. The processing times are considered as fuzzy numbers(fuzzy intervals or time intervals) and the fuzzy Delphi method is used to estimate a reliable time interval of each processing time. Based on these time estimates, we then propose an efficient methodology for calculating the optimal sequence and the fuzzy makespan.
Hierarchical Control Scheme in Flexible Manufacturing Systems That have unreliable Machines and Maintenance
Um, Wan-Sup ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 619~631
This paper describes an approach for the incorporation of maintenance times into a hierarchical scheduling for a failure prone flexible manufacturing system. The maintenance should not be performed too often because of the resulting reduction of capacity. Most manufacturing systems are large and complex. It is natural to divide the control into a hierarchy consisting of a number of different levels. Each level is characterized by the length of the planning horizon and the kind of data required for the decision making process. The goal of the analysis reported here is to calculate the production requirements while the machines fail and are repaired at random times. The machine failure and preventive maintenance are considered simultaneously.
An Interactive Method for Multicriteria Simulation Optimization with Integer Variables
Shin, Wan-S. ; Kim, Jae-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 633~649
An interactive multicriteria method, which is called the Modified Pairwise Comparison Stochastic Cutting Plane (MPCSCP) method, is proposed for determining the best levels of the integer decision variables needed to optimize a stochastic computer simulation with multiple response functions. MPCSCP combines good features from interactive tradeoff cutting plane methods and response surface methodologies. The proposed method uses a simple pairwise man-machine interaction and searches an integer space uniformly by using the experimental design which evaluates the decision space centering around an integer center point. The characteristics of the proposed method are investigated through an extensive computational study. The parameter configurations examined in the study are (1) variability of the sampling errors, (2) the size of experimental design, (3) the relaxation of cutting planes, and (4) the levels of decision maker's inconsistency.
Optimal Preventive Replacement under Periodic Inspections for an Item in Preparedness
Kong, Myung-Bock ; Won, Young-Cheol ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 651~662
This paper concerns with preventive replacement under periodic inspections for an item (system) which is in a state of preparedness. The item is subject to wear. The item fails randomly but the failure rate depends on the accumulated wear. The item is preventively replaced if it survives a certain wear limit at periodic inspections. The foiled item is, however, replaced at periodic inspections. Given the costs for replacements and inspections, and the penalty cost of the time elapsed between failure und its detection, the optimal wear limit according to the long-run expected cost per unit time criterion is derived. It has been proved that the optimal wear limit is unique if an item has increasing weer-dependent failure rate. A numerical example for a stationary gamma wear process with Weibull distributed failure is given to show its applicability.
Development of Methods of Constructing Family of Manikin
Kim, Jin-Ho ; Whang, Min-Cheol ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 663~675
Equipment designer should consider how many people and what range of percentiles will be used as design criteria. The usual practice is to select some large range of the accommodation, such as 5th-95th percentiles. There is difficulty in defining 95% accommodation of population in complex design problems which involve several body dimensions. This paper develops the methods of constructing family of manikins which are validated for population accommodation. They are analyzed by the interactions or relationships between body dimensions. Proposed manikin family represents multivariate body dimensions. Moreover, nine manikin families are determined for representative Korean of 30-50 aged by proposed manikin family. Their 2-D CAD modelings are developed for bio-mechanical and ergonomic applications.
Static Model for Simultaneous Decision Making on Inventory and Pricing Polices for Capacity-Constrained Supplier
Lee, Kyung-Keun ; Kim, Young-Seok ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 677~687
We study simultaneous decision making model for a monopolistic or competitive supplier to decide inventory and pricing policies under capacity constraint. Economic implications are obtained from the optimality conditions such as production lot sizes, pricing schedules and so on. Sensitivity analysis gives us the optimal relations among the critical economic quantities.
Performance Evaluation of Zone-based Registration in COMA Mobile Communication System
Baek, Jang-Hyun ; Lie, Chang-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 689~703
In this paper, we evaluate the performance of zone-based registration. First, we propose a mobility function for single zone-based registration. And we establish the circumstances of multiple zone-based registration, which is based on the mobility function for single zone-based registration, and perform simulation programs for the circumstances. Using the simulation results, we obtain optimal N, the number of multiple zones which minimizes signalling traffic in radio channels. Results show that in most cases optimal N is 2. Multiple zone-based registration has less signalling traffic in radio channels than single zone-based registration and zone-based registration must be implemented as multiple zone-based registration.
A heuristic algorithm for forming machine cells and part families in group technology
Ree, Paek ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 705~718
A similarity coefficient based algorithm is proposed to solve the machine cells and part families formation problem in group technology. Similarity coefficients are newly designed from the machine-part incidence matrix. Machine cells are formed using a recurrent neural network in which the similarity coefficients are used as connection weights between processing units. Then parts are assigned to complete the cell composition. The proposed algorithm is applied to 30 different kinds of problems appeared in the literature. The results are compared to those by the GRAFICS algorithm in terms of the grouping efficiency and efficacy.
Development of a planner of processing equipments for heterarchical SFCS
Kim, Hwa-Jin ; Cho, Hyun-Bo ; Jung, Moo-Young ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 719~739
A common control model used to implement computer integrated manufacturing(CIM) is based on the hierarchical decomposition of the shop floor activities, in which supervisory controllers are responsible for all the interactions among subordinates. Although the hierarchical control philosophy provides for easy understanding of complex systems, an emerging manufacturing paradigm, agile manufacturing, requires a new control structure necessary to accommodate the rapid development of a shop floor controller. This is what is called autonomous agent-based heterarchical control. As computing resources and communication network on the shop floor become increasingly intelligent and powerful, the new control architecture is about to come true in a modern CIM system. In this paper, heterarchical control is adopted and investigated, in which a controller for a unit of device performs three main functions - planning, scheduling and execution. Attention is paid to the planning function and all the detailed planning activities for heterarchical shop floor control are identified. Interactions with other functions are also addressed. In general, planning determines tasks to be scheduled in the future. In other words, planning analyzes process plans and transforms process plans into detailed plans adequate for shop floor control. Planning is also responsible for updating a process plan and identifying/resolving replanning activities whether they come from scheduling or execution.
A Lagrangean Relaxation Method of Three-Dimensional Nonguillotine Cutting-Stock Problem
Kim, Sang-Youl ; Park, Soon-Dal ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 741~751
The three dimensional cutting-stock problem is to maximize the total value of pieces which are smaller cubics-cut from a original cubic stock. This paper suggests a method to maximize the total value of different size cut pieces using the orthogonal non-guillotine cut technique. We first formulated a zero-one integer programming, then developed a Lagrangeon relaxation method far the problem. The solutions were given by using a brunch-end-bound technique associates with Lagrangean relaxation, which guarantees an optimal solution.
A slot assignment method in the container yard for export containers considering their weights
Kim, Kap-Hwan ; Park, Young-Man ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 753~770
In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location. And a heuristic rule is suggested in order to overcome computational difficulties of the optimization model. The performance of the rule is evaluated by comparing it with the result of DP model.
Analysis of traffic control policies in the voice-date integrated cellular CDMA mobile network
Yoon, Bok-Sik ; Lee, Nam-Jun ; Lee, Dong-Kie ; Lie, Chang-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 22, issue 4, 1996, Pages 771~788
A CDMA-based cellular mobile telecommunication system has already been developed and is expected to provide more stable mobile communication services for much more users than traditional analog mobile systems. As a natural course of development, the CDMA mobile system is expected to provide ISDN services in the near future. In this paper, we analyze several traffic control policies for the voice-data integrated traffic in the cellular CDMA system. We first select four admission control policies which take differences in traffic and QOS characteristics between voice and data into account, and then develop modelling and analysis techniques, which can be used directly to analyze the chosen control policies. Our approach is based on so-called threshold model. Numerical computation results obtained under the typical traffic situation are also given. Through these computation results we could tentatively conclude that the cutoff priority policy, which can provide the priority for handoff voice cells while effectively utilizing unused channels, seems to be most effective among the four policies.