Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korean Operations Research and Management Science Society
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 20, Issue 3 - Dec 1995
Volume 20, Issue 2 - Aug 1995
Volume 20, Issue 1 - Apr 1995
Volume 12, Issue 3 - 00 1995
Selecting the target year
Sensitivity Analysis on the Non-tree Solution of the Minimum Cost Flow Problem
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 1~10
The purpose of this paper is to develop a method of the sensitivity analysis that can be applied to a non-tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1a is the well known method applicable to a tree solution. However this method can not be applied to a non-tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient we present a method that the sensitivity analysis of Type 2 is solved by finding the shortest path. Besides we also show that the results of Type 2 and Type 1 are the same in a spanning tree solution. For the right-hand side constant or the capacity, the sensitivity analysis of Type 2 is solved by a simple calculation using arcs with intermediate values.
An experimental study on effectiveness of group decision support systems in diea-generation
;;;;Kim, Sun Uk;Park, Jong Hak;
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 11~26
We have used various information technologies (IT) in group decision-making for increasing effectiveness and satisfaction of group decision-making process. Recently, a new form of IT so called Group Decision supprot System (GDSS) was introduced into group decision-making process. Previous experimental studies about effectiveness of GDSSS have been inconsistent and the results were mixed. There was no empirical studies about GDSS in Korea. In this study, we divide two groups-GDSS supported group and traditional face-to-face group and investigate impacts of GDSS on group decision-making processes and outcomes. An idea generation task for operational action plan development, implementing GEO's strategic vision, served as the decision-making context. Supported GDSS is GroupSystems V, which had been developed by Univ. of Arizona. It was translated by Korean. According to the results, Number of nonredundant ideas in GDSS group is two or three times more than Non-GDSS grop. GDSS group feel more equal status, have better interpersonal relationship, have more confidence on group decision than Non-GDSS group. But satisfaction of participants on decision-making process and outcome has not showed a significant difference between two groups. Because all of participants in GDSS group were novice to GDSS. With this results we suggest further studies on transforming western type GDSS to Korean decision-making culture. It will be cornerstone for development of GDSS in Korean desision-making culture. It will be cornerstone for devlopment of GDSS in Korean decsion making culture environment.
A Model for Determining Optimal Input Quantity in a Semiconductor Production Line Considering Yield Randomness and Demand Uncertainty
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 27~34
In this paper, we have developed a model to determine the input quantity to be processed at each stage of a multi-stage production system in which the yield at each stage may be random and may need reworking at this stage. Yield randomness. especially in a semiconductor industry, is a most challenging problem for production control. The demand for flnal product is uncertain. We have extended the model proposed in Park and Kim to consider a multiple number of reworkings which can be done at any stage prior to or tat the stage whose output in bad, depending on the level of the defect.
Virtual Path Routing Optimization in ATM Network
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 35~54
Routing in ATM network is set up by combination of both virtual path routing and virtual channel routing. While virtual channel is similar concept to virtual circuit of data networks, virtual path is a special concept which is not used in traditional data networks. Virtual path can rearrange in structure and size by simply changing virtual path routing tables and giving the network the capability to eash allocate network resources according to the demand needs. This paper provides reconfiguration models of virtual path network which give the bandwidth of link and the routing path for each traffic class. The reconfiguration models are network optimization problems of multicommodity network flow type. The numerical examples are also included.
A Warranty Policy with Replacement and Repair Periods
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 55~62
This paper compares the two policies which are unsed in Korean electronic appliance industry. Policy I is a general warranty policy under which all of failures during warrenty period (12 months) are repaired without charge. Policy II was proposed recently by a company. Under Policy II, when the product fails until a certain times(6 months), the failed product will be replaced by the new product and all other failures from the certain time to the warrenty period (24 months) will be repaired free. We obtain the expected total warranty costs per product and necessary conditions under which the Policy II has a meaning in economic point of view without or with discount rate. Some numericla examples are considered.
A Model and Simulated Annealing Algorithm for the Multi-factor Plant Layout Problem
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 63~81
This paper presents a model and algorithm for solving the multi-factor plant layout problem. The model can incorporate more than two factors that may be either quantitative or qualitative. The algorithm is based on simulated annealing, which has been successfully applied for the solution of combinatorial problems. A set of problems previously used by various authors is solved to demonstrate the effectiveness of the proposed methods. The results indicate that the proposed methods can yield good quality for each of eleven test problems.
A Risk Analysis Model Using VERT for R & D Project Management
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 85~99
Increasingly, risk analysis is becoming important ingredients in achieving the successful implementation and application in the area of the project management. The project management system is designed to manage or control the project resources on a given activity within time, cost and performance so called TPPM (Total Productive Project Management). In this research, a risk analysis model misproposed to identify potential problem areas, quantify the risks, and generated the chice of the action that can be taken to reduce the risk. In addition two analysis models are proposed : 1) risk factor model and 2) network simulation model using VERT (Venture Evaluation and Review Technique ). The objective of the remodels is to estimate the schedule, cost performance risks. These proposed quantitative models for project risk analysis are proving its value for the project managers who need to assess the risk of changes in cost, schedule, or performance. The proposed models will be used in the area of project selection, evaluation and the allocation of project resources.
Structural Study of the K-Median Problem
Ahn, Sang-Hyung ;
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 101~113
The past three decades have witnessed a tremendous growth is the literature on location proble. A mathematical formulation of uncapacitated plant location problem and the k-median as an integer program has proven very fruitful in the derivation of solution methods. Most of the successful algorithms for the problem are based on so-called "strong" linear programming relaxation. This is due to the fact that the strong linear programming relaxation provides a tight lower bound. In this paper we investigate the phenomenon with a structural analysis of the problem.e problem.
A Constrained Single Machine Scheduling Model with Earliness/Tardiness and Flow Time Measures
Joo, Un-Gi ; Sung, Chang-Sup ;
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 115~130
This paper considers a single machine nonpreemptive scheduling problem with a given common due date. In the problem, the optimal job sequence is sought to minimize the sum of earliness/tardiness and flow time measures in the situation where all jobs are available at time zero, and weights per unit length of earliness/tardiness and flow time are V and W, respectively. Some dominant solution properties are characterized to deriva both an optimal starting time for an arbitrary sequence and sequence improvement rules. The optimal schedule is found to the case W .geq. V/. By the way, it is difficult to find the optimal schedule for the case W < V. Therefore, the derived properties are put on together to construct a heuristic solution algorithm for the case W < V, and its effectiveness is rated at the mean relative error of about 3% on randomly generated numerical problems.
Using Fuzzy Set Theory in Project Planning Problem
Park, Seung-Hun ; Chang, In seong ;
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 131~145
This paper presents a method for solving project planning problem which the opinions of experts greatly disagree in each activity processing time. Triangular fuzzy numbers (TFNs) are used to represent activity times of experts. And we introduce a pessimistic project planning with major TFNs and an optimistic project planning with minor. TFNs, and illustrate the approach using a combination of the existing composite and the comparison methods, which is used to solve the complex project planning problem.
An Algorithm for Optimizing over the Efficient Set of a Bicriterion Linear Programming
Lee, Dong-Yeup ;
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 147~158
In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.
A Knowledge-Based Fuzzy Post-Adjustment Mechanism:An Application to Stock Market Timing Analysis
Lee, Kun-Chang ;
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 159~177
The objective of this paper is to propose a knowledge-based fuzzy post adjustment so that unstructured problems can be solved more realistically by expert systems. Major part of this mechanism forcuses on fuzzily assessing the influence of various external factors and accordingly improving the solutions of unstructured problem being concerned. For this purpose, three kinds of knowledge are used : user knowledge, expert knowledge, and machine knowledge. User knowledge is required for evaluating the external factors as well as operating the expert systems. Machine knowledge is automatically derived from historical instances of a target problem domain by using machine learning techniques, and used as a major knowledge source for inference. Expert knowledge is incorporate dinto fuzzy membership functions for external factors which seem to significantly affect the target problems. We applied this mechanism to a prototyoe expert system whose major objective is to provide expert guidance for stock market timing such as sell, buty, or wait. Experiments showed that our proposed mechanism can improve the solution quality of expert systems operating in turbulent decision-making environments.
Multi-objective Scheduling with Stochastic Processing Times
Jung, Young-Sik ;
Journal of the Korean Operations Research and Management Science Society, volume 20, issue 1, 1995, Pages 179~193
A multi-objective, single-stage scheduling problem with stochastic processing times is considered where the objective is to simultaneously minimize the expected value and the variance of total flowtime, and the mean probability of tardiness. In cases where processing times follow normal distributions, a method using pairwise interchange of two jobs(PITJ) is proposed to generate a set of the approximate efficient schedules. The efficient schedules are not dominated by the criterion vectors of any other permutation schdules in the feasible region. Numerical experiments performed to ascertain the effectiveness of PITJ algorithm are also reported in the results.