• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.1
• /
• pp.41-45
• /
• 1984

A resource constrained scheduling problem that involves trade-off between resources and time is considered. Models are considered. Models are presented as zero-one integer program and objectives of models include minimum project completion time and minimum total project cost.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.808-811
• /
• 1996

A mathematical model was developed for the simulation of a Pressure Swing Adsorption process with dehydrogenation reaction. The minimum number of beds and optimum operating sequence were determined using MINLP under the given operating conditions. Based on these results, we estimated the minimum annual cost.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.04a
• /
• pp.195-202
• /
• 1995

In this study, the optimization program is developed to provide preliminary designs of steel-box girder bridges with minimum cost. The advantages of steel-box girder deck, when comparing with other girder types, are higher torsional rigidity and better resistance against corrosion. To achieve more rational design, systematic design procedure is required, by which the design constraints on steel-box girder are satisfied and the design variables with minimum cost are obtained. In the Proposed optmum design Process, the design variables are forced to be selected from the available discrete value set. The efficiency of the developed program has been verified by companing with previous designed sections and the resulting optimum cost with discrete variables has been compared with those of continuous variables.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.1-10
• /
• 1995

The purpose of this paper is to develop a method of the sensitivity analysis that can be applied to a non-tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1a is the well known method applicable to a tree solution. However this method can not be applied to a non-tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient we present a method that the sensitivity analysis of Type 2 is solved by finding the shortest path. Besides we also show that the results of Type 2 and Type 1 are the same in a spanning tree solution. For the right-hand side constant or the capacity, the sensitivity analysis of Type 2 is solved by a simple calculation using arcs with intermediate values.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.31
• /
• pp.59-72
• /
• 1994

This paper deals with ordering policies of consumable goods which have large demand rates in a multi-level distribution system. The system we are concerned consists of one Central Distribution Center(CDC) and N non-identical Regional Distribution Centers(RDCs) which have different demand rates, minimum fillrates, leadtimes, etc. The customer demand on the RDC is stationary poisson and the RDCs demand on the CDC is superposition of Q-stage Erlang distributions. We approximate the RDCs and CDC demand distribution to nomal in order to enhance the efficiency of algorithm. The relevant costs include a fixed ordering cost and inventory holding cost, and backorder cost. The objective is to find a continuous-review ordering policy that minimizes the expected average costs under constraints of minimum fill rates of RDCs and maximum allowable mean delay of CDC. We developed an algorithm for determining the optimal ordering policies of the CDC and the RDCs. We verified and compared the performance of the algorithm through the simulation using the algorithm result as the input parameters.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2000.04a
• /
• pp.485-490
• /
• 2000

This paper describes the application of discretized continuum-type optimality criteria (DCOC) for minimum-cost design of the reinforced concrete frame structures consisting of beams and columns. The cost of construction as objective function which includes the costs of concrete, reinforced steel and formwork is minimized. The design constraints include limits on the maximum deflection at a prescribed node, bending and shear strengths in beams, uniaxial bending strength of columns according to design codes(CEB/FIP, 1990). In the first stage, only beams with uniform cross-sectional parameters per span are considered. But the steel ratio is allowed to vary freely. The cross-sectional parameters and steel ratio in each column are assumed to be uniform for practical reasons. Optimality criteria is given based on the well known Kuhn-Tucker necessary conditions, followed by an iterative procedure for designs when the design variables are the depth and the steel ratio. The versatility of the DCOC technique has been demonstrated by considering numerical examples which have one-bay four-storey frame.

• Korean Management Science Review
• /
• v.22 no.2
• /
• pp.99-107
• /
• 2005

Recently, Tang and Chanson proposed a minimum cost distribution model for replicated Web contents subject to an expiration-based consistency management. Their model is a progress in that it can consider multiple replicas via the network of servers located on the Web. The proposed greedy heuristic, however, has an undesirable feature that the solution tends to converge a local optimum at an early stage of the algorithm. in this paper, we propose an algorithm based on a simple idea of preventing the early local convergence. The new algorithm provides solutions whose cost are, on the average, 27$\%$ lower than in the previous algorithm.

• Journal of the Korean Statistical Society
• /
• v.7 no.1
• /
• pp.27-43
• /
• 1978

This paper deals with the problem of obtaining a minimum cost acceptance sampling plan for destructive testing. The cost model is constructed under the assumption that the sampling procedure takes the following form; 1) lots rejected on the first sample are acreened with a non-destructive testing, 2) the screening is assumed to be imperfect, and therefore, after the screening, a second sample is taken to determine whether to accept the lot of to scrap it. The usual sampling procedures for destructive testing can be regarded as special cases of the above one. Utilizing Hald's Bayesian approach, procedures for finding the global optimal sampling plans are given. However, when the lot size is large, the global plan is very different to obtain even with the aid of an electronic computer. Therefore a method of finding suboptimal plan is suggested. An example with uniform prior is also given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.742-743
• /
• 2007

A maintenance plan of power system equipment reduces failure rate caused by equipment's age. To prevent unexpected failure, the maintenance is performed periodically according to the interval time. The more expansive equipment's scale is, the more the maintenance without considering costs sustains a economical loss. Hence, the maintenance's time and the cost must be considered when maintenance which is considering the reliability is implemented. In this paper, optimum maintenance interval is calculated by considering minimum maintenance cost of the equipment with the combined cycle units in Korea power systems.