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
Performance Analysis of the DQDB Protocol
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 1~14
In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into "
/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.
Development of a Decision Support System Shell for Problem Structuring
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 15~40
We designed a knowledge-based decision support system for structuring semi-or unstructured problems. Problem structuring involves extraction of the relevant factors from the identified problem, and model construction that represents the relationships among those factors. In this research, we employed a directed graph called Influence Deiagram as a tool for problem structuring. In particular, our proposed system is designed as a shell. Therefore, a decision maker can change the content of the knowledge base to suit his/her own interested domain.
Priority Aggregation for AHP Based on Experts Opinions
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 41~51
The Analytic Hierarchy Process (AHP) is widely used for evaluation of large projects. If a group of experts with different expertise are involved in a AHP decision, they need some way to aggregate their opinions. In this paper, we suggest a way to aggregate the experts' priorities in a given hierarchy using the concept of the Bayesian decision analysis. A criterion that can be used for screening out unreliable data is introduced, and it is used for priority aggregation. Some numerical results are shown to illustrate the procedure.
A Weighted Value Method for Multicriteria Decision Making
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 53~62
Complex decision-making problems are often characterized by multicriteria phenomena and fuzziness inherent in the structure of information and therefore suitable scientific solution methods. Especially, when similar dependent criteria are introduced, the problems become more complex. This paper presents a fuzzy intersectional dependence relation model for this kind of multicriteria decision-making problems. The model we propose is based on the fuzzy relation from fuzzy systems theory. In ths case of introducing similar dependent criteria, the rank reversal by distortion of weights is hard to occur by our proposed method. A numerical example is presented to illustrate the use of the model.
A Vehicle Fleet Planning System with Multi-objective Optimization
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 63~79
Many vehicle fleet planning systems have been suggested to minimize the routing distances of vehicles or reduce the transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to vehicle fleet planning system. This paper is considered multi-objective optimization. The vehicle fleet planning system developed by this study involves such complicated and restricted conditions as one depot, multiple nodes (demand points), multiple vehicle types, multipel order items, and other many restrictions for operating vehicles. The proposed algorithm is compared with the nearest neighbor heuristic (NNH) and the savings heuristic (SAH) algorithm in terms of total logistics cost and driving time. This method constructs a route with a minimum number of vehicles for a given demand. This method can be used to any companys which vehicle fleet planning system under circumstances considered in this paper.
A study on the economic production quantity model with partial backorders
;;Kim, Jung Ja;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 81~91
This paper is to build an economic production quantity model for situations, in which, during the stockout period, a fraction .betha.(backorder ratio) of the demand is backordered and remaining fraction (1-.betha.) is lost. This paper develops an objective function representing the average annual cost of a production system by defining a time-weighted backorder cost and a lost sales penalty cost per unit lost under the assumptions of deterministic demand rate and deterministic production rate, and provides an algorithm for its optimal solution. At the extreme .betha.= 1, the presented model reduces to the Fabrycky's model with complete backorders.
An approximation method for sojourn time distributions in general queueing netowkrs
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 93~109
Even though sojourn time distributions are essential information in analyzing queueing networks, there are few methods to compute them accurately in non-product form queueing networks. In this study, we model the location process of a typical customer as a GMPH semi-Markov chain and develop computationally useful formula for the transition function and the first-passage time distribution in the GMPH semi-Markov chain. We use the formula to develop an effcient method for approximating sojourn time distributions in the non-product form queueing networks under quite general situation. We demonstrate its validity through numerical examples.
The Subjectively Weighted Linear Utility Model using Bayesian Approach
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 111~129
In this study, we develope a revised model as well as application of decision problem under ambiguity based on the subjectively weighted linear utility medel. Bayes'rule is used when there are ambiguous probabilities on a decision problem and test information is available. A procedure for assessing the ambiguity aversion function is also presented. Decision problem of chemical corporation is used for an illustration of the application of the subjectively weighted linear utility model using Bayesian approach. We present the optimal decisiond using newly developed model. We also perform the sensitivity analysis to assure ourselves about the conclusion we obtianed on degree of ambiguity aversion due to characterize parameter of subjectively weighted linear utility model.
A Study on the Analysis of FMS Throughout-Rate by Development of Petri Nets Model
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 131~138
Petri Nets are a graphical and mathematical modeling and promising tool for describing and studying that are characterized as being concurrent, asychronous, dynamic, distributed and parrallel. The purpose of this paper is to analyze FMS Throughout-Rate by development of Petri Nets So, it applied to FMS composed of 7 machines and 4 different job types. The result of this paper shows the advantage of using Petri Nets.
A New Approach for Resource Allocation in Project Scheduling with Variable-Duration Activities
Kim, Soo-Young ; Leachman, Robert C. ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 139~149
In many project-oriented production systems, e. g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz  and by Leachman, Dincerler, and Kim [7[ in extended formulations of the resource-constrained poject scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach : (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationship of the activities also are presented.
A Case-Based New Financial Product Screening System
Lee, Hoon-Young ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 151~167
Initial screening is one of the most important and difficult processes in new product development. Many new product screening models have been developed in management and marketing. However practical applications of these models have been limited in part due to their complexity and inflexibility, and in part due to their excessive data requirements. Thus simple judgment models have been popular in practice. However, these models suffer from inaccuracy and inconsistency originating form human cognitive limitations. In light of the problem swith traditional screening methods, we propose a new approach for screening based on managers' past experience and intuitive judgments-screening by analogy, and develop a computerized case-based system for screening new financial service concepts. Using the system, managers can predict the potential performance of a new product concept based on the performance of past products that are similar to it in terms of product characteristics, firm's resources, and market conditions. Based on this prediction, managers make a screening decision.
Three Mathematical Programming thhniques for Solving Transshipment Problems:a Wilcoxon Test
Kwak, N.K. ; Hemaida, Ramadan S. ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 169~186
This paper presents three mathematical programming approaches to solving transshipment problems with interval supply and demand requirements. A linear goal programming model was developed based on the data obtained from a nationwide retail firm. Three mathematical programming model results were compared and analyzed, and three separate hypotheses were examined by using the Wilcoxon signed-ranked test for the model applicability. The test results were analyzed and interpreted for decision making.
A Formulation of Hybrid Algorithm for Linear Programming
Kim, Koon-Chan ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 187~201
This paper introduces an effective hybridization of the usual simplex method and an interior point method in the convergent framework of Dembo and Sahi. We formulate a specific and detailed algorithm (HYBRID) and report the results of some preliminary testing on small dense problems for its viability. By piercing through the feasible region, the newly developed hybrid algorithm avoids the combinatorial structure of linear programs, and several other interesting and important characteristics of this algorithm are also discussed.
An Exponentialization Procedure for General FMS Network of Queues with Limited Buffer
Lee, Ho-Chang ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 203~217
In this paper we develop an exponentialization procedure for the modelling of open FMS networks with general processing time at each station and limited buffer size. By imposing a reasonable assumption on the solution set, the nonlinear equation system for the exponentialization procedure is formulated as a variational inequality problem and the solution existence is examined. The efficient algorithm for the nonlinear equation system is developed using linearized Jacobi approximation method.
On the k-coloring Problem
Park, Tae-Hoon ; Lee, Chae Y. ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 219~233
A fixed k-coloring problem is introduced and dealt with by efficient heuristic algorithms. It is shown that the problem can be transformed into the graph partitioning problem. Initial coloring and improving methods are proposed for problems with and with and without the size restriction. Algorithm Move, LEE and OEE are developed by modifying the Kernighan-Lin's two way uniform partitioning procedure. The use of global information in the selection of the node and the color set made the proposed algorithms superior to the existing method. The computational result also shows that the superiority does not sacrifice the time demand of the proposed algorithms.
Waiting Times in the B/G/1 Queue with Server Vacations
Noh, Seung-Jong ;
Journal of the Korean Operations Research and Management Science Society, volume 19, issue 3, 1994, Pages 235~241
We consider a B/G/1 queueing with vacations, where the server closes the gate when it begins a vacation. In this system, customers arrive according to a Bernoulli process. The service time and the vacation time follow discrete distributions. We obtain the distribution of the number of customers at a random point in time, and in turn, the distribution of the residence time (queueing time + service time) for a customer. It is observed that solutions for our discret time B/G/1 gated vacation model are analogous to those for the continuous time M/G/1 gated vacation model.