• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.171-192
• /
• 1993

In this paper, a rule for dispatching operations, named the Most Dissimilar Resources (MDR) dispatching rule is presented. The MDR dispatching rule has been designed to maximize utilization of resources in a resource-constrained job shop with general precedence constraints. In shown that solving the above scheduling problem with the MDR dispatching rule is equivalent to multiple solving of the maximum clique problem. A graph theoretic approach is used to model the latter problem. The pairwise counting heuristic of computational time complexity O(n$^{2}$) is developed to solve the maximum clique problem. An attempt is made to combine the MDR dispatching rule with the existing look-ahead dispatching rules. Computational experience indicates that the combined MDR dispatching rules provide solutions of better quality and consistency than the dispatching rules tested in a resource-constrained job shop.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.1
• /
• pp.41-50
• /
• 1989

This paper deals with the problem of space allocation of items within a warehouse. Recognizing the importance of weights associated with material handling, mathematical models are developed for two cases, out-and-back selection and storage retrieval interleaving. It is proved that the density order index rule we proposed generates an optimal solution for the first model. An example problem solved with the pairwise interchange method indicates that the rule is also fairly efficient for the second model. The proposed rule is compared with other assignment rules of warehouse space such as COI rule, space and popularity.

• Korean Journal of Agricultural Science
• /
• v.38 no.1
• /
• pp.163-172
• /
• 2011

To provide the operation rule curve for suppling instream flow to urban stream from reservoir, the Soho reservoir with watershed area of 7.4 $km^2$ and total water storage of 2.58 $Mm^3$ was planned at the headwaters of the Daejeoncheon. Daily streamflow was simulated and using the simulated streamflow and desired instream flow, the operation rule curve by Senga method was drawn and evaluated through reservoir operation. Senga method is derived by accumulating the differences between streamflow and desired instream flow adversely. Water storages were simulated on a daily basis to supply urban instream flow from Soho reservoir, but the amount of supplying instream flow to urban stream was not nearly increased comparing with that of normal operation that does not used the rule curve. Thereafter the new simulation-based operation rule curve was derived and applied to supply instream flow from Soho reservoir. In normal operation, the amount of instream flow was shown to 15,000 $m^3$/d, but it was increased to 27,700 $m^3$/d in withdrawal limited operation using the new derived rule curve, in which the applicability of this rule curve was proved. Also comparing with the flow duration curves at station just before urban Daejeoncheon stream without and with upstream Soho reservoir, the 95th flow was decreased from 1.64 mm/d to 1.51 mm/d, and the 355th flow was increased from 0.17 mm/d to 0.30 mm/d. Monthly streamflows during October to March were increased from 10.6~24.1 mm to 24.1~34.0 mm with the increasing rate of 141~227%.

• Asian-Australasian Journal of Animal Sciences
• /
• v.21 no.11
• /
• pp.1559-1571
• /
• 2008

A rule was developed to constrain the annual rate of inbreeding to a predefined value in a population with different lifetimes between sires and dams, and to maximize the selection response over generations. This rule considers that the animals in a population should be divided into sex-age classes based on the theory of gene flow, and restricts the increase of average inbreeding coefficient for new offspring by limiting the increase of the mean additive genetic relationship for parents selected. The optimization problem of this rule was formulated as a quadratic programming problem. Inputs for the rule were the BLUP estimated breeding values, the additive genetic relationship matrix of all animals, and the long-term contributions of sex-age classes. Outputs were optimal number and contributions of selected animals. In addition, this rule was combined with the optimization of emphasis given to QTL, and further increased the genetic gain over the planning horizon. Stochastic simulations of closed nucleus schemes for pigs were used to investigate the potential advantages obtained from this rule by combining the standard QTL selection, optimal QTL selection and conventional BLUP selection. Results showed that the predefined rates of inbreeding were actually achieved by this rule in three selection strategies. The rule obtained up to 9.23% extra genetic gain over truncation selection at the same rates of inbreeding. The combination of the extended rule and the optimization of emphasis given to QTL allowed substantial increases in selection response at a fixed annual rate of inbreeding, and solved substantially the conflict between short-term and long-term selection response in QTL-assisted selection schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1841-1848
• /
• 1999

DELVAUX is a genetics-based inductive learning system that learns a rule-set, which consists of Bayesian classification rules, from sets of examples for classification tasks. One problem that DELVAUX faces in the rule-set learning process is that, occasionally, the learning process ends with a local optimum without finding the best rule-set. Another problem is that, occasionally, the learning process ends with a rule-set that performs well for the training examples but not for the unknown testing examples. This paper describes efforts to alleviate these two problems centering on the N-version learning approach, in which multiple rule-sets are learning and a classification system is constructed with those learned rule-sets to improve the overall performance of a classification system. For the implementation of the N-version learning approach, we propose a decision-making scheme that can draw a decision using multiple rule-sets and a genetic algorithm approach to find a good combination of rule-sets from a set of learned rule-sets. We also present empirical results that evaluate the effect of the N-version learning approach in the DELVAUX learning environment.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.36
• /
• pp.29-46
• /
• 2007

