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 19, Issue 3 - Dec 1994
Volume 19, Issue 2 - Aug 1994
Volume 19, Issue 1 - Apr 1994
Selecting the target year
A study of inserting sequence and feeder allocation problem on printed circuit board
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 1~16
In this paper, we try to raise the efficiency of PCB production by improving automated inserting process. This process is composed of part inserting sequence and feeder allocation problem. Until now, this problem is formulated by Traveling Salesman Problem (TSP) or Rural Postman Problem. They concerted more on parts(chips) inserting. But in this paper, we concentrate on Feeder. We formulate 0-1 Integer program (MP2) easier than TSP. This program can be solved by using LP Package (i. e. LINDO, GAMS etc). We propose Heuristic algorithm ISFA which guarantees a local optimum and often gives solution. We give some examples to prove ISFA algorithm.
A Study on the Development of Multiple Experts' Knowledge Combining Algorithm by Using Fuzzy Cognitived Map
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 17~40
The objectives of this paper are to apply fuzzy cognitive map (FCM)- related techniques to (1) extract causal knowledge from a specific problem-domain and (2) perform a series of causal analysis in complicated decision making area. We propose a set operation-based augmentation (SOBA) algorithm to combine multiple FCMs developed by multiple experts. Based on the SOBA knowledge acquisition algorithm, we can obtain a causal knowledge base fairly representing multiple experts' knowledge about a problem domain. The causal knowledge base built by SOBA algorithm can be described as a matrix form, guaranteeing mathematically compact operation compared with a production (if-then) knowledge base. We applied out method to stock market analysis problem whichis a typical of highly unstructured problems in OR/MS fields.
Complete Preordering of Alternatives by Metric Distance Meausre
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 41~52
Imprecision of evaluation or lack of prior information about preference can be an obstacle for decision maker in representing his strict preference. Therefore, fuzziness of preference can take place, and in addition, intransitivity or incomparability of preference becomes the critical difficulty in making complete preorder of alternatives. In order to get better solution and to improve practical usufulness, MCDM should be established as a pseudo-criterion model that include fuzzy preference. In this paper, we suggest a pseudo-criterion model that can make complete preorder of alternatives by metric distance measure.
The Effects of Recursion in Problem-Solving Processes on the Problem-Solving Time : a Simulation Study
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 53~67
Over the last decades, interest in the application of decision support systems (DSS) in organizations has increased rapidly. Despite the growing number of investigations exmaining decision support system, relatively few empirical studies have evaluated the effects of DSS on problem-solving processes. This study examined, using a computer simulation technique, the effects of recursion in problem-solving processes on the problem-solving time. Results indicate that the recursions at the early stage of problem-solving processes scarcely influenced the problem-solving time, which is contrasted with the case of the recursions at the final stage.
Designing hierarchical ring-star networks under node capacity constraints
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 69~83
This paper deals with a capacitated ring-star network design problem (CRSNDP) with node capacity constraints. The CRSNDP is formulated as a mixed 0-1 integer problem, and a 2-phase heuristic solution procedure, ADD & VAM and RING, is developed, in which the CRSNDP is decomposed into two subproblems : the capacitated facility location problem (CFLP) and the traveling sales man problem (TSP). To solve the CFLP in phase I the ADD & VAM procedure selects hub nodes and their appropriate capacity from a candidate set and then assigns them user nodes under node capacity constraints. In phase II the RING procedure solves the TSP to interconnect the selected hubs to form a ring. Finally a solution of the CRSNDP can be achieved through combining two solution of phase I & II, thus a final design of the capacitated ring-star network is determined. The analysis of computational results on various random problems has shown that the 2-phase heuristic procedure produces a solution very fast even with large-scale problems.
Probabilistic approximations based on GPH distributions
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 85~98
The distribution of random sum of i. i. d. exponential random variables is called GHP (Generalized Phase-Type) distribution. The class of GPH distributions is large enough to include PH (Phase-Type) distributions and has several properties which can be applied conveniently for computational purposes. In this paper, we show that any distribution difined on R
can be app-roximated by the GPH distribution and demonstrate the accuracy of the approximation through various numerical examples. Also, we introduce an efficient way to compute the delay and waiting various numerical examples. Also, we introduce an efficient way to compute the delay and waiting time distributions of the GPH/GPH/1 queueing system which can be used as an approximation model for the GI/G/1 system, and validate its accuracy through numerical examples. The theoretical and experimental results of this paper help us accept the usefulness of the approximations based on GPH distribution.n.
A Multimedia Display-Time Composition Model:An Application to a Company Advertizing System
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 99~112
An important modelling requirement for multimedia systems is the representation of temporal constraints among several different media that ordinarily arise in multimedia application. The multimedia system which integrates various types of data is required to express voice, image, text and graphic data with simultaneousness or an arbitrary time intervals. The purpose of this study is to analyze the temporal reationships and synchronization among several different kinds of medium. Moreover, it proposes a Multimedia Display-Time Composition Model (MDTC Model) which guarantees a representation of any kind of temporal synchronization among more than two kinds of medium. The proposed model is applied to a company advertizing system. Finally, a multimedia authoring tool based on the MDTC Model is implemented.
A New Procedure for the Initial Solution of Goal Programming
;;Choi, Jae Bong;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 113~122
This study proposes a new procedure to find an initial solution to reduce the number of iterations of goal programming. The process of computing an initial solution is divided into two steps in this study. Decision variables which satisfy feasibility using Gaussian eliminations construct an initial solution reducing the iterations in the first step. It uses LHS as a tool that decision variables construct an initial solution. The initial solution which is constructed by the first step computes the updated coefficient of the objective function in the second step. If the solution does not satisfy the optimality, the optimal solution using the Modified Simplex Method is sought. The developed method doesn't reduce the overall computing time of goal programming problems, because time is more required for the process of constructing an initial solution. But The result of this study shows that the proposed procedure can reduce the large number of iterations in the first step effectively.
Project Team Leader's Roles and Team Performance
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 123~144
This Study has empirically examined the relationship between the role of R & D project leaders and their team performance using data from 87 project teams in 6 R & d organizations. The results reveal that : 1) R & D project leaders play five different roles for performing their jobs-strategic plannar, team builder, gatekeeper, expert and champion : 2) all but the champion role of leaders are positively associated with project team performance unless they have too short team tenure to materialize their role efforts : 3) However, the relationship between the role of leaders and project team performance varies according to characteristics of their team and project tasks. More specifically, it becomes more important for leaders to focus on gatekeeping and championing roles as their team gats older. Team building role of leaders is more important for higher performance of relatively certain R & D projects, while for uncertain R & D projects gatekeeping role appears to be more important.
An Economic Design of Constant Stress Accelerated Life Tests
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 145~152
This paper deals with an economic design of acelerated life test under constant stresses where failure times are exponentially distributed. In this case the optimization criterion is the information amount per unit cost. Fisher's information matrix of exponential distribution's parameters and expected cost considering fixed and variable costs are obtained. The decision variable is the censoring time in the model. In the 2-level constant stress case, it is proved that the optimal solution exists and is unique under some condition. Numerical examples are also included.
A Study of the Development of Algorithm for Optimal Route Design of the Vehicle Routing Problems
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 153~168
This paper is concerned with the development of tree-search algorithm for the exact solution to the vehicle problem (VRP), where set of vehicles of known capacity based at depot, have to be routed in order to supply customers with known requirements. When is required is to design routes, so that the total cost (i. e. total route length or time duration, ect.) is minimized. For obtianing the exact solution, the most important factors are the value of bound and branching strategy. Using the bound based on with bound ascent procedures from subgradient and state-space ascents, the incorporation of bounds into tree search algorithm to solve the problem is shown. Computational results of the corresponding algorithm show that VRPs with up to 40 customers can be solved optimally with this algorithm.
Improving the Efficiency of Marketing Channel between a Wholesaler and a Retailer with Uncertain Characteristics
Lee, Kyung-Keun ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 169~187
The efficiency of marketing channel of distribution between a sholesaler and a retailer with uncertain characteristics can be improved by influencing the retailer's ordering pattern. The wholesaler with large unit invetory holding cost can offer a large quantity discount tanks to the great benefit which comes from the transfer of part of his inventory to retailer. The retailer's increasing average inventory holding cost can be offset by the quantity discount and by savings of the ordering cost. Conditions under which marketing channel improvement can be possible are derived.
Optimal Design of a Covering Network
Myung, Young-Soo ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 189~199
This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.
A MARKOV DECISION PROCESSES FORMULATION FOR THE LINEAR SEARCH PROBLEM
Balkhi, Z.T. ; Benkherouf, L. ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 1, 1994, Pages 201~206
The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.