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
Selection of Suppliers with Minimum Costs in a Distributed Manufacturing Environment
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 1~10
With every passing month a number of new virtual enterprises emerge on the internet. Many companies have responded to the idea of distributed manufacturing in which the value adding activities comprising a finished product are dispersed geographically in a remote place. This study suggests an idea for selecting suppliers in a distributed manufacturing environment which enables machining companies to share their capacities. A mathematical model is constructed to show how to minimize the sum of the operation and transportation costs based on alternative process plans considering several kinds of operation characteristics in the real world. Four heuristic algorithms are developed to get an optimal or near-optimal solution using tabu search since the model is proven NP-hard. Example problems are tested to illustrate their procedure and performance.
Developing an lncentive System to Improve the Efficiency of Logistics Between Related Enterprises
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 11~22
The unit of competition is not a single firm any more but group of firms. They make a supply chain and compete with other chains. In this study we investigate success factors of supply chains from the supplying firms perspective. We consider various success factors such as commitmet trust communication confilct re-solving techniques vendor selection process and incentive systems. A set of hypotheses is tested based on the data collected from the electronics and automobile part manufacturers. Samples are divided by the length of the relationship between the vendor and assembler. joint problem solving under the long-term relationship plays an important role for the success of the supply chain. The findings offer insight into how to better manage the sup-ply chains.
Optimal Pricing Policy under Uncertain Product Lifetimes
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 23~31
Many studies in marketing and economics have attempted to model price and sales path under the dynamic diffusion process. Most of these models have been based on a fixed product lifetime. The current business climate requiring intensive development of new products however affects the diffusion of new products and their lifetime. Many products have not enjoyed the expected life cycle at the launching stage due to intense technical development competitive reactions, and financial problems. Most diffusion models however have not taken account of the lifetime uncertainty of new product. If the products do not last over the planning horizon set by those models. the optimal price derived from them could be futile. Therefore we had better take such lifetime uncertainty into consideration when developing diffusion models, In this paper we study the impact of uncertain product lifetime on its optimal pricing path in non-competitive market. We develop an optimal pricing model under uncertain product lifetimes and conduct a simulation study to investigate their effects on the optimal pricing and corresponding sales paths. The simulation study provides some interesting findings on optimal pricing policy under uncertain product lifetime. This study could be a stepping stone for the further extended study of optimal pricing strategy with uncertain product lifetime.
Transfer Batch Scheduling for a Flexible Flowshop with Identical Parallel Machines at Each Stage
;F. Fred Choobineh;
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 33~46
The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.
A Heuristic for Parallel Machine Scheduling with Due Dates and Ready Times
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 47~57
In this paper we consider an n-job non-preemptive and identical parallel machine scheduling problem of minimizing the sum of earliness and tardiness with different release times and due dates. In the real world this problem is more realistic than the problems that release times equal to zero or due dates are common. The problem is proved to be NP-complete. Thus a heuristic is developed to solve this problem To illustrate its suitability a proposed heuristic is compared with a genetic algorithm for a large number of randomly generated test problems. Computational results show the effectiveness and efficiency of proposed heuristic. In summary the proposed heuristic provides good solutions than genetic algorithm when the problem size is large.
An Approximation for the System Size of M/G/c Queueing Systems
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 59~66
In this paper we propose an approximation analysis for the system size distribution of the M/G/c system which is transform-free,. At first we borrow the system size distribution from the Markovian service models and then introduce a newly defined parameter in place of traffic intensity. In this step we find the distribution of the number of customers up to c. Next we concentrate on each waiting space of the queue separately rather than consider the entire queue as a whole. Then according to the system state of the arrival epoch we induce the probability distribution of the system size recursively. We discuss the effectiveness of this approximation method by comparing with simulation for the mean system size.
Determination of the Economical Target Value Through Sampling Inspectioni
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 67~76
We consider the determinant of the most economical target value through the sampling inspection by two consecutive machines. The machine sequence is fixed as products have to be processed by machine 1 first and then by machine 2 next, In this paper we assume that if quality of a unit is lower than inspection lower specification limited then the goods is not accepted, otherwise it is accepted. And we assume that the quality characteristics is larger-the-better characteristics and its distribution is the normal distribution whose standard deviation is known. This paper ends up with an numerical example by using the total expected profit function model that consider the scales profits inspection costs and material costs. And we analyze the variation of the total expected profit by changing coefficients of the functions.
Modeling Two-stage Choice Process
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 77~86
Consumers facing a large number of brands to choose from are known to use simplified heuristic to screen a set of relevant brands called the consideration set from the whole alternatives, Purchase decisions are then made from the brands in the consideration set, Two approaches have been suggested to model the two-stage choice process., One is to treat the con-sideration set as a crisp set (e.g Roberts and Lattin 1991) The other is to treat the set as a fuzzy set (e.g. Fortheringham 1988) The paper empirically compares the two types of models using data for soft drinks sneakers and departments. The results show that a model employing the crisp set approach fits the data better than that with the fuzzy set approach and better than a single-stage choice logit model.
A Broadband Local Access Network Design with Double-star Topology under Uncertain Demands
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 87~100
As a result of rapid advances in communication technology, fiber optics have begun to be adopted in most telecommunication systems 3s an economic choice Due to the trend of evolution toward broadband communication network with fiber optics and electronic devices. the network design problem for broadband communication has been received a great deal of research attention recently. In this paper, we address a topological design problem for broadband local access network with uncertain demands, which has received surprisingly little attention so far. in our problem, we select a set of hubs and links for constructing network expected penalty cost for the amount of undersupplied In addition to the usual cost terms of the fixed demand problem Our problem can be approximated as a mixed 0-1 integer programming problem by using Szwarc’s linear approximation technique. Then the problem is transformed successfully into a version of classical network design model. Some computational experiments for the model and concluding remarks are described.
A Genetic Algorithm for Backup Virtual Path Routing in Multicast ATM Networks
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 101~114
Multicasting is the simultaneous transmission of data to multiple destinations. In multicast ATM networks the effect of failures on transmission links or nodes can be catastrophic so that the issue of survivability is of great importance. However little attention has been paid to the problem of multicast restoration. This paper presents an efficient heuristic technique for routing backup virtual paths in ulticast networks with link failure. Genetic algorithm is employed here as a heuristic. In the application of genetic algorithm to the problem, a new genetic encoding and decoding method and genetic operators are proposed in this paper. The other several heuristics are also presented in order to assess the performance of the proposed algorithm. Experimental results demonstrate that our algorithm is a promising approach to solving the problem.
Determining the Single Most Vital Arc in the Maximum Flow Problem
Journal of the Korean Operations Research and Management Science Society, volume 25, issue 2, 2000, Pages 115~124
The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc in the maximum flow problem. We first define the transformed network corresponding to a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for single most vital arc consists of the arcs whose flow is at least as great as the flow over every arc in a minimal cut. As a result we present a method in which the most vital arc is determined more easily by computing the minimal capacity in the transformed network. the proposed method is demonstrated by numerical example and computational experiment.