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 29, Issue 4 - Dec 2004
Volume 29, Issue 3 - Sep 2004
Volume 29, Issue 2 - Jun 2004
Volume 29, Issue 1 - Mar 2004
Selecting the target year
A Study on the Mechanism Leading to the Success of CRM Systems Implementation
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 1~16
Critical success factors (CSFs) have been replicated and applied in a wide variety of settings for more than two decades. Most previous research on CSF have focused on identifying critical factors, based on the variance theory, in terms of the correlation between individual factor and Information system (IS) success. However, it is unknown how a set of critical factors Influence each other and lead to IS success, which means the process of IS implementation. in this research, we aim to understand how a set of critical factors influence each other and lead to IS success in the context of IS implementation for Customer Relationship Management based on the process theory. This research has implications In explaining a mechanism leading to CRM systems success based on the influencial relationships among the critical factors.
The Factors Towards the Adoption of Interorganizational Systems
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 17~30
There seems to be a renewed interest in Interorganizational relationship to search for strategic information partnerships. It is particularly noteworthy that no study has yet reported conflgurations at the level of interorganizational relationships nor compared such configurations across different types of ISO(interorganizational system). This paper seeks to uncover dominant configurations of interorganizational relationships across the various types of ISO. We Integrate relevant theoretical concepts from transaction cost economics, organization theory and political economy to develop a conceptual model of interorganizational relationships. We empirically uncover a set of hypothesis toward the patterns of interorganizetional relationships. Moreover the implications for further research pertaining to the logic and development of configurations were proposed.
The Structure of the Short and the Long-Run Variations in the Domestic Bank Earnings
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 31~41
This study analyzes the structure of the variations In the domestic bank earnings and examines their dynamic features by estimating the short-run response and the long-run adjustment Process after the changes in financial market variables. A system of the equations for the bank stock price index and KOSPI is formulated to utilize the whole information in the market and simultaneously estimated to identify the relationships between the market variables and the bank earnings. Since the bank stock price is found to be responsive to changes in none of the market variables in the short run, while being relatively responsive to dollar exchange rate and business state, It implies that a good economic conditions and a stable foreign exchange rate should be maintained to Improve the level of the stock price In the long run. In addition, the dynamic structure of the responses of the bank stock price index and KOSPI to the initial changes in the market variable are compared and anlayzed. The response of the bank stock price appears to take much longer in adjusting to the long-run eouilibrium level than that of KOSPI. As a result, the cumulative response of the bank stock price index over time is found much bigger than that of HOSPI.
A Two-Stage Method for Near-Optimal Clustering
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 43~56
The purpose of clustering is to partition a set of objects into several clusters based on some appropriate similarity measure. In most cases, clustering is considered without any prior information on the number of clusters or the structure of the given data, which makes clustering is one example of very complicated combinatorial optimization problems. In this paper we propose a general-purpose clustering method that can determine the proper number of clusters as well as efficiently carry out clustering analysis for various types of data. The method is composed of two stages. In the first stage, two different hierarchical clustering methods are used to get a reasonably good clustering result, which is improved In the second stage by ASA(accelerated simulated annealing) algorithm equipped with specially designed perturbation schemes. Extensive experimental results are given to demonstrate the apparent usefulness of our ASA clustering method.
A Study on Developing an Efficient Algorithm for the p-median Problem on a Tree Network
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 57~70
Given a tree network on which each node has its own demand and also stands for a candidate location of a potential facility. such as plant or warehouse, the f-median problem on the network (PMPOT) is to select less than or equal to P number of facility locations so that the whole demand on a node is satisfied from only one facility and the total demand occurred on the network can be satisfied from those facilities with the minimum total cost, where the total cost Is the sum of transportation costs and the fixed costs of establishing facilities. Tamir(1996) developed an O(p n
) algorithm for PMPOT which is known to be the best algorithm In terms of the time complexity, where n is the number of nodes in the network, but he didn't make any comments or explanation about implementation details for finding the optimal solution. In contrast to Tamir's work, Kariv and Hakimi(1979) developed O(p
) algorithm for PMPOT and presented O(n
) algorithm for finding the optimal solution in detail. In this paper, we not only develop another O(p n
) dynamic programming algorithm for PMPOT that is competitive to Tamir's algorithm in terms of the time complexity, but also present O(n) algorithm that is more efficient than kariv and Hakimi's algorithm in finding the optimal solution. finally, we implement our algorithm on a set of randomly generated problems and report the computational results
Exploring Online Gamers′ Preference for Online Games
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 71~85
Many online content providers who use the Internet to distribute contents, such as news, music, games, books, and other types of information, have been experiencing an extremely competitive business environment. To survive in this environment, they have started charging a fee for the contents that they provide. However, there have been very few success stories in commercializing online contents. One of the biggest hurdles may be customers' psychological resistance against paying a fee for the contents that have been free of charge previously. Without examining customers' perceived prices for online contents, many online content providers have tended to decide their prices by themselves. Online games are not exceptional cases. Although many online game-related research works have focused on psychological and technical aspects, very few works have examined online garners' preference carefully. This study alms at exploring online garners' preference by measuring their WTP (willingness to pay) for online games.
A Study on a Forecasting the Demand for the Future Mobile Communication Service by Integrating the Mobile Communication Technology
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 87~99
In this paper, we have developed a technology-service relationship model which describes the diffusion process of a group of services and relevant technologies, and have applied the developed model to the prediction of the number of subscribers to the next generation mobile service. The technology-service relationship model developed in this paper incorporates the developing process of relevant technologies, a supply-side factor, into the diffusion process of specific services, while many diffusion models and multi-generation diffusion models in previous researches are mainly reflect the demand-side factors. So, the proposed model could effectively applied to the telecommunication services where the developing of the relevant technologies are very essential to the service Penetration. In our application, the Proposed model provides a competitive substitution between the next generation mobile service and the traditional mobile service.
Effect of Product Variety on Market Share
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 101~112
Customer satisfaction level is usually measured in terms of price, qualify, customization, after-sale-service, product variety etc. Each firm sets up a distinctive production/marketing strategy to gain competitive advantage by Prioritizing the customer satisfaction measures. The market differentiation strategy directly results in supply chain performance such as lead time, inventory, customer fill rate and market share. Product proliferation desirable in customization sense often conflicts the economies of scale effect in production side. This paper focuses the relationship between product variety and market share. Specifically, we investigate how introduction of new product affects the current market share, i.e., formation of customer preference and provide some insight into the optimal range of product variety
Lower and Upper Bounding Strategies for the Network Disconnection Problem
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 113~125
The network disconnection problem ms to find a set of edges such that the total cost of removing the edges is no more than a given budget and the weight of nodes disconnected from a designated source by removing edges is maximized. Martel et at. have shown that the problem with unit capacity and unit demand Is NP-hard and Myung and kim present an integer programming formulation and develop an algorithm that Includes a preprocessing procedure and lower and upper bounding strateagies. in this paper, we present new findings on the properties of the optimal solution and an alternative integer programming formulation, based on which new lower and upper bounding strategies are developed. Computational results for evaluating the performance of the proposed algorithm are also presented.
"Needs to Learn" as a Moderator for Computer Self-Efficacy
Journal of the Korean Operations Research and Management Science Society, volume 29, issue 1, 2004, Pages 127~146
While 'Computer self-efficacy' is widely studied In the social science field with regard to the training effectiveness, little research has focused on clarifying the role of 'needs' in relation to self-efficacy and outcome expectations. in this regard, this study investigated the effects of 'needs to learn computer shills,' extending the social cognitive theory. A survey instrument was adopted and modified from previous studies to measure behavioral modeling, prior experience, Perceived computer self-efficacy, Perceived needs to learn computer skills and outcome expectations. A total of 209 practitioners were surveyed in this study. As a result, most part of the social cognitive theory was again Proven to be effective, and the 'needs to learn computer skills' was proven to be significant as a moderating variable between computer self-efficacy and outcome expectations. Implications of the research were discussed, and further studies were suggested at the end.