This report concerns the study of deciding replacement requirements for 1/4ton truck in Korea. Two causes of replacement, accidental loss and wearout are considered in the replacement requirements model which was developed in Defence Logistics Agency. The model represents the state of 1/4 ton truck inventory over time as a finite Markov chain process. An accidental loss rate, yearly usage rates. wearout rates are used in conjuction with the current mileage distribution of the inventory to forecast replacement requirements in future time periods.

Participation of ROK navy in the Rim of the Pacific(RIMPAC) in likely to stimulate rethinking of Korea's defense role in Northeast Asia. Although the RIMPAC exercise was originally maneuvers to improve combat techniques in ASW, anti-aircraft combat. ocean supply support. surface combat. and electronics warfare. it will be finally be directed to ward securing the SLOC connecting the US, Canada. Australia and the Far East. Based on this concept, my conclusion is that two future arrangements are possible for the security of the Korean peninsula and protecting the SLOC in the combined defense of the Pacific. One is the naval cooperation between ROK and Japan. the other is the Standing Naval Force Pacific(STANAVFORPAC) The concepts of the Naval Cooperation between ROK and Japan and the STANAVFORPAC is whose time has come. The leaders, policymakers, and planners of the countries concerned need to consider such a move seriously.

Consider N queues without arrivals and with m identical servers. All jobs are independent and service requirements of jobs in a queue are i.i.d. random variables. At any time only one server may be assigned to a queue and switching between queues are allowed. A unit cost is imposed per job per unit time. The objective is to minimized the expected total cost. An flow approximation model is considered and an upperbound for the percentage error of best nonswitching policies to an optimal policy is found. It is shown that the best nonswitching policy is not worse than $11\%$ of an optimal policy For the stochastic model, we consider the case in which the service requirements of all jobs are i.i.d. with an exponential distribution. A longest first policy is shown to be optimal and a worst case analysis shows that the nonswitching policy which starts with the longest queues is not worse than $11\%$ of the optimal policy.

There has been a great deal of research dealing with the optimal replacement of stochastically deteriorating equipment and research in queueing systems with a finite calling population. However. there has been a lack of research which combines these two areas to deal with optimal replacement for a fixed number of machines and a limited number of repairmen. In this research, an optimal control policy for replacement involving two machines and one repairman is developed by investigating a class of age replacement policies in the context of controlling a G/M/1 queueing system with a finite calling population. The control policy to be imposed on this problem is an age-dependent control policy, described by the control limit $t^{\ast}$. The control limit is operational only when the repairman is idle; that is. if both machines are working, as soon as a machine reaches the age $t^{\ast}$ it is taken out of service for replacememt. We obtain the ${\epsilon}$-optimal control age which will minimize the long-run average system cost. An algorithm is developed that is applicable to general failure time distributions and cost functions. The algorithm does not require the condition of unimodality for implementation.

Up to the present, the evaluation measures in the production and inventory management have been studied under the pre-condition that the costs for major factors(e.g,. cost of carrying inventory, cost of demand shortage) are given easily, although in practice, it is difficult. The case in which multiple participants have a different viewpoints in production and inventory management has not been studied, in spite of its frequent occurrence. This study suggests a production and inventory model with multiple objectives corresponding to major factors and the related interactive algorithm based on the preference structures of participants. The problem can be solved through a weighting vector generated by an interaction with participants. The concept of equity is also used in order to guarantee the reasonable distribution of group utility in determining the individual relative weights of participants. This study includes the reality of the model and the decision process in the production and inventory management.

Dynamic Time Warping(in short DTW) is a kind of sequence comparison method. It is widely used in human speech recognition. The timing difference between two speech patterns to be compared is removed by warping the time axes of the speech pattern by minimising the time-normalised distance between them. In the process of finding the minimum time-normalised distance. the efficient method is dynamic programming problem. This paper describes the concept of dynamic time warping method, mathematical formulation and an application.

The literature has recorded many models dealing with manpower forecasting and planning. The approaches used by the various authors are clearly disparate. This paper presents a taxonomy for manpower planning and forecasting methodologies and classifies the landmark developments in this field. The taxonomical schema is then applied to unify the models in consideration of the methods and the decision factors used for forecasting and/or planning. The taxonomy allows for the most complex model structure containing all the factors considered germane in the existing literature.

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

The probability of target survival is the most important factor in the target assignment, Most of the studies about it have assumed the case of one target and ane weapon type. Therefore, they can not be applied to the real situation. In this paper. the quantity and type of enemy assets of the friendly force are considered simultaneously. Considered defense type is the coordinated defense with no impact point prediction. The objective function is to minimize the expected total survival value of targets which are scattered in the defense area. The rules of aircraft assignment are as follows : first, classify targets into several groups, each of those has the same desired damage level secondly. select the critical group which has the least survival value in accordance with the additional aircraft assignment, and finally. assign the same number of attack assets against each target in the critical group. In this paper, the attack assets, the escort assets, and the defense assets are considered. The model is useful to not only the simple aircraft assignment problem but also the complicated wargame models.