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 14, Issue 2 - Dec 1989
Volume 14, Issue 1 - Jun 1989
Selecting the target year
A Modeling and Solution Method for Routing of Container Ship
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 1~18
-Symmetric Relation Between the Lagrangean Relaxation and the Benders' Decomposition for Large Scale Mixed Integer Programming
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 19~26
We in this paper have defined the concept of .epsilon.-symmetric relation between the Lagrangean relaxation and the Benders' decomposition. This links the solutions of the Lagrangean subproblems and those of the Benders' subproblems even under positive duality gaps. As an application we have discussed the reduction of the size for a special class of problems.
The Knowledge Definition Language and Knowledge Creation for Knowledge Base Construction
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 27~42
REA (Restricted Entity Aspect) model is a knowledge representation model to classify the aspect type, the EA model component, into five aspects (IS-A-aspect, A-PART-OF aspect, attribute aspect, role aspect, and operation aspect). EATPS, the knowledge representation system, consists of user interface module, knowledge creation module, instance management module, schema management module, and integrity checking module. EATPS creates and manages interactively REA model based knowledge base. This paper shows the structure and functions of EATPS, the design and interactive construction of the knowledge definition language EAKDL, the functions and algorithm of class creation module, and the functions and algorithm of instance creation module to include inheritance inference mechanism.
Ex-Post Rate-of-Return Regulation on Oliopoly Market
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 43~52
The present paper analyzes performance of a variant of rate-of-return regulation called the ex-post adjustment regulation put in effect in the Korean petroleum refinery sector. Unlike the traditional rate-of-return regulation on a monopoly, the regulation is first for the oligopolistic industry as a whole and second of the ex post nature. Under the regulation, at the end of each year, each firm is responsible to pay a certain portion of the excess of the total realized profits in the industry over the allowed profits. It is shown that if the excess profits are completely collected(including the interests), the social optimum can be realized. When only a portion of the excess profits can be collected, the regulation generally increases consumer surplus by making the firms more competitive. Each individual firm's production under the regulation depends on whether the firm's output is regarded as a strategic substitute or complement of other firms'output.
Genetic Algorithms with a Permutation Approach to the Parallel Machines Scheduling Problem
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 47~47
This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.
Public Vehicle Routing Problem Algorithm
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 53~66
The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.
A Stochastic Production Planning Problem in Rolling Horizon Environment
Sung, C. S. ; Lee, Y. J. ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 67~74
This paper considers single-product production and inventory management problem where cumulative demands up to each time period are mutually independent random variables(known) having continuous probability distributions and the associated cost-minimizing production schedule (when to produce and how much to produce) need be determined in rolling horizon environment. For the problem, both the production cost and the inventory holding and backlogging costs are included in the whole system cost. The probability distributions of these costs are expressed in terms of random demands, and utilized to exploit a solution procedure for a production schedule which minimizes the expected unit time system cost and also reduces the probability of rist that, for the first-period of each production cycle (rolling horizon), the cost of the "production" option will exceed that of the "non-production" one. Numerical examples are presented for the solution procedure illustration.cedure illustration.
Optimal Stocking for Age-replaced Non-repairable Items
Park, Young-Taek ; Park, Kyung-Soo ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 75~86
Joint stocking and preventive age replacement policy is considered for non-repairable items assuming instantaneous replenishment. A recursive relationship among the optimal preventive replacement ages is obtained, which shows that the preventive replacement ages in a replenishment cycle form an increasing sequence due to the inventory carrying cost. Using this relationship, a procedure is given for determining how many units to purchase on each order and when to replace each unit after it has begun operating so as to minimize the total cost per unit time over an infinite time span. The problem can be simplified if equal preventive replacement ages are assumed, and the solution is very close to that of the original unconstrained problem.
The Application of Network Theory to Subway Transportation in Seoul, Korea
김채복 ; 김학수 ; 김성인 ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 81~81
Network approach is used to find the shortest paths and transportation time between the subway stations in Seoul, Korea. Because of transfer stations, we reconstruct the subway network to compute the shortest routes and corresponding transportation times. The reconstructed network is useful to obtain desired information because it can handle the transfer time between tracks. Time and route information about the subway system is obtained and it will be displayed in the subway guide board at each station. Then, all passengers can have the information of shortest route to a destination and corresponding transportation time.
Reducing Congestion General Queuing Networks
Kim, Sung-Chul ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 87~96
We develop an algorithm to determine the optimal loading policy, which minimizes the congestion in general queueing networks with variable stations. Under more specified condition, majorization and arrangement ordering are established to compare, respectivity, various loading and assignment policies. Implications of results are also discussed.
Bankruptcy Prediction Based on Limited Data of Artificial Neural Network - in Textiles and Colthing Industries -
피종호 ; 김승권 ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 91~91
Neural Network(NN) is known to be suitable for forecasting corporate bankruptcy because of discriminant capability. Bandkruptcy prediction on NN by now has mostly been studied based on financial indices at specific point of time. However, the financial profile of corporates fluctuates within a certain range with the elapse of time. Besides, we need a lot of data of different bankrupt types in order to apply NN for better bankruptcy prediction. Therefore, We have decided to focus on textile and clothing industries for bankruptcy prediction with limited data. One part of the collected data was used for training and calibration, and the other was used for verification. The model makes a learning with extended data from financial indices at specific point of time. The trained model has been tested and we could get a high hitting ratio relatively.
Existence Proffs of a Nash Equilibrium to a General Class of Differential Games
Kim, Yang-Yul ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 97~104
This paper extends the existence proofs of a Nash equilibrium to a more general class of differentila game models with constraints on the control spaces. With the assumptions of continuity, convexity, and compactness, the existence is proved using Kakutani Theorem and via a path-following approach. Furthermore, the proof for a period-by-period optimization of multi-period problems provides an insight to a numerical solution algorithm to differential game models with constraints.
Estimation of the Actual Working Time by Interval Linear Regression Models with Constraint Conditions
Hwang, S. G. ; Seo, Y. J. ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 105~114
The actual working time of jobs, in general, is different to the standard time of jobs. In this paper, in order to analyze the actual working time of each job in production, we use the total production amount and the encessary total working time. The method which analyzes the actual working time is as follows. In this paper, we propose the interval regression analysis for obtaining an interval linear regression model with constraint conditions with respect to interval parameters. The merits of this method are the following.1) it is easy to obtain an interval linear model by solving a LP problem to which the formulation of proposed regression analysis is reduced, 2) it is easy to add constraint conditions about interval parameters, which are a sort of expert knowledge. As an application, within a case which has given certain data, the actual working time of jobs and the number of workers in a future plan are estimated through the real data obtianed from the operation of processing line in a heavy industry company. It results from the proposed method that the actual working time and the number of workers can be estimated as intervals by the interval regression model.
A Study on Types and Performance of Major Retail Banks Automated Service Channel Strategy
변지석 ; 이동규 ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 139~139
Recently banking industry is experiencing fundamental changes by advancement of information technology. The traditional role of branches is rapidly being replaced with new electronic service channels such as ATM. Phone and PC for they are time-saving and convenient. Automated service channel strategy of retail banks is divided into two different ways, automation and networking. Automation is mainly focused on cost reduction related to the branch operation, while networking is on expansion of customer contact points. Strategic types of banks can be defined from a matrix model where the positioning is determined by the extent of automation and networking. The effectiveness of automated channel strategy depends on how separate strategic types show their performance. Results for deposits and productivity will be given to verify the economic performance of each strategic type.
Impacts of Training and Education for Information Technology(IT) : Empirical Study in the Service Industry
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 161~161
This research examines the importance of IT training/education, present situation and possible suggestion for the successful training/education. The research method adopts a comparative analytical approach based on questionnaire survey responses from three work groups - managers, employees, and union representatives - drawn from five sample Korean banks. The evidence indicates that all three groups agree that IT improves banking efficiency and reduces job repetitiveness, but their job satisfaction level with IT-based work is surprisingly very low. The main reasons are mainly lack of training/education and poor user manuals. Also the research shows that most respondents would like to get further training/education to more adequately fit them for their jobs. Those from banks which invested in continuing training/education revealed more positive work attitudes and higher job satisfaction.
Application of Visual Decision Making Process in the Development of Business Process Reengineering Vision and Implementation Plan
김재경 ; 성태경 ;
Journal of the Korean Operations Research and Management Science Society, volume 14, issue 2, 1989, Pages 185~185
Business process reengineering(BPR) aims at a radical redesign of our business processes in order to achieve dramatic improvements in their performance. However, the fact that many BPR projects have failed hesitates the companies who have started to use BPR or who are planning to do so. Implementing a radical plan from a cross-functional perspective needs a more careful consideration of process vision, preventive measures and contingency plan. Our research suggests to use a visual decision making process (VDMP) in the development of a process vision and implementation plan. A BPR project of Carlson School of Management (CSOM) at the University of Minnesota is illustrated to show our suggested methodology.