Computer-aided logistics support system is recognized an essential system to reduce supply and maintenance cost, and to improve readiness of weapon system or operationable composite machines. According to these trends, this paper focuses on the design scheme and the computerization strategy of information management system for Integrated Logistics Support (ILS) work. Suggested system. LAMIS(Logistics support Analysis Management Information System) is a total system that composed of Logistics Support Analysis Management information system (LSAM), Configuration Management Information System (CMIS), Maintenance Management Information System (MMIS), Project Management System (PMS) and Information Retrival System(IRS) etc. Also, LAMIS is a computerized tool that improves current supply and maintenance support program, that attempts to reliable requirment analysis of logistics support elements, and that supports to use the existing technical specification of similar one when weapon system acquisition project is started newly. When LAMIS implication is completed, it can be applied to logistics support of defense or commercial site. Straightway, LAMIS will be enhanced with computer - aided design system, engineering drawing system, interactive electronic technical manual system, electronic data interchange system, and three dimensional simulation system to weapon system configuration. When that is done, LAMIS is CALS system.

A Stochastic simulation model for optimal design and evaluation of the integrated weapon systems under the consideration of the RAM (reliability, availability and maintainability) and life cycle cost (LCC) was developped. This model is supposed to satisfy a need regarding the methodology of optimaldesign and performance evaluation for both developpers and users of weapon systems.

According to the plan on Defense Computer Network, hundreds of troops and ten thousands of end users will be joined in the Defense Computer Networn the near future. Thus, we need hierarchical addressing methods between source station and destination station in order to send a message efficiently. On the basis of the above background, we proposed the addressing methods for both TCP/IP environment which is a current standard protocol and OSI environment which will be a future protocol in this paper. The network interface. routings and address management have considered in our proposed addressing methods.

In the existing deterministic network, the capacity of each arc has been assumed to have a determined property. In reality it may have a property which cannot be determined, and even if it is determined, it contains many errors. Fuzzy theory is efficient in dealing with these kinds of properties. The object of this study is to show that the capacity of each arc and the goal quantity have fuzziness and to develop a new method of determining the fuzzy maximal flow quantity.

Shortest paths are one of the simplest and most widely used concepts in deterministic networks. A decison of troops movement route can be analyzed in the network with a shortest path algorithm. But in reality, the value of arcs can not be determined in the network by crisp numbers due to imprecision or fuzziness in parameters. To account for this reason, a fuzzy network should be considered. A fuzzy shortest path can be modeled by general fuzzy mathematical programming and solved by fuzzy dynamic programming. It can be formulated by the fuzzy network with lingustic variables and solved by the Klein algorithm. This paper focuses on a revised fuzzy shortest path algorithm and an application is discussed.

A time-varying nonhomogeneous poisson process approximation of the nonexponential stochastic Lanchester model is defined and evaluated over a range of combat parameters including initial force sizes. breakpoints. and interkilling random variables. The proposed approximation is far excellent and takes much less CPU time than the existing models. The sensitivity analysis was peformed to evaluate the efficiency of the proposed model and three recommended factors are suggested to guide the combat operators.

A policy of periodic replacement with minimal repair at failure is considered for a complex system. Under such a policy the system is replaced at periodic times. iT(i=1,2, $\ldots$), while minimal repair is performed at any intervening system failures. The cost of the j-th minimal repair to the component which fails at age t is g(C(t). $c_j$ (t)), where C(t) is the age-dependent random part, $c_j$(t) is the deterministic part which depends on the age and the number of the minimal repair to the component, and g is a positive nondecreasing continuous function. The cost of replacement is expensive when the number of failures occurring in (0. T) is greater than a threshold level. The problem of determining the optimal replacement period, $T^{\ast}$, which minimizes the total expected cost per unit time over an infinite time horizon is considered. Various special cases are considered.

In this paper, the computational problems of packet transmission probability (PTP) in a computer communication network (CCN) under flooding routing are investigated. To avoid a congestion under this routing, two control methods are considerd, i. e., copy storage control and hop count control. Problems of PTP under flooding routings with these two control methods are respectively shown to be equivalent to those of source-to-terminal reliability(STR) with an exception for a case of hop count control where the hop count is less than the length of the longest path. For this exceptional case, an efficient computational algorithm for PTP is developed. This algorithm is proposed as an efficient tool for the determination of hop count which satisfies a given reliability constraint. A numerical example illustrates a proposed algorithm.

In this paper, we consider the shortest path problem of a Robot car moving in a workspace which consists of some obstacles. The motion of the Robot car is considered to have initial and final directions with some restrictions in the curvature of the path. At first we consider the problem in the case of having no obstacles and we give an analytical solution. Then wre present an algorithm to find a feasible path in the case of having obstacles and a method to improve this feasible path into a minimal path. Some computational results using Graph theory and Linear programming have been included.

In this paper, we define a problem finding a simple path that maximizes the sum of the satisfied Origin-Destination (O-D) flows between nodes covered by that path as a Maximum O-D Flow Path Problem(MODEP). We established a formulation and suggested a method finding MODEP in a directed network. The method utilizes the constraint relaxation technique and the Dual All Integer Algorithm.

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.

In this paper in order to prevent break of operation of equipments resulted from the delay of parts supply, the continuous review(Q, r) inventory model with probabilistic lead time is developed. If the lead tire is random varivable, the cycle also is stochastic. Then it is not easy to obtain the total cost equation of this inventory model. Therefore it is assumed that one cycle is the interval of reorder points. When the lead time is assumed to have exponential probability distribution, the lot-size and reorder point which minimize total cost are obtained. And as the lead time increases, the order quantity and the total cost are greater, but the reorder point increases by a certain point of time and then decreases.