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 25, Issue 4 - Dec 2000
Volume 25, Issue 3 - Sep 2000
Volume 25, Issue 2 - Jun 2000
Volume 25, Issue 1 - Mar 2000
Selecting the target year
Determination of Control Efficiency in EDI : DEA Approach
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 1~13
Electronic Data Interchange (EDI) has a significant impact on business practices by eliminating paper related adult trails and enabling transactions to be processed at high speed without human intervention. Major advantages advangtages and benefits derived from EDI, however, depend upon the usage of EDI controls. Management must determine whether their investment on EDI controls is appropriate, as the establishment of EDI controls demandds much resources and high skills. This study proposes data envelopment analysis model to identify efficient and inefficient EDI control systems in various context of input (formal and automated EDI controls) and output (EDI implementation and performance). DEA can also determine the factors that are significantly different between efficient and inefficient groups. The model is tested using data collected form EDI adopters.
Analysis of a Departure Process on the Population Constrained Tandem Queueing Network with Constant Service Times
Young Rhee ;
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 15~26
We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network can not exceed a given value k. Customers arriving at the queueing network when there are more than k customers are forced to walt in an external queue. The arrival process to the queueing network is assumed to be arbitrary. It is known that the queueing network with population constrant and constant service times can be transformed into a simple network involving only two nodes. In this paper, the departure process from the queueing network is examined using this simple network. An approximation can be calculated with accuracy. Finally, validations against simulation data establish the tightness of these.
A complexity analysis of a "pragmatic" relaxation method for the combinatorial optimization with a side constraint
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 27~36
We perform a computational complexity analysis of a heuristic algotithm proposed in the literature for the combinatorial optimization problems extended with a single side-constraint. This algorithm, although such a view was not given in the original work, is a disguised version of an optimal Lagrangian dual solution technique. It also has been observed to be a very efficient heuristic producing near-optimal solutions for the primal problems in some experiments. Especially, the number of iterations grows sublinearly in terms of the network node size so that the heuristic seems to be particularly suitable for the applicatons such as routing with semi-real time requirements. The goal of this paper is to establish a polynomal worst-case complexity of the algorithm. In particular, the obtained complexity bound suports the sublinear growth of the required iterations.
Mean value analysis of re-entrant lines with batch machines processing multiclass jobs
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 37~50
We are concerned with estimating the average performance of a re-entrant line with single-job machines and batch machines. The system has multiclass jobs, which will be processed in predetermined routes. An analytical approach may be intractable since the system would not be modeled by product form queueing networks due to the inclusion of batch machines and the consideraton of multiclass jobs which have different processing times. We propose an approximation method based on the Mean Value Analysis(MVA). Our method obtains the mean walting time in each buffer of a workstation and the mean cycle time using the MVA and heuristics. numerical experiments show that the errors of our method are within 5% compared with simulation.
A Genetic Algorithm for Line Balancing in the Multiple U-Typed Lines
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 51~65
Multiple U-typed producton lines are increasingly accepted in modern marufacturing system for the flexbility to adjust to changes in demand. This paper considers multiple U line balancing with the objective of minimizing cycle time considering the moving time of workforce given the number of workstation. Like the traditional line balancing problem this problem is NP-hard. In this paper, we show how genetic algorithm can be used to solve multiple U line balancing problem. For this, an encoding and a decoding method suitable to the problem are presented. Proper genetic operators are also employed. Extensive computational experiments are carried out to show the performance of the performance of the purposed algorithm. The computational results show that the algorithm is promising in solution quality.
A dual based heuristic for the hub location and network design problem with single assignment constraint
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 67~84
In this paper, we address a network design problem including the decision of hub facility locatiions which is typically found in a communicatio and a transportation network design studies. Due to the administrative and the geographical restrictions, it is common to assume that each user should be assigned to only one hub facility. To construct such a network, three types of network costs should be considered: the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with transversing the network. The complex problem is formulated as a mixed IP embedding a multicommodity flow problem. Exploiting its special structure, a dual-based heuristic is then developed, which yields near-optimal design plans. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.
Integrated Channel Management Schemes in Cellular Mobile Systems
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 85~92
Channel management is critical in designing a cellular mobile system that offers high capacity and high quality. In this paper, an integrated channel management scheme is proposed, which consists of a dynamic channel allocation scheme and an admission control scheme. The dynamic channel allocation scheme allocates a call request the channel which minimizes the impact on its interfering cell, and consists of two types of channel allocation strategies : nominal channel allocation strategy and non-nominal channel allocation strategy. The admission control scheme named the variable cutoff priority scheme reserves some frequency channels for handoff cells in each cell the number of which varies according to the blocking probability of handoff class in that cell. Computationl tests are performed to evaluate the performance of the proposed scheme in terms of overall blocking probability, defined by the weighted value of the blocking probabilities of new calls and handoff calls. The results show that the proposed scheme yields better performance than other compared schemes.
A Study of the Effects of Agent Activeness on Team Performance
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 93~104
Passive agents participate in team activities passively, that is, only upon requst, whereas active agents involve themselves voluntarily. Teams composed of active agents are generally believed to perform better than those with passive agents. In this paper, by using a computational simulation model we examine the effect of agent activeness on the efficiency of decision-making teams that access different amout of information. "Team-Soar" is a computational fraemwork that consists of a group of interconnected individual Al agents (i.e., Soar). A simulation experiment using Tearm-Soar was performed. Results of the simulation provide valuable insights on the roles of agent activeness. For example, the impact of having more active agents becomes more sigfniciant as the amout of information to process increases and when the team decision efficiency is important. Some of the results are counter-intultive and therefore provides an opportunity to understand the roles of the agnet activeness more deeply. For instance, the simulation results reveal that having more active agents did not always enhance team efficiency. Conclusively, the simulation experiment demonstrates how computational models contribute to the research of agents social characteristics.teristics.
A Study on the Relatonship between Transformational Leadership, Group-efficacy, and Group Performance
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 1, 2000, Pages 105~124
The purpose of this paper is to investigate the relationships among transformatonal leadership, gropefficacy, and group performance. A total of 321 empolyees of a fire and marine insurance frim in Seoul anonymously completed the Multifactor Leadership Questionnaire-Form V, which consists of three factors(charisma, individualized consideration and intellectual stimulation) for transformational leadership, and two factors(contingent reward and management by exception) for transactional leadership. The sample, which largely consists of sales supervisors and salesmen, includes 41 sales office branches. The findings of the study are as follows. Transformational leadership is closely associated with group-efficacy and group performance. That is, there are significant correlations between transformational factors and group-efficacy, between the factors and group performance, and between group-efficacy and group performance. A stepwise multiple regressio analysis revealed that transformational leadership augmented the subordinates's extra efforts. It was also found that group-efficacy was mediating the relationship between transformational leadership and group performance. The managerial implications of these findings and future directions of research are also discussed.