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 18, Issue 3 - Dec 1993
Volume 18, Issue 2 - Aug 1993
Volume 18, Issue 1 - Apr 1993
Selecting the target year
Analysis and Design of Control Strategies in Manufacturing Systems with Serial Stages
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 1~12
Several alternative manufacturing control strategies are under study in the literature. They are, specifically, push system, pull system, conwip system, and as a special case, infinite buffer system. We focus on modeling, comparison analysis and design of these systems. The event epoch sequences of each system are generated which also enable us to compare their performance. Then the stochastic monotonicity of these enent epoch sequences in several important design parameters are established through the structure of the generalized semi-Markov schemes on which they are based. Finally, we solve the stochastic optimization problem which minimizes these event epochs. Our results supplement the applicability of some previously known results in the literature.
On Parallel Implementation of Lagrangean Approximation Procedure
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 13~34
By operating on many part of a software system concurrently, the parallel processing computers may provide several orders of magnitude more computing power than traditional serial computers. If the Lagrangean approximation procedure is applied to a large scale manufacturing problem which is decomposable into many subproblems, the procedure is a perfect candidate for parallel processing. By distributing Lagrangean subproblems for given multiplier to multiple processors, concurrently running processors and modifying Lagrangean multipliers at the end of each iteration of a subgradient method,a parallel processing of a Lagrangean approximation procedure may provide a significant speedup. This purpose of this research is to investigate the potential of the parallelized Lagrangean approximation procedure (PLAP) for certain combinational optimization problems in manufacturing systems. The framework of a Plap is proposed for some combinatorial manufacturing problems which are decomposable into well-structured subproblems. The synchronous PLAP for the multistage dynamic lot-sizing problem is implemented on a parallel computer Alliant FX/4 and its computational experience is reported as a promising application of vector-concurrent computing.
Analysis and Classfication of Heuristic Algorithms for Node Coloring Problem
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 35~49
The node coloring problem is a problem to color the nodes of a graph using the minimum number of colors possible so that any two adjacent nodes are colored differently. This problem, along with the edge coloring problem, has a variety of practical applications particularly in item loading, resource allocation, exam timetabling, and channel assignment. The node coloring problem is an NP-hard problem, and thus many researchers develop a number of heuristic algorithms. In this paper, we survey and classify those heuristics with the emphasis on how an algorithm orders the nodes and colors the nodes using a determined ordering.
Mean Waiting Time Analysis of Cyclic Server System under N-Policy
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 51~63
We consider a cyclid server system under N-policy. This system consists of multiple queues served in a cyclic order by a single server. In this paper, we consider the following control policy. Every time server polls one queue, the server inspects the state of the queue. If the total number of units is found to have reached or exceeded a pre-specified value, the server begins to serve the queue until it is empty. As soon as the queue becomes empty, the server polls next queue. An approximate analysis of this system is presented. Sever vacation model is used as an analytical tool. However, server vacation periods are considered to be dependent on the service times of respective queues. The results obtained from the approximate analysis are ompared with simulation results.
Changes in Risk-taking Bahavior in Repetitive Choice Situation
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 65~77
It is not to observe that a decision-maker frequently changes his choice strategy in the repetitive gamble choice situation. This change in risk preference attitude, however, is not well explained with the existing gamble choice models, such as Bell's disappointment-elation model which is an interesting extension of the classical MEU model. This paper shows that this change in risk preference attitude should be interpreted as a systematic transition of "d" and "e", the disappointment and elation constants of Bell's model repectively. A laboratory experiment is also performed to identify the factors which greatly affect the decision-makers' risk preference attitude change. The number of consecutive successes/failures and the amount of remaining capital found to be statistically significant factors.significant factors.
Identification and Extraction of Reusable Linear Programming Model Components
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 79~100
This paper proposes an idea of reverse modeling that analyzes LP models and then converts them into an object-oriented model repository. The process of reverse modeling consists of (1) identifying and analyzing source models by meta processor, (2) model decomposition and generalization to scan the models and divide them into model components, and (3) deriving model selection rules from the components by rule generator. Through the process, we can extract reusable model components and build a model base with model selectioon rules. Examples with models created by SML and MODLER modeling languages are given to illustrate the methods. The model base management capabilities provided by reverse modeling can increase the reusabioity of current modeling tools.
On the Visual Representation of Linear Programming Problem by a Projection Method
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 101~111
The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.
A Substitution Model of the Evolutionary Generations of Technological Products
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 113~127
In this study, a substitution model of the evolutionary generations of technological products is presented. The purpose of the model is to examine the demand side mechanisms which generate successive product life cycles along the path of technological improvements. In the model, the nature of substitution processes is summarized dto the demand function which is derived from the consumer's udtility maximization problem. To describe the nature of technological substitution processes, the concept of the vertical differentiation and the consumption externalities are considered in the utility function. The former is used to characterize the result of technological improvement and the latter is used in explaining the inertia of demand. To show the validity of the model, an empirical study is carried out using the data of the world DRAM market.
A Modular Decomposition Model for Software Project Scheduling
Kim, Kiseog ; Nag, Barin N. ;
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 129~149
The high level of activity in the development and maintenance of computer software makes the scheduling of software projects an importnat factor in reducing operating costs and increasing competitiveness. Software activity is labor intensive. Scheduling management of hours of software work is complicated by ther interdependencies between the segments of work, and the uncertainties of the work itself. This paper discusses issues of scheduling in software engineering management, and presents a modular decomposition model for software project scheduling, taking advantage of the facility for decomposition of a software project into relatively independent work segment modules. Modular decomposition makes it possible to treat scheduling as clustering and sequencing in the context of integer programming. A heuristic algorithm for the model is presented with some computational experiments.
Input Quantity Control in a Multi-Stage Production System with Yield Randomness, Rework and Demand Uncertainty
Park, Kwangtae ; Kim, Yun-Sang ;
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 151~157
In this paper, we investigate the effects of yield randomness for lot-sizing in a multi-stage production system. The practical importance of incorporating yield randomness into production models has been emphasized by many researchers. Yield randomness, especially in semiconductor manufacturing, poses a mojor challenge for production planning and control. The task becomes even more difficult if the demand for final product is uncertain. An attempt to meet the demand with a higher level of confidence forces one to release more input in the fabrication line. This leads to excessive work-in-process (WIP) inventories which cause jobs to spend unpredictably longer time waiting for the machines. The result is that it is more difficult to meet demand with exceptionally long cycle time and puts further pressure to increase the safety stocks. Due to this spiral effect, it is common to find that the capital tied in inventory is the msot significant factor undermining profitability. We propose a policy to determine the quantity to be processed at each stage of a multi-stage production system in which the yield at each stage may be random and may need rework.
The Effects of the Scope of Plant Layout Conversion on Manufacturing Cell Design Processes and Outcomes
Choi, Moon-Jin ;
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 159~177
One of major research issues in cellular manufacturing is studing factors that are fovorable or detrimental to the conversion of traditional functional layouts to GT cellular layouts. Among many factors, this paper explored plausible relationships between the scope of plant conversion and the manufacturing cell design processes and outcomes. The cell design practices of 28 U. S. plants were surveyed through a mail questionaire. While most relationships were not statistically significant, some interesting findings and insights could be drawn. With this researhc, we can better understand a part of relationships between the company's conversion strategy and the cell design strategies and outcomes.
System Size and Service Size Distributions of a Batch Service Queue
Lee, Soon-Seok ; Lee, Ho-Woo ; Yoon, Seung-Hyun ; Nadrajan, R. ;
Journal of the Korean Operations Research and Management Science Society, volume 18, issue 3, 1993, Pages 179~186
We derive the arbitrary time point system size distribution of M/
1 queue in which late arrivals are not allowed to join the on-going service. The distribution is given by P(z) =
(z) is the probability generating function of the queue size and
(.theta.) is the Laplace-Stieltjes transform of the service time distribution function. We also derive the distribution of the service siez at arbitrary point of time. time.