Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Korean Management Science Review
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 17, Issue 3 - Nov 2000
Volume 17, Issue 2 - Nov 2000
Volume 17, Issue 1 - May 2000
Selecting the target year
On the Implementation of an Optimal Basis Identification Procedure for Interior Point Method
Korean Management Science Review, volume 17, issue 2, 2000, Pages 1~12
In this study, we deals with the implementation of an optimal basis identification procedure for interior point methods. Our implementation is based on Megiddo’s strongly polynomial algorithm applied to Andersen and Ye’s approximate LP construction. Several techniques are explained such as the use of effective indicator for obtaining optimal partition when constructing the approximate LP, the efficient implementation of the problem reduction technique proposed by Andersen, the crashing procedure needed for fast dual phase of Megiddo’s algorithm and the construction of the stable initial basis. By experimental comparison, we show that our implementation is superior to the crossover scheme implementation.
On the Construction of Initial Basis in the Simplex Method
Korean Management Science Review, volume 17, issue 2, 2000, Pages 13~20
In this research, we compare and analyze the two initial basis construction procedures: LPAKO’s procedure proposed by Seo et. al. and symbolic crash procedure proposed by Maros et. al.. Based on the analysis, we present a new procedure which complements the previous procedures. The new procedure shows superiority to the previous procedures with respects to the optimality of initial basis. Also, the linear basis Also. the initial basis constructed by the new procedure reduces the number of simplex iterations.
A Web Decision Support System for Coordinating Production/Marketing Decisions under Distributed Decision Making Environment
Korean Management Science Review, volume 17, issue 2, 2000, Pages 21~37
This study proposes a Web Decision Support System (DSS) as a new approach to resolving conflicts arising at the interface of production and marketing which have traditionally been in conflict with each other. Many researchers studied on the types and resolution mechanisms of conflicts among various organizations and organizational units. However, as global and distributed operations of firms based on the Internet become a commonplace business landscape, these conflict resolution mechanisms are found very difficult to be directly applied. From this perspective, the Web DSS proposed in this study can be claimed to be appropriate for the Internet-based distributed business operations. The current related literature on the production-marketing interface shows that the possible use of the Web DSS approaches has little been studied in spite of the decent amount of research conducted on the coordination of decision making between the two functions. This paper develops the architecture of the Web DSS and demonstrates its effectiveness based on the implementation results.
A Causal-Forecasting Model using Guided Genetic Algorithm in Continuous Manufacturing Process
Korean Management Science Review, volume 17, issue 2, 2000, Pages 39~54
This paper presents a causal forecasting model using guided genetic algorithm in continuous manufacturing process. The guide genetic algorithm(GGA) is an extended genetic algorithm(GA) using penalty function and population diversity index to increase forecasting accuracy. GGA adds to the canonical GA the concept of a penalty function to avoid selecting the unproductive chromosomes and to make a proper searching direction. Also, GGA modifies the current population using the similarity of chromosomes to avoid falling into the trap of local optimal solution. For investigation GGA performance, we used a set of real data that was collected in local glass melting processes, and experimental results show the proposed model results in the better forecasting accuracy than linear regression model and canonical GA.
Machining Route Selection with Subcontracting Using Genetic Algorithm
Korean Management Science Review, volume 17, issue 2, 2000, Pages 55~65
This paper addresses a problem of machining route selection in multi-stage process with machine group. This problem is considered the subcontracting and the production in-house such as regular and overtime work. the proposed model is formulated as a 0-1 integer programming constraining the avaliable time of each machine for planning period and total overtimes. The objective of the model is to minimize the sum of processing cost, overtime cost, and subcontracting cost. To solve this model, a genetic algorithm(GA) approach is developed. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound. In results, the same optimal solution is obtained from two methods at small size problem, and the consistent solution is provided by the GA approach at large size problem. The advantage of the GA approach is the flexibility into decision-making process because of providing multiple machining routes.
A Scheduling Support System for Non-identical Parallel Machine Lines
Korean Management Science Review, volume 17, issue 2, 2000, Pages 67~73
This paper describes a scheduling support system for a plant where the machine environment may be modeled as non-identical parallel machine lines (NPML). That is, there are a number of stages in series with various different-capability-machines at each stage. Arriving continuously are jobs with their specific due dates, processing times and candidate processing machines. We’ve developed a real-time scheduling module in conjunction with a supporting production information system which supplies necessary data to the module. This scheduling module is one of the 9 modules in this system, and is composed of both a scheduling interface and a production monitoring interface. This module allows users to generate many candidate schedules by selecting their business policies. The selective arguments which are available consist of allocation costs, batch sizes and machine selection intervals. They are now being implemented at a powder metallurgy plant.
Object-Oriented Modeling and Implementation of a Class Library for Evolutionary Algorithms
Korean Management Science Review, volume 17, issue 2, 2000, Pages 75~86
In evolutionary algorithm, there exist various models for the evolution of the population with respect to schemes and strategies for reproduction. In the application of the algorithm to a specific problem, one model suitable to the problem is to be properly chosen and a program expert or a software is needed to help implement and test a designed algorithm. In this study, abject oriented modeling and the class library for simple evolutionary algorithms(SEA) with one population is developed. The library proposed here can be used as a generalized tool for solving problems in a wide range of domains.
Determination of Vehicle Fleet Size for Container Shuttle Service
Korean Management Science Review, volume 17, issue 2, 2000, Pages 87~95
This paper presents two analytical approaches to determine the vehicle fleet size for container shuttle service. The shuttle service can be defined as the repetitive travel between the designated places during working period. In the first approach, the transportation model is adopted in order to determine the number of vehicles required. Its advantages and disadvantages in practical application are also discussed. In the second approach, a logical network which is oriented on job is transformed from a physical network which is focused on demand site. Nodes on the logical network represent jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next job. Then a mathematical formulation is constructed similar to the multiple traveling salesman problem (TSP). A solution procedure is carried out based on the well-known insertion heuristic with the real world data.
The Controls of Client-Server System: Case Studies of Banks
Korean Management Science Review, volume 17, issue 2, 2000, Pages 97~113
The introduction of client server systems raises some serious IS control concerns. Although client server systems increase system flexibility and compatibility, and facilitates system downsizing and process restructuring, multiple operating systems, database management systems, and platforms of client-server system increase th potential exposures and risks of the system. It is needed to recommend the effective control framework to mitigate risks. This paper suggests risks and control framework for client server system. The results of two case studies indicate that program and database management are important as program and data should be located and maintained in client and servers. It becomes difficult to manage divided programs and data logic that are distributed across clients and servers that have different platforms. The case studies of two banks show that the extent of distribution of program and data logic affects the importance of program and database management controls.
Cost Driver Selection and Aggregation for Activity-Based Costing
Korean Management Science Review, volume 17, issue 2, 2000, Pages 115~124
Activity-Based Costing(ABC) is an accounting cost system which allocates the overhead cost to each cost object more accurately. ABC system achieves improved accuracy in estimating the cost of cost object by using multiple cost drivers to trace the cost of activities to the cost objects associated with the resources consumed by those activities. The selection and the aggregation of these cost driver candidates can pose difficult problems. This paper deals with these problems in mathematical programming approach. The first model is formulated as an integer programming model in cost driver selection and the second model is formulated as multi-objective goal programming model in reduction of cost drivers already selected.
Simulation-based Delivery Date Determination Algorithm
Korean Management Science Review, volume 17, issue 2, 2000, Pages 125~134
Keeping the promised delivery date for a customer order is crucial for a company to promote customer satisfaction and generate further businesses. For this, a company should be able to quote the delivery date that can be achieved with the capacity available on the shop floor. In a dynamic make-to-order manufacturing environment, the problem of determining a delivery date for an incoming order with consideration of resource capacity, workload, and finished-product inventory can hardly be solved by an analytical solution procedure. This paper considers a situation in which a delivery date for a customer order is determined based on a job schedule, and presents the SimTriD algorithm that provides the best scheduling for determining a delivery date of customer order through the job schedule that efficiently utilizes manufacturing resources with consideration of interacting factors such as resource utilization, finished-product inventory, and due date.
Subcontractor Evaluation Model for construction Industry Using AHP
Korean Management Science Review, volume 17, issue 2, 2000, Pages 135~150
Korean construction companies are recently facing stiff competition in free market economy, and construction projects tend to be complex and large-scale. Such an environment demands that construction companies ensure specialized subcontractors. This paper suggested a subcontractor evaluation model for selection of competent subcontractors which are equipped with operational, technical and productive ability. For designing a subcontractor model, AHP method as a group decision-marking method is applied in assigning weighting indices of evaluation elements. To verify this method, actual data collected in one of construction companies are analysed statistically.
Decision support Systems research in Korea (1985-1998): An Empirical Investigation through Exploratory Factor Analysis
Yoo, Sangjin ; Eom, Sean B. ;
Korean Management Science Review, volume 17, issue 2, 2000, Pages 151~159
This study applies factor analysis of an author cocitation frequency matrix derived from a database file that consists of a total of 1095 cited reference records taken from 95 citing decision support systems articles published in Korean journals. This study identified the influence of social psychology, cognitive psychology, management information systems, strategic management, and organizational behavior/organizational design to the development of group support systems, user-interface, and executive information systems research subspecialties. This research establishes a benchmark to be used in the future research, which is necessary to account for the ongoing changes in the intellectual development and structure of DSS Research in Korea before solid conclusion can be reached about the maturity and on-going development of the DSS field in Korean.
Implementing Data Envelopment Analysis Using SAS
Korean Management Science Review, volume 17, issue 2, 2000, Pages 161~174
This paper provides an implementation of data envelopment analysis (DEA) developed by Charnes et al. using SAS. Since a flexible interactive matrix language SAS/IML included in the SAS has a syntax similar with the matrix algebra, one can easily create and understand SAS/IML code for DEA. In this paper, a simple SAS/IML code for DEA and its illustrative implementation with an input-output data set of 25 American private university research libraries are provided.
Performance Evaluation of Vehicle Routing Algorithms in a Stochastic Environment
Korean Management Science Review, volume 17, issue 2, 2000, Pages 175~187
The stochastic vehicle routing problem (VRP) is a problem of growing importance since it includes a reality that the deterministic VRP does not have. The stochastic VRP arises whenever some elements of the problem are random. Common examples are stochastic service quantities and stochastic travel times. The solution methodologies for the stochastic VRP are very intricate and regarded as computationally intractable. Even heuristics are hard to develope and implement. On possible way of solving it is to apply a solution for the deterministic VRP. This paper presents a performance evaluation of four simple heuristic for the deterministic VRP is a stochastic environment. The heuristics are modified to consider the time window constraints. The computational results show that some of them perform very well in different cases of the stochastic VRP.