• International Journal of Reliability and Applications
• /
• 제3권4호
• /
• pp.165-171
• /
• 2002

An optimization of the M/M/1 queue with impatient customers is studied. The impatient customer does not enter the system if his or her virtual waiting time exceeds the threshold K ＞ 0. After assigning three costs to the system, a cost proportional to the virtual waiting time, a penalty to each impatient customer, and also a penalty to each unit of the idle period of the server, we show that there exists a threshold K which minimizes the long-run average cost per unit time.

• Communications for Statistical Applications and Methods
• /
• 제8권3호
• /
• pp.711-717
• /
• 2001

Two imperfect repair models for system are considered, one introduced by Brown and Proschan(1983) and the other by Lee and Seoh(1999). We, in this paper, after assigning repair costs to the system, optimize both repair models, when the underlying life distributions of the system are exponential, uniform and Weibull.

• Journal of the Korean Statistical Society
• /
• 제34권1호
• /
• pp.39-47
• /
• 2005

We adopt the P/sub λ, T//sup M/ policy of dam to introduce a service policy with alternating service rates for a Poisson arrival queue, in which the service rate alternates depending on the number of customers in the system. The stationary distribution of the number of customers in the system is derived and, after operating costs being assigned to the system, the optimization of the policy is studied.

• 산업경영시스템학회지
• /
• 제11권17호
• /
• pp.9-14
• /
• 1988

A (s, S) inventory policy is studied for a continuous inventory model in which lead times are dependent on the ordering quantity. The model assumes that at most one order is outstanding and demands occur in a compound poison process. The steady-state probability distributions of the inventory levels are derived so as to determine the long-run expected average cost. And the computational procedure is presented.

• 대한산업공학회지
• /
• 제5권1호
• /
• pp.59-66
• /
• 1979

The objective of this paper is to develop a stochastic inventory system model under the so-called continuous-review policy with a Poisson one-at-a-time demand process, iid customer inter-arrival times {Xi}, backorders allowed, and constant procurement lead time $\gamma$. The distributions of the so-called inventory position process {$IP_{(t-r)}$} and lead time demand process {$D_{(t-r,t)}$} are formulated in terms of cumulative demand by time t, {$N_t$}. Then, for the long-run expected average annual inventory cost expression, the "ensemble" average is estimated, where the cost variations for stock ordering, holding and backorders are considered stationary.

• 품질경영학회지
• /
• 제30권4호
• /
• pp.94-105
• /
• 2002

In this paper, replacement problems for a deteriorating system are considered. In the system under consideration, the successive lifetimes after repair become shorter and shorter, while the consecutive repair times become longer and longer. More specifically, the lifetimes of the system form a nonhomogeneous Poisson process, whereas the consecutive repair times constitute a stochastically increasing geometric process. Optimal replacement policies for the long-run average cost rate and the steady state availability are considered. Also taking the cost and the availability into consideration at the same time, the properties of optimal policies under the Cost Priority Policy and the Availability Priority Policy are obtained.

• 대한산업공학회지
• /
• 제26권2호
• /
• pp.128-135
• /
• 2000

This paper considers a consecutive k-out-of-n:F system when the failure of a component in the system induces higher failure rate of the preceding survivor. The reliability, mean time to failure(MTTF), and average failure number of a consecutive k-out-of-n:F system are obtained, when the failure of a component increases the failure rate of the survivor which is working just before the failed component. Then the optimal number of consecutive failed components to minimize this long run average cost rate can be obtained. An example is considered to calculate the reliability, MTTF and average failure number of the system. And two procedures that find the optimal number of consecutive failed components are studied. Then, various cases of system parameters are also studied.

• 한국농공학회논문집
• /
• 제57권5호
• /
• pp.29-35
• /
• 2015

The optimal greenhouse scales for controlled tomato should be studied because the increase of oil price and labor costs following the shortage of workforce makes greenhouse cultivation hard to gain profits. The purpose of this study is to estimate optimal production scales by greenhouse types for controlled tomato. The translog cost function is estimated based on the production cost survey data. The results can be summarized as follows: First, the average production cost of controlled tomato per kg decreases as the production scale increases. Second, according to the tomatoes farm of standard farming income data of RDA, the minimum production scale is 23 ton. Third, the estimated output of single-span greenhouse considering production scale with minimum average cost is 345 ton and production cost per kg is 1,476 won. The corresponding figures of multi-span greenhouse are 415 ton and 936 won, respectively. The study results can be used as basic materials for efficient decision making of tomato farmhouses and novice farmers. Also, the study shows that multi-span greenhouse should be encouraged to be built, since it requires lower marginal cost than single greenhouse. The results of this paper will help increase the income of farmhouses and cut expenses for the coming years.

• 한국경영과학회지
• /
• 제18권1호
• /
• pp.119-126
• /
• 1993

We study a manufacturing process that is quite common in semiconductor wafer fabrication of semiconductor chip production. A machine is used to process a job consisting of J wafers. Each job requires a setup, and the i$_{th}$ setup for a job is sucessful with probability P$_{i}$. The setup is prone to failure, which results in the loss of expensive wafers. Therefore, a tiral run is first conducted on a small batch. If the set up is successful, the test is passed and the balance of the job can be processed. If the setup is unsuccessful, the exposed wafers are lost to scrap and the mask is realigned. The process then repeats on the balance of the job. We call this as send-ahead policy and consider general policies in which the number of wafers that are sent shead depend on the cost of the raw wafer, the sequence of success probabilities, and the balance of the job. We model this process and determine the expected number of good wafers per job,the expected time to process a job, and the long run average throughput. An algorithm to minimize the cost per good wafer subject to a demand constraint is provided.d.d.

• 한국신뢰성학회:학술대회논문집
• /
• 한국신뢰성학회 2000년도 춘계학술대회 발표논문집
• /
• pp.63-70
• /
• 2000

Brown and Proschan(1983) introduced a model for imperfect repair. At each feilure of a device, with probability p, it is repaired completely or replaced with a new device(perfect repair), and with probability 1 - p, it is returned to the functioning state, but it is only recovered to its condition just prior to failure(imperfect repair or minimal repair). In this paper, we limit the number of consecutive minimal repairs by n. We find some useful properties about ${\mu}$$\_$k/, the expected time between the k-th and the (k + 1)-st repair under the assumption that only minimal repairs are performed. Then, we assign cost to each repair and find the value of n which minimizes the long-run average cost for a fixed p under the condition that distribution F of the device is DMRL.