• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.1
• /
• pp.87-99
• /
• 1997

This paper considers warranty servicing for repairable products when product lifetimes are phase-type(PH) distributions. Two replace-repair strategies are analyzed based on renwal processes. The quantities of interest can be expressed in terms of the renewal function which, in general, is very difficult to evaluate. By exploiting properties of PH distributions we obtain simplification to evaluate these performance measures. Numerical examples for four different PH distributions with typical functions are presented and the results are discussed.

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.199-214
• /
• 1999

The Constructive Battle Simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under real-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. Conventionally, scheduling and resource allocation activities which have timing constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rate monotonic scheduling.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.338-341
• /
• 2005

In this paper, we present analytic forms of the ordered weighted averaging (OWA) operator weighting functions, each of which has properties of rank-based weights and a constant level of orness, irrespective of the number of objectives considered. These analytic forms provide significant advantages for generating OWA weights over previously reported methods. First, OWA weights can be efficiently generated by use of proposed weighting functions without solving a complicated mathematical program. Moreover, convex combinations of these specific OWA operators can be used to generate OWA operators with any predefined values of orness once specific values of orness are α priori stated by decision maker. Those weights have a property of constant level of orness as well. Finally, OWA weights generated at a predefined value of orness make almost no numerical difference with maximum entropy OWA weights in terms of dispersion.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.763-776
• /
• 2018

In this paper we consider the element-wise (Hadamard) product (or sum) of elliptic divisibility sequences and study the periodic structure of these sequences. We obtain that the element-wise product (or sum) of elliptic divisibility sequences are periodic modulo a prime p like linear recurrence sequences. Then we study periodicity properties of product sequences. We generalize our results to the case of modulo $p^l$ for some prime p > 3 and positive integer l. Finally we consider the p-adic behavior of product sequences and give a generalization of [9, Theorem 4].

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.1
• /
• pp.135-146
• /
• 1991

This paper shows the infinite horizon model of Partially Observable Markov Decision Process with lagged information. The lagged information is uncertain delayed observation of the process under control. Even though the optimal policy of the model exists, finding the optimal policy is very time consuming. Thus, the aim of this study is to find an .eplison.-optimal stationary policy minimizing the expected discounted total cost of the model. .EPSILON.- optimal policy is found by using a modified version of the well known policy iteration algorithm. The modification focuses to the value determination routine of the algorithm. Some properties of the approximation functions for the expected discounted cost of a stationary policy are presented. The expected discounted cost of a stationary policy is approximated based on these properties. A numerical example is also shown.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.71-84
• /
• 2009

This paper considers a remanufacturing and purchasing planning problem, in which either used products(or wastes) are remanufactured or remanufactured products(or final products) are purchased to satisfy dynamic demands of remanufactured products over a discrete and finite time horizon. Also, as remanufactured products are purchased more than or equal to a special quantity Q, a discount price policy is applied. The problem assumes that the related cost(remanufacturing and inventory holding costs of used products, and the purchasing and inventory holding costs of remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to determine the optimal remanufacturing and purchasing policy that minimizes the total cost to satisfy dynamic demands of remanufactured products. This paper characterizes the properties of the optimal policy and then, based on these properties, presents a dynamic programming algorithm to find the optimal policy. Also, a network-based procedure is proposed for the case of a large quantity of low cost used products. A numerical example is then presented to demonstrate the procedure of the proposed algorithm.

• Journal of the military operations research society of Korea
• /
• v.22 no.1
• /
• pp.114-128
• /
• 1996

In this paper, a life distribution fitting method based on generalized phase-type distributions(GPH) is presented. By fitting the life distribution to a GPH, we can utilize various useful properties of the GPH. Two different approaches are used according to the properties of the given failure time data. One is an approximation to a GPH through the piecewise Weibull failure rate(PWF) model and the other is a direct approximation to a GPH using the empirical distribution function. Two numerical examples are also presented. In the first example, both of the two approaches are utilized and compared for an incomplete data set. And in the second example, the direct approximation method from an empirical distribution is utilized for the analysis of a complete data set. In both cases, we could confirm the validity of the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.2
• /
• pp.19-35
• /
• 2010

Many papers have used a two-stage approach of first calculating DEA efficiency scores and then seeking to correlate these scores with various environmental variables. Most of the studies have not checked whether such a two-stage approach is statistically valid for identifying significant environmental variables. Recently Simar and Wilson (2007) (SW) introduce a sensible data generating process and bootstrap procedure based on truncated regression for the two-stage approach. Banker and Natarajan (2008) (BN) provide a statistical foundation for the two-stage approach comprising a DEA followed by an ordinary least squares or maximum likelihood estimation. Researchers have to identify an approach suitable for their research circumstances in terms of properties, merits, demerits, and robustness to plausible departures from its chosen data generating process. We summarize the foundations and properties of the two-stage procedures suggested by SW and BN. And we discuss merits and demerits of those procedures. Also using Monte Carlo simulation we assess their relative performance under several misspecified settings.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.87-87
• /
• 1989

There have been lots of research on temporal data management for the past two decades. Most of them are based on some logical data model, especially on the relational data model, although there are some conceptual data models which are independent of logical data models. Also, many properties or issues regarding temporal data models and temporal query languages have been studied. But some of them were shown to be incompatible, which means there could not be a complete temporal data model, satisfying all the desired properties at the same time. Many modeling issues discussed in the papers, do not have to be done so, if they take object-oriented data model as a base model. Therefore, this paper proposes a temporal data model, which is based on the object-oriented data model, mainly discussing the most essential issues that are common to many temporal data models. Our new temporal data model and query language will be illustrated with a small database, created by a set of sample transaction.

• Journal of the military operations research society of Korea
• /
• v.18 no.2
• /
• pp.167-180
• /
• 1992

This paper considers a two-location production and inventory model for a single product which can be produced and demanded at each of two locations. Demands during a finite number of discrete time periods are known and must be satisfied by production, inventory or transshipment. We consider the change of production capacity. The costs to be incurred are restricted to production, inventory and transshipment costs, and all cost functions we assumed to be concave. The objective is to minimize the total cost of production, inventory and transshipment. The model is formulated as a shortest path problem for an acyclic network from which properties associated with optimal solutions are derived. Using these properties. we develop a dynamic programming algorithm that finds optimal solutions for problems.