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 17, Issue 3 - Dec 1992
Volume 17, Issue 2 - Aug 1992
Volume 17, Issue 1 - Apr 1992
Selecting the target year
Application of Genetic Algorithms to a Job Scheduling Problem
;;Lee, Chae Y.;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 1~12
Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.
The Effects of Set-up Cost Reduction in the Dynamic Lot Size Model and the EOQ model
;Lee, Sang Bum;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 13~26
Set-up reduction is an important aspect of the Japanese Just-In-Time (JIT) and Zero Inventory (ZI) concepts. In this paper, we first analyze the effects of set-up cost reduction on tatal inventory, average lot size and forecast horizon in the dynamic lot size model. We also examine the various effects of set-up cost reduction in the EOQ model and explain why many Japanese firms try to cut set-up cost and/or set-up time greatly.
(r, Q) Policy for Operation of a Multipurpose Facility
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 27~46
This paper considers an (r, Q) policy for operation of a multipurpose facility. It is assumed that whenever the inventory level falls below r, the model starts to produce the fixed amount of Q. The facility can be utilized for extra production during idle periods, that is, when the inventory level is still greater than r right after a main production operation is terminated or an extra production operation is finished. But, whenever the facility is in operation for an extra production, the operation can not be terminated for the main production even though the inventory level falls below r. In the model, the demand for the product is assumed to arrive according to a compound Poisson process and the processing time required to produce a product is assumed to follow an arbitary distribution. Similarly, the orders for the extra production is assumed to accur in a Poisson process are the extra production processing time is assumed to follow an arbitrary distribution. It is further assumed that unsatisfied demands are backordered and the expected comulative amount of demands is less than that of production during each production period. Under a cost structure which includes a setup/ production cost, a linear holding cost, a linear backorder cost, a linear extra production lost sale cost, and a linear extra production profit, an expression for the expected cost per unit time for a given (r, Q) policy is obtained, and using a convex property of the cost function, a procedure to find the optimal (r, Q) policy is presented.
Determination of the Optimal Job Sequence on the Flow-Shop Type FMS Considering the AGVs' Entering Interval
;;Yang, Dae Yong;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 47~57
The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGV's) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system. An algorithm is developed to determine the optimal job sequence which minimizes the vehicle idle time on the line and the production makespan by the use of the entering interval and travel time between workcenters. An entering times of AGV's and the minimum number of AGV's required are calculated by optimal job sequence. When the numbe rof AGV's is limited, enterling times of AGV's are adjusted to maximize the efficient use of vehicles. A numerical example is given to illustrate the application of the algorithm.
A Method Identifying the Optimal Nonbasic Columns for the Problem Size Reduction in Affine Scaling Algorithm
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 59~65
A modified primal-dual affine scaling algorithm for linear programming is presented. This modified algorithm generates an elipsoid containing all optimal dual solutions at each iteration, then checks whether or not a dual hyperplane intersects this ellipsoid. If the dual hyperplane has no intersection with this ellipsoid, its corresponding column must be optimal nonbasic. By condensing these columns, the size of LP problem can be reduced.
Interactive Fuzzy Multiobjective Decision-Making with Imprecise Goals
;;Hong, S. L.;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 67~78
MODM (multiobjective decision-making) problem is very complex system for the analyst. The problem is more complex if the goals of each of the objective functions are expressed imprecisely. It requires suitable MODM method to deal with imprecisions. Therefore, we present a new interactive fuzzy decision making method for solving multiobjective nonlinear programming problems by assuming that the decision maker (DM) has imprecise goals that assume fuzzy linguistic variable for each of the objective functions. The imprecise goals of the DM are quantified by eliciting corresponding membership functions through the interactive with the DM out of six membership functions. After determining membership functions, in order to generate the compromise or satisficing solution which is .lambda.-pareto optimal, .lambda.-max problem is solved. The higher degree of membership is chosen to satisfy imprecise goals of all objective functions by combining the membership functions. Then, the values are the compromise or satisficing solution. On the basis of the proposed method, and interactive computer programming is written to implement man-machine interactive procedures. Our programming is a revised version of sequential unconstrained minimization technique. Finally, a numerical example illustrates various aspects of the results developed in this paper.
A Model Formalization Methodology of Discrete Event Simulation with Formal Tools
;;Jeong, Young Sik;Baik, Doo Kwon;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 79~99
The DEVS (Discrete Event system Specification) formal model for discrete event simulation is a hierarchical, modular model. Because the DEVS formal model has a mathematical structure, it provides a theoretic background of discrete event simulation model. However, the DEVS formal model is difficult to understand because of its mathematical structure. Also, since the DEVS formal model is often constructed by heuristic, subjective method of model designer from the model, a systematic model built-in methodology does not exist. In this paper, we propose the model formalization methodology from an informal model to the DEVS formal model. For this formalization methodology, we introduce formal tools for model construction based on the DEVS ( from an informal model : Event Dependency Graph (EDG) for the event analysis and State Representation Graph(SRG) for the system state analysis.
Changes in The Industry Environment and Strategic Changes of Businesses : The Korean Tile Industry 1986~1990
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 101~135
An an exploratory attempt, this study examines the patterns of strategic changes of the firms and changes in strategic group structure in response to environmental changes of the industry. Empirical analyses of 39 firms in the Korean tile industry for the period of 1986-1990 reveals that :1) environmental changes had different impacts on attractiveness of different product/market segments :2) the relatively large firms in less attractive product/market segments were more likely to change their domains :3) according to their specific target product/market segments, the firms tended to strengthen different resource capabilities which were identified as key success factorss to compete in each target segment : and 4) these differences in strategic changes of the firms resulted in the changes in strategic group structure during the same period. Implications and the limitations of this study are finally discussed.
Multiple Product Single Facility Stockout Avoidance Problem (SAP) and Weighted Stockout Problem (WSP)
Moon, Il-Kyeong ;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 137~158
We study the Multiple Product Single Facility Stockout Avoidance Problem (SAP). That is the problem of determining, given initial inventories, whether there is a multiple product single facility production schedule that avoids stockouts over a given time horizon. The optimization version of the SAP where stockouts are pnelized linearly is also studied. We call this problem the Weighted Stockout Problem (WSP). Both problems are NP-hard in the strong sense. We develop Mixed Integer Linear Programming (MIP) formulations for both the SAP and the WSP. In addition, several heuristic algorithms are presented and performances are tested using computational experiments. We show that there exist polynomial algorithms for some special cases of the SAP and the WSP. We also present a method to phase into a target cyclic schedule for infinite horizon problems. These can be used as a practical scheduling tool for temporarily overloaded facilities or to reschedule production after a disruption.
Iterative time constraint addition algorithm for the crew scheduling problem
Peak, Gwan-Ho ;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 159~170
The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.
Solving Linear Problems with Generalized Variable Upper Bounds
Yang, Kwang-Min ;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 171~180
This paper proposes a solution approach to linear problems with many constraints of variable upper bound (VUB) type. This type of constraints are commonly found in various scheduling type problems for which tighter bounds are essential to achieve an efficiency in enumeration. An analytical framework based on factorization is adopted to devise a solution approach to the problem and extend it for more generalized VUB problem (GVUB). This research shows why the VUB type constraints are amenable to the factorization and gives a unified approach to generalized upper bound(GUB) problems, VUB problems and GVUB problems. Implementation issues are also included.
Reliability of a Consecutive-k-out-of n : G System with Common-Cause Outage
Kim, Ho-Yong ; Jung, Kyung-Hee ;
Journal of the Korean Operations Research and Management Science Society, volume 17, issue 3, 1992, Pages 181~193
This paper shows the model of a consecutive-k-out-of-n :G system with common-cause outages. The objective is to analytically derive the mean operating time between failures for a non-repairable component system. The average failure time of a system and the system availability are also considered. Then, the model is extended to a system with repairable components and unrestricted repair, in which service times are exponentially distributed.