The fraud exception rule allows for the issuing bank to dishonor the claim if it the documents and transactions bear fraud though the documents presented are complied with the terms and conditions of the letter of credit. A question arises whether the fraud exception rule can apply to innocent beneficiary when fraud is made by 3rd party. United City Merchants v. Royal Bank of Canada showed a good example how to handle in case of innocent beneficiary. At this case House of Lord found that innocent beneficiary deserves payment applying nullity exception rule. I believe that the nullity exception rule is employed for the benefit of innocent beneficiary as far as the issuer and applicant get no actual damage by the 3rd party's fraudulent action which is shown on documents.

• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.12-21
• /
• 2004

This paper investigates the design of a priority rule in a multi-product disassembly environment. Specifically, it is concerned with product scheduling by which the inventory control of disassembled parts can be incorporated into a priority rule to reduce part lead times. The part lead time consists of two components: flow time and supply delay. The primary focus of the paper is on the development of a disassembly priority rule that aims to reduce the supply delay. We propose a priority rule, called Minimum Distance (MD) rule, to improve the supply delay performance. Finally, we provide a comparative analysis on the performance of traditional rules and the new rule proposed in this paper via a simulation model.

• Journal of Korean Ophthalmic Optics Society
• /
• v.7 no.2
• /
• pp.47-54
• /
• 2002

This study as performed to survey symmetrical and asymmetrical astigmatism among 1,100 patients(2,200eyes) who were prescribed with spectacles. Of the 2,200 eyes, 59.3%(1,305 eyes) had astigmatism. Among all patients, 21.4%(235 patients) had unilateral astigmatism, 48.6%(535 patients) had bilateral astigmatism. In 1,070 eyes(535 patients) with the bilateral astigmatism, the orientation of astigmatism were 61.2% for with-the-rule astigmatism, 24.7% for against-the-rule astigmatism and 14.1% for oblique astigmatism. On the astigmatic power, -0.25~-0.50D was 47.5%, -0.75~-1.00D was 29.9%. Symmetrical astigmatism was 83.4% of the bilateral astigmatism. Asymmetrical astigmatism was 16.6% of them. From 41 to 50 years of age, 45.4% of the age had symmetrical astigmatism, 14.3% had asymmetrical astigmatism. Types of the left and the right eye in symmetrical astigmatism consisted of with-the-rule astigmatism and with-the-rule astigmatism(65.5%), against-the-rule astigmatism and against-the-rule astigmatism(25.3%), oblique astigmatism and oblique astigmatism(5.6%), etc. In asymmetrical astigmatism, with-the-rule astigmatism and oblique astigmatism was 23.6%, oblique astigmatism and with-the-rule astigmatism was 20.2%. As the results of this study, most of spectacles wearers had bilateral astigmatism that was more than unilateral astigmatism. Symmetrical astigmatism was 5 times more than asymmetrical astigmatism with no sex differences. Especially, symmetrical and asymmetrical astigmatism were more in forties than in other age groups. Over the half of symmetrical astigmatism was with-the-rule astigmatism in the left eye and with-the-rule astigmatism in the right eye. These findings will be used in prescriptions for more comfortable vision.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.145-150
• /
• 1997

In this paper is studied a method of fuzzy logic control based on possibly inconsistent if-then rules representing uncertain knowledge or imprecise data. In most cases of practical applications adopting fuzzy if-then rule bases, inconsistent rules have been considered as ill-defined rules and, thus, not allowed to be in the same rule base. Note, however, that, in representing uncertain knowledge by using fuzzy if-then rules, the knowledge sometimes can not be represented in literally consistent if-then rules. In this regard, when it is hard to obtain consistent rule base, we propose the weighted rule base fuzzy logic control depending on output performance using neural network and we will derive the weight update algorithm. Computer simulations show the proposed method has good performance to deal with the inconsistent rule base fuzzy logic control. And we discuss the real application problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.4
• /
• pp.375-381
• /
• 2014

Data mining is a process of discovering useful patterns or information from large amount of data. Decision tree is one of the data mining algorithms that can be used for both classification and prediction and has been widely used for various applications because of its flexibility and interpretability. Decision trees for classification generally generate a number of rules that belong to one of the predefined category and some rules may belong to the same category. In this case, it is necessary to determine the significance of each rule so as to provide the priority of the rule with users. The purpose of this paper is to propose a rule selection method in classification tree models that accommodate the umber of observation, accuracy, and effectiveness in each rule. Our experiments demonstrate that the proposed method produce better performance compared to other existing rule selection methods.