• 산업경영시스템학회지
• /
• 제33권3호
• /
• pp.63-70
• /
• 2010

Based on the known results of the expected busy periods for the triadic Min (N, T, D) and Max (N, T, D) operating policies applied to a controllable M/G/1 queueing model, a relation between them is constructed. Such relation is represented in terms of the expected busy periods for the simple N, T and D, and the dyadic Min (N, T), Min (T, D) and Min (N, D) operating policies. Hence, if any system characteristics for one of the two triadic operating policies are known, unknown corresponding system characteristics for the other triadic operating policy could be obtained easily from the constructed relation.

• 대한산업공학회지
• /
• 제25권4호
• /
• pp.527-531
• /
• 1999

Instead of using the expected unfinished work, we use the expected number of customers in the system for finding the optimal D-policy for the M/G/1 queue in order to make it consistent with other control policies such as N-policy and T-policy.

• Membrane and Water Treatment
• /
• 제9권2호
• /
• pp.123-128
• /
• 2018

Common aquaculture practices include the use of certain pharmaceuticals such as antibiotics in avoiding diseases and promoting a healthier growth of the culture. The aim of this study is to monitor and assess the influence of different low oxytetracycline concentrations on the transformation of nitrogen compounds under aeration condition in a lab-scale recirculating aquaculture system (RAS). Over $1mg\;L^{-1}$ dose of oxytetracycline to aquaculture had induced ammonia($NH_4-N$), nitrate($NO_3-N$), soluble COD accumulation in RAS. In addition, nitrous oxide ($N_2O$) emission from RAS was significantly reduced during the oxytetracycline dose periods. After ceasing the dose of oxytetracycline, ammonia oxidation and nitrous oxide re-emission were observed. This observation indicated that low concentrations of oxytetracycline could affect the nitrogen species in RAS. Also, the emission mechanisms of $N_2O$ may not be only dependent on nitrification process but also dependent on denitrification process in our RAS system.

• 한국보건행정학회:학술대회논문집
• /
• 한국보건행정학회 1999년도 전기학술대회
• /
• pp.3-45
• /
• 1999

• 한국보건행정학회:학술대회논문집
• /
• 한국보건행정학회 1999년도 전기학술대회
• /
• pp.49-79
• /
• 1999

• 대한산업공학회지
• /
• 제34권1호
• /
• pp.98-107
• /
• 2008

The purpose of this paper is to present an optimization scheme that aims at minimizing the expected cost per unittime. This study considers a linear connected-(r, s)-ouI-of-(m, n):f lattice system whose components are orderedlike the elements of a linear (m, n)-matrix. We assume that all components are in the state 1 (operating) or 0(failed) and identical and s-independent. The system fails whenever at least one connected (r, s)-submatrix offailed components occurs. To find the optimal threshold of maintenance intervention, we use a simulatedannealing(SA) algorithm for the cost optimization procedure. The expected cost per unit time is obtained byMonte Carlo simulation. We also has made sensitivity analysis to the different cost parameters. In this study,utility maintenance model is constructed so that minimize the expense under full equipment policy throughcomparison for the full equipment policy and preventive maintenance policy. The full equipment cycle and unitcost rate are acquired by simulated annealing algorithm. The SA algorithm is appeared to converge fast inmulti-component system that is suitable to optimization decision problem.

• 한국경영과학회지
• /
• 제18권3호
• /
• pp.51-63
• /
• 1993

We consider a cyclid server system under N-policy. This system consists of multiple queues served in a cyclic order by a single server. In this paper, we consider the following control policy. Every time server polls one queue, the server inspects the state of the queue. If the total number of units is found to have reached or exceeded a pre-specified value, the server begins to serve the queue until it is empty. As soon as the queue becomes empty, the server polls next queue. An approximate analysis of this system is presented. Sever vacation model is used as an analytical tool. However, server vacation periods are considered to be dependent on the service times of respective queues. The results obtained from the approximate analysis are ompared with simulation results.

• 품질경영학회지
• /
• 제23권2호
• /
• pp.43-52
• /
• 1995

A replacement policy under two types of failures, repairable or irrepairable, is considered, In the policy, the system is replaced at the n-th failure if all the previous (n-1) failures are repairable; Otherwise it is replaced at the first irrepairable failure. Assuming that the j-th failure is repairable with probability ${\alpha}_j$ and minimal repairs are performed for repairable failures between replacements, we derive the expected cost rate through the application of NHPP in order to determine the optimal number $n^*$. The policy includes some previous studies as special cases.

• 산업경영시스템학회지
• /
• 제31권4호
• /
• pp.86-92
• /
• 2008

The expected busy period for the controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy is derived by using a new concept so called "the pseudo probability density function." In order to justify the proposed approaches for the triadic policy, well-known expected busy periods for the dyadic policies are recovered from the obtained result as special cases.

• 산업공학
• /
• 제21권3호
• /
• pp.254-261
• /
• 2008

Connected-(r,s)-out of-(m,n) : F system is an important topic in redundancy design of the complex system reliability and it's maintenance policy. Previous studies applied Monte Carlo simulation and genetic, simulated annealing algorithms to tackle the difficulty of maintenance policy problem. These algorithms suggested most suitable maintenance cycle to optimize maintenance pattern of connected-(r,s)-out of-(m,n) : F system. However, genetic algorithm is required long execution time relatively and simulated annealing has improved computational time but rather poor solutions. In this paper, we propose the ant colony optimization approach for connected-(r,s)-out of-(m,n) : F system that determines maintenance cycle and minimum unit cost. Computational results prove that ant colony optimization algorithm is superior to genetic algorithm, simulated annealing and tabu search in both execution time and quality of solution.