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 30, Issue 4 - Dec 2005
Volume 30, Issue 3 - Sep 2005
Volume 30, Issue 2 - Jun 2005
Volume 30, Issue 1 - Mar 2005
Selecting the target year
A VSSI-CRL Synthetic Control Chart
Lee Jae-Won ; Lim Tae-Jin ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 1~14
We propose a VSSI-CRL(Variable Sampling Size and Samplina Interval-Conforming Run length) synthetic control chart in order to improve the statistical characteristics of both the VSSI chart and the CRL synthetic chart. The VSSI-CRL chart utilizes VSSI sampling scheme, but it produces a signal only when the CRI is less than a given limit. An algorithm for calculating the ARL(Average Run length) and ATS(Average Time to Signal) of the VSSI-CRL chart is developed by employing Markov chain method. We present some lemmas for describing the statistical characteristics of the VSSI-CRL chart under in-control state. A procedure for designing the VSSI-CRL chart is proposed based on the lemmas. Extensive comparative studios show that the VSSI-CRL chart is superior to the CRL synthetic chart or the VSSI chart in general, and is comparable to the EWMA chart in ATS performance.
Empirical Analysis for Korean Manufacturing Firm's IT Investment Effect to Economic Performance
Ko Joong-Gul ; Han Hyun-Soo ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 15~25
As implied by the terms of IT productivity Paradox, measuring the Information technology contribution to economic performance has been one of the challenging issues to both policy makers and business professionals. As such, diverse attempts with sophisticate analyses have been reported in the literature to analyze the effect of IT contributions. In this paper, we follow Growth Accounting Method to measure the IT contribution effect to manufacturing firm's economic performance in Korea. Various regression methods and statistical analyses are applied with fourteen years of industry Panel data. Using the Cobb-Douglas function, time lag analysis is made to understand IT effect to economic growth. Instead of capturing data from individual firm, industry level data from the National Statistics Bureau is used for IT capital, non-IT capital, and so on. Statistical analysis following the panel unit test and Panel co-integration test was performed to reveal the exact effect of IT contribution to economic performance. Empirical testing results for non-stationary nature of IT investment effect are reported as well as IT contribution to manufacturing industry's economic performance.
A Hybrid Data Mining Technique Using Error Pattern Modeling
Hur, Joon ; Kim, Jong-Woo ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 27~43
This paper presents a new hybrid data mining technique using error pattern modeling to improve classification accuracy when the data type of a target variable is binary. The proposed method increases prediction accuracy by combining two different supervised learning methods. That is, the algorithm extracts a subset of training cases that are predicted inconsistently by both methods, and models error patterns from the cases. Based on the error pattern model, the Predictions of two different methods are merged to generate final prediction. The proposed method has been tested using practical 10 data sets. The analysis results show that the performance of proposed method is superior to the existing methods such as artificial neural networks and decision tree induction.
A Tabu Search Algorithm for the Vehicle Routing Problem with Time Window and Dock Capacity Constraints
Zang Heejeong ; Lee Kyungsik ; Choi Eunjeung ; Park Sungsoo ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 45~60
We consider a vehicle routing problem with time window and dock capacity constraints (VRPTD). In most traditional models of vehicle routing problems with time window (VRPTW), each customer must be assigned to only one vehicle route. However demand of a customer may exceed the capacity of one vehicle, hence at least two vehicles may need to visit the customer We assume that each customer has Its own dock capacity. Hence, the customer can be served by only a limited number of vehicles simultaneously. Given a depot, customers, their demands, their time windows and dock capacities, VRPTD is to get a set of feasible routes which pass the depot and some customers such that all demands of each customer are satisfied Since VRPTD is NP-hard, a meta-heuristic algorithm is developed. The algorithm consists of two Procedures : the route construction procedure and the route scheduling procedure. We tested the algorithm on a number of instances and computational results are reported.
An Improved Best-First Branch and Bound Algorithm for Unconstrained Two-Dimensional Cutting Problems
Yoon Ki-Seop ; Bang Sung-Kyu ; Kang Maing-Kyu ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 61~70
In this Paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly Proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.
Echelon Base Stock Policy with Outside Competition in a Two-Stage Supply Chain
Kim, Nam-Young ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 71~81
This Paper focuses on the effects of outside competition on an optimal echelon base stock level in a two stage supply chain. This is new in that we have been studying the effects of inside competition within a supply chain up to now. It is known that the optimal echelon base stock level with inside competition within a supply chain is less than the global optimal echelon base stock level without inside competition. This is due to the ' public goods ' nature of inventory. That is, more inventory is better, but one wants the other to invest more, thus resulting in under-investment. However, this phenomenon becomes weaker as outside competition increases. We show that as outside competition becomes stronger, the ' public goods ' effects decrease and the optimal echelon base stock level increases. If the level of competition is sufficiently high, the optimal echelon base stock level goes even higher than the global optimal echelon base stock level. We develop a theoretical model for the analysis and conduct a numerical analysis.
Determinant Factors of Business Agility for Real Time Enterprise : Empirical Validation
Kim J. W. ; Park C. H. ; Nam K. C. ; Park S. Y. ; Kim B. W. ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 83~97
We could confirm through this study that in the company which has secured its agility in an information technology dimension, a process dimension and an organization behavior dimension as a real time enterprise, various agility competences of that company are used more effectively for productivity Improvement, development on new products and customer satisfaction. Therefore, based on these determinant factors, it has been proved that an individually differentiated investment of technical and organizational resources for development and innovation of new products has contributed affirmatively to get a more efficient enterprise performance : and, in this point, it is verified again that the agility secured through a conversion toward the real time enterprise (RTE) is a more effective plan to increase the enterprise performance.
A New Analytical Algorithm of Timed Net with Probabilities of Choices and Its Application
Yim Jae-Geol ; Joo Jae-Hun ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 99~115
For an analysis of the performance of a computer system, the minimum cycle time method has been widely used. The minimum cycle time method is a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the Initial marking in a timed net. A timed net is a modified version of a Petri net where a transition is associated with a delay time. In the real world, an event is associated with a probability of occurrence. However, a timed net is not equipped with any facility of specifying probability of event occurrence. Therefore, the minimum cycle time method applied on a timed net can easily overlook probabilities of occurrences of events and yield a wrong result. We are proposing 'Timed Net with Probabilities of Choices' where a transition can be associated with both delay time and a probability of occurrence. We also introduce an algorithm for minimum cycle time analysis on a 'Timed Net with Probabilities of Choices'. As an example of application, we are performing an analysis of the location based service system using 'Timed Net with Probabilities of Choices'.
Artificial Neural Network, Induction Rules, and IRANN to Forecast Purchasers for a Specific Product
Jung Su-Mi ; Lee Gun-Ho ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 117~130
It is effective and desirable for a proper customer relationship management or marketing to focus on the specific customers rather than a number of non specific customers. This study forecasts the prospective purchasers with high probability to purchase a specific product. Artificial Neural Network( ANN) can classily the characteristics of the prospective purchasers but ANN has a limitation in comprehending of outputs. ANN is integrated into IRANN with IR of decision tree program C5.0 to comprehend and analyze the outputs of ANN. We compare and analyze the accuracy of ANN, IR, and IRANN each other.
A Cross Genre Study of the Relationship among Flow, its Antecedents, and the Reuse Intention in Online Games
Lee, Woong-Kyu ; Kwon, Jeong-Il ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 131~150
One of the reasons for popularity of online game is owing to the interactions with other game users that would lead game the users easily involving in it. Such a holistic state is called flow. Theoretically and empirically flow is one of the antecedents influencing the intension of reusing online game. However, since there are so many kinds in online games, all of them are not the same in the way of feeling flow and level of the relationship with reuse. The objective of this study is to analyze the relationship between flow, fators influencing flow and reuse intension in online games genre by genre. For this purpose, we classily online game into role playing, board, arcade and simulation, and suggest a research model that would explain relationship between online game and flow comparing its difference among four game genres. Sampling 730 from online game users, we analyze the suggested model empirically by PLS and prove it to be a valid one. The result of this study would not only provide differentiate Insights to the online game providers in each genre practically but also contribute to explaining intrinsic motivation for the use of information technology theoretically.
An Interconnection Model of ISP Networks
Choi Eunjeong ; Tcha Dong-Wan ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 4, 2005, Pages 151~161
For Internet service providers (ISPs), there are three common types of interconnection agreements : private peering, public peering and transit. One of the most important problems for a single ISP is to determine which other ISPs to interconnect with, and under which agreements. The problem can be then to find a set of private peering providers, transit providers and Internet exchanges (IXs) when the following input data are assumed to be given : a set of BGP addresses with traffic demands, and a set of potential service providers (Private peering/transit providers and IXs) with routing information, cost functions and capacities. The objective is to minimize the total interconnection cost. We show that the problem is NP-hard, give a mixed-integer programming model, and propose a heuristic algorithm. Computational experience with a set of test instances shows the remarkable performance of the proposed algorithm of rapidly generating near-optimal solutions